• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.5
• /
• pp.841-849
• /
• 2001

The pixel information of the object was obtained sequentially and pixels were clustered to a label by the line labeling method. Feature points were determined by finding the slope for edge pixels after selecting the fixed number of edge pixels. The slope was estimated by the least square method to reduce the detection error. Once a matching point was determined by comparing the feature information of the object and the pattern, the parameters for translation, scaling and rotation were obtained by selecting the longer line of the two which passed through the matching point from left and right sides. Finally, modified Hausdorff Distance has been used to identify the similarity between the object and the given pattern. The multi-label method was developed for recognizing the patterns with more than one label, which performs the modified Hausdorff Distance twice. Experiments have been performed to verify the performance of the proposed algorithm and method for simple target image, complex target image, simple pattern, and complex pattern as well as the partially hidden object. It was proved via experiments that the proposed image matching algorithm for recognizing the object had a good performance of matching.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.2
• /
• pp.73-78
• /
• 2004

By modeling the block matching algorithm as a function of the correlation of image blocks, we derive search patterns for fast block matching motion estimation. The proposed approach provides an analytical support lot the diamond-shape search pattern, which is widely used in fast block matching algorithms. We also propose a new fast motion estimation algorithm using adaptive search patterns and statistical properties of the object displacement. In order to select an appropriate search pattern, we exploit the relationship between the motion vector and the block differences. By changing the search pattern adaptively, we improve motion prediction accuracy while reducing required computational complexity compared to other fast block matching algorithms.

• Journal of Industrial Technology
• /
• v.21 no.B
• /
• pp.67-74
• /
• 2001

According as the patterns of PCB (Printed Circuit Board) become denser and complicated, quality and accuracy of PCB influence the performance of final product. It's attempted to obtain trust of 100% about all of parts. Because human inspection in mass-production manufacturing facilities are both time-consuming and very expensive, the automation of visual inspection has been attempted for many years. Thus, automatic visual inspection of PCB is required. In this paper, we used an algorithm which compares the reference PCB patterns and the input PCB patterns are separated an object and a scene by filtering and edge detection. And than compare two image using pattern matching algorithm. We suggest an defect inspection algorithm in PCB pattern, to be satisfied low cost, high speed, high performance and flexibility on the basis of $640{\times}480$ binary pattern.

• Proceedings of the KOSOMBE Conference
• /
• v.1991 no.05
• /
• pp.51-55
• /
• 1991

This paper describes an algorithm of pattern analysis of ECG signals by significant points extraction method. The significant points can be extracted by modified zerocrossing method, which method determines the real significant point among the significant point candidates by zerocrossing method and slope rate of left side and right side. This modified zerocrossing method improves the accuracy of detection of real significant point position. This paper also describes the pattern matching algorithm by a hierarchical AND/OR graph of ECG signals. The decomposition of ECG signals by a hierarchical AND/OR graph can make the pattern matching process easy and fast. Furthermore the pattern matching to the significant points reduces the processing time of ECG analysis.

• Journal of Biomedical Engineering Research
• /
• v.12 no.2
• /
• pp.131-138
• /
• 1991

This paper describes an algorithm of pattern analysis of ECG signals by significant points extraction method. The significant points can be extracted by modified zerocrossing method, which method determines the real significant point among the significant point candidates by zerocrossing method and slope rate of left side and right side. This modified zerocrossing method improves the accuracy of detection of real slgnficant polnt Position. This Paper also describes the pattern matching algorithm by a hierarchical AND/OR graph of ECG signals. The decomposition of ECG signals by a hierarchical AND/ OR graph can make the pattern matching process easy and fast, Furthermore the pattern matching to the significant points reduces the processing time of ECG analysis.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.57-65
• /
• 2004

In the block matching algorithm, search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image quality. In this paper, we propose a new fast block matching algorithm using the unit-diamond search pattern and the flat-hexagon search pattern. Our algorithm first finds the motion vectors that are close to the center of search window using the unit-diamond search pattern, and then fastly finds the other motion vectors that are not close to the center of search window using the flat-hexagon search pattern. Through experiments, compared with the hexagon-based search algorithm(HEXBS), the proposed unit-diamond and flat-hexagonal pattern search algorithm(UDFHS) improves as high as 11∼51% in terms of average number of search point per motion vector estimation and improves about 0.05∼0.74㏈ in terms of PSNR(Peak Signal to Noise Ratio).

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.37 no.5
• /
• pp.470-475
• /
• 2009

This paper is the study which is head tracker using pattern matching. Proposal algorithm obtains initial attitude of head tracker using pattern matching. Optical head tracker consists of infrared LEDs(features) which are attached helmet as pattern, stereo infrared cameras. Proposal algorithm analyzes patterns by error rate of feature distance and estimates feature characteristic number. Initial attitude of head tracker is obtained to compare map data and feature characteristic number.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.05a
• /
• pp.362-368
• /
• 2005

This paper is related to the fast block matching algorithm, especially a method for expanding the search pattern using the second local matching point in the adaptive hexagonal search. To reduce the local minima problem in fast motion estimation, the proposed method expands the search pattern by adding new searching points selected by using the second local matching point to conventional search pattern formed by the first local matching point in the adaptive hexagonal search. According to estimating the motion vector by applying block matching algorithm based on hexagonal search to the expanded search pattern, the proposed method can effectively carry out fast motion estimation to improve the performance in terms of compensated image quality.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.812-820
• /
• 1999

In two-dimensional dictionary matching problem, we are given a two-dimensional text T and a dictionary D={P\ulcorner, ...., P\ulcorner} as a set of two-dimensional patterns. We seek the locations of all the dictionary patterns that appear in T. We present a new two-dimensional pattern matching algorithm that can handle just a single pattern, and then show how to extend it into two-dimensional dictionary matching algorithm. The suggested algorithm is practical in the sense that it can deal that it uses a small extra space proportional to the size of the dictionary, and that it is quite simple to be implemented without depending on complicated data structures.

• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.825-832
• /
• 2010

This paper presents only a matching algorithm based on Delaunay triangulation and Parametrization from the extracted minutiae points. This method maps local neighborhood of points of two different point sets to unit-circle using topology information by Delaunay triangulation method from feature points of real fingerprint. Then, a linked convex polygon that includes an interior point is constructed as one-ring which is mapped to unit-circle using Parametrization that keep shape preserve. In local matching, each area of polygon in unit-circle is compared. If the difference of two areas are within tolerance, two polygons are consider to be matched and then translation, rotation and scaling factors for global matching are calculated.