Browsing by Author "HWANG, SY"

Now showing 1 - 6 of 6

2 HEURISTICS FOR ARRANGING THE ORDER OF FEATURE-EXTRACTION OPERATIONS IN RECURSIVE BAYESIAN DECISION RULE
(1990)
HWANG, SY
;
交大名義發表
;
資訊工程學系
;
National Chiao Tung University
;
Department of Computer Science
A CONNECTIONIST APPROACH FOR THRESHOLDING
(1992)
CHANG, CC
;
CHANG, CH
;
HWANG, SY
;
資訊工程學系
;
Department of Computer Science
A GENETIC ALGORITHM WITH DISRUPTIVE SELECTION
(1993)
KUO, T
;
HWANG, SY
;
資訊科學與工程研究所
;
Institute of Computer Science and Engineering
A PARALLELISM ANALYZER FOR CONSERVATIVE PARALLEL SIMULATION
(1995-06-01)
WONG, YC
;
HWANG, SY
;
LIN, JYB
;
資訊工程學系
;
Department of Computer Science
Most small-scale simulation applications are implemented by sequential simulation techniques, As the problem size increases, however, sequential techniques may be unable to manage the time complexity of the simulation applications adequately, It is natural to consider re-implementing the corresponding large-scale simulations using parallel techniques, which have been reported to be successful in reducing the time complexity for several examples, However, parallel simulation may not be effective for every application, Since the implementation of parallel simulation for an application is usually very expensive, it is required to investigate the performance of parallel simulation for a particular application before re-implementing the simulation, The Chandy-Misra parallel, discrete-event simulation paradigm has been utilized in many large-scale simulation experiments, and several significant extensions have been based on it, Hence the Chandy-Misra protocol is adopted here as a basic model of parallel simulation to which our performance prediction techniques are applied, For an existing sequential simulation program based on the process interaction model, this paper proposes a technique for evaluating Chandy-Misra parallel simulation without actually implementing the parallel program, The idea is to insert parallelism analysis code into the sequential simulation program, When the modified sequential program is executed, the time complexity of the parallel simulation based on the Chandy-Misra protocol is computed, Our technique has been used to determine whether a giant Signaling System 7 simulation (sequential implementation) should be re-implemented using the parallel simulation approach.
ON PARALLELIZING THE DEMPSTER-SHAFER METHOD USING TRANSPUTER NETWORK
(1993-07-01)
WONG, YC
;
HWANG, SY
;
資訊工程學系
;
Department of Computer Science
Manipulating uncertain information is a necessary capability for any intelligent system. Several approaches, such as the Bayesian theory, Certainty Factors, and the Dempster-Shafer method, have been proposed to handle uncertainty. Among them the Dempster-Shafer method is the most theoretical sound and consistent with human behavior; however, it is argued on its computational complexity. This article presents a parallel reasoning algorithm based on the Dempster-Shafer method and implements it on the transputer network. We first analyze the best topologies of the transputer network with various numbers of processors; then the performance of the parallel program, such a speedup and efficiency, is measured on these best topologies.
STATE-SPACE SEARCH FOR HIGH-LEVEL CONTROL OF MACHINE VISION
(1992-06-01)
HWANG, SY
;
交大名義發表
;
資訊工程學系
;
National Chiao Tung University
;
Department of Computer Science
Computer vision is a task of information processing that can be modeled as a sequence of subtasks. A complete vision process can be constructed by synthesizing individual operators performing the subtasks. Previous work in computer vision has emphasized the development of individual operators for a specific subtask. However, the lack of knowledge about other levels of processing, while developing the operators for a specific level, makes the development of a robust operator and thus a robust system unlikely. To obtain vision problem-solving methods that are robust in the face of variations in image lighting, arrangements of objects, viewing parameters, etc., we can simply incorporate all possible sequences of image-processing operators, each of which deals with a specific situation of input images; then an adaptive control mechanism such as a state-space search procedure can be built into the methods. Such a procedure dynamically determines an optimal sequence of image-processing operators to classify an image or to put its parts into correspondence with a model or set of models. One critical problem in solving vision problems with a state-space search model is how to decide the costs of paths. This paper details the state-space search model of computer vision as well as the design of cost functions in terms of information distortions. A vision system, VISTAS, has been constructed under the state-space search model and its parallel version has been simulated.