• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.1
• /
• pp.12-18
• /
• 2012

Stereo correspondence is the central problem of stereo vision. In this paper, we propose a stereo matching scheme based on a genetic algorithm using a multi-resolution method and AD-Census. The proposed approach considers the matching environment as an optimization problem and finds the disparity by using a genetic algorithm And adaptive chronosome structure using edge pixels and crossover mechanism are employed in this technique. A cost function is composes of certain constraints whice are commonly used in stereo matching. AD-Census measure is applied to reduce disparity error. To increase the efficiency of process, we apply image pyramid method to stereo matching and calculate the initial disparity map at the coarsest resolution. Then initial disparity map is propagated to the next finer resolution, interpolated and performed disparity refinement using local feature vector. We valid our method not only reduces the search time for correspondence compared with conventional GA-based method but also ensures the validity of matching.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.4
• /
• pp.2757-2763
• /
• 2015

p-Snake is an energy minimizing algorithm that applies an additional prototype energy to the existing Active Contour Model and is used to extract the contour line in the area where the edge information is unclear. In this paper suggested the creation of a prototype energy field that applies a variable prototype expressed as a combination of circle and straight line primitives, and a fudge function, to improve p-Snake's contour extraction performance. The prototype was defined based on the parts codes entered and the appropriate initial contour was extracted in each primitive zones acquired from the pre-processing process. Then, the primitives variably adjusted to create the prototype and the contour probability based on the distance to the prototype was calculated through the fuzzy function to create the prototype energy field. This was applied to p-Snake to extract the contour from 100 images acquired from various small parts and compared its similarity with the prototype to find that p-Snake made with the adaptive prototype was about 4.6% more precise than the existing Snake method.

• The Journal of the Acoustical Society of Korea
• /
• v.15 no.1
• /
• pp.54-60
• /
• 1996

In most pattern recognition and image understanding applications, images are degraded by noise and other distortions. Therefore, it is more relevant to decide how similar two objects are rather than to decide whether the two are exactly the same. In this paper, we propose a method for recognizing degraded symbols using a distance measure between two graphs representing the symbols. a symbol is represented as a graph consisting of nodes and edges based on the run graph concept. The graph is then transformed into a reference model graph with production rule containing the embedding transform. The symbols are recognized by using the distance measure which is estimated by using the number of production rules used and the structural homomorphism between a transformed graph and a model graph. the proposed approach is applies to the recognition of non-note musical symbols and the result are given.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.2
• /
• pp.69-75
• /
• 2012

This paper presents a novel de-interlacing algorithm that can make up motion compensation errors by using maximum a posteriori (MAP) estimator. First, a proper registration is performed between a current field and its adjacent fields, and the progressive frame corresponding to the current field is found via MAP estimator based on the computed registration information. Here, in order to obtain a stable solution, well-known bilateral total variation (BTV)-based regularization is employed. Next, so-called feathering artifacts are detected on a block basis effectively. So, edge-directional interpolation is applied to the pixels where feathering artifact may happen, instead of the above-mentioned temporal de-interlacing. Experimental results show that the PSNR of the proposed algorithm is on average 4dB higher than that of previous studies and provides the better subjective quality than the previous works.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.12
• /
• pp.2953-2960
• /
• 2014

In the field of image recognition, circle detection is one of the most widely used techniques. Conventional algorithms are mainly based on Hough transform, which is the most straightforward algorithm for detecting circles and for providing enough robust algorithm. However, it suffers from large memory requirements and high computational loads, and sometimes tends to detect incorrect circles. This paper proposes an optimal circle detection and approximation method which is applicable for inspecting fiber optic connector endface. The proposed method finds initial center coordinates and radius based on the initial edge lines. Then, by introducing the simplified K-means algorithm, the proposed method investigates a substitute-circle by minimizing the area of non-overlapped regions. Through extensive simulations, it is shown that the proposed method can improve the error rate by as much as 67% and also can reduce the computing time by as much as 80%, compared to the Hough transform provided by the OpenCV library.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.46 no.6
• /
• pp.1-8
• /
• 2009

Detecting entry and exit zones in a view covered by multiple cameras is an essential step to determine the topology of the camera setup, which is critical for achieving and sustaining the accuracy and efficiency of multi-camera surveillance system. In this paper, a graph theoretic clustering method is proposed to detect zones using data points which correspond to entry and exit events of objects in the camera view. The minimum spanning tree (MST) is constructed by associating the data points. Then a set of well-formed clusters is sought by removing inconsistent edges of the MST, based on the concepts of the cluster balance and the cluster density defined in the paper. Experimental results suggest that the proposed method is effective, even for sparsely elongated clusters which could be problematic for expectation-maximization (EM). In addition, comparing to the EM-based approaches, the number of data required to obtain stable outcome is relatively small, hence shorter learning period.

• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.3
• /
• pp.60-68
• /
• 2007

In this paper, we propose an automatic facial expressions recognition system to analyze facial expressions (happiness, disgust, surprise and neutral) using tree structures based on heuristic rules. The facial region is first obtained using skin-color model and connected-component analysis (CCs). Thereafter the origins of user's eyes are localized using neural network (NN)-based texture classifier, then the facial features using some heuristics are localized. After detection of facial features, the facial expression recognition are performed using decision tree. To assess the validity of the proposed system, we tested the proposed system using 180 facial image in the MMI, JAFFE, VAK DB. The results show that our system have the accuracy of 93%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.10
• /
• pp.925-932
• /
• 2012

In this paper, we develop a pattern recognition algorithm applied to a humanoid robot which is exploited as a guide for visually handicapped persons to find a desired path to their destinations. Behavior primitives of a humanoid robot are defined, and Canny's edge detection algorithm is employed to extract the pattern and color of the paving blocks that especially devised for visually handicapped persons. Based on these, an efficient path finding algorithm is developed and implemented on a humanoid robot, running on an embedded linux operating system equipped with a video camera. The performance of our algorithm is experimentally examined in terms of the response time and the pattern recognition ratio. In order to validate our algorithm in various realistic environments, the experiments are repeatedly performed by changing the tilt of paving blocks and the brightness in surrounding area. The results show that our algorithm performs sufficiently well to be exploited as a path finding system for visually handicapped persons.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.8
• /
• pp.1767-1775
• /
• 2010

As factory automation is getting popular, there has been a lot of research concerned with stereo vision systems as a part of an automation system with unmanned moving equipment. In the stereo vision system, information about an object could be gained by searching through images. Edges which are based on the information about an object are used to find the position of the object and send a message of its position coordinate to a unmanned crain. This thesis proposes an algorithm to find the center point of the object's surface which is connected to the unmanned crain's hookblock, and to recognize the shape of the object by using two CCD cameras. At first, getting information about the edges, and distinguishing each edge's characteristics depend on user's option, and then find the location information by a set of positions that are proposed. This thesis is expected to be devoted to the development of an automation system of unmanned moving equipment.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.7
• /
• pp.1556-1567
• /
• 2009

The death rate of pedestrian in car accidents in Korea is 2.5 times higher than the average of OECD countries'. If a system that can detect pedestrians and send alarm to drivers is built and reduces the rate, it is worth developing such a pedestrian detection system (PDS). Since the accident rate in which pedestrians are involved is higher at nighttime than in daytime, the adoption of nighttime PDS is being standardized by big auto companies. However, they are usually using night visions or multiple sensors, which are usually expensive. In this paper we suggest a method for nighttime PDS using single wide dynamic range (WDR) monochrome camera in visible spectrum band. In our experiments, pedestrians were accurately detected if only most edges of pedestrians could be obtained.