• The Journal of Korea Robotics Society
• /
• v.17 no.3
• /
• pp.373-380
• /
• 2022

This paper considers a method of fast correspondence matching for iterative closest point (ICP) algorithm. In robotics, the ICP algorithm and its variants have been widely used for pose estimation by finding the translation and rotation that best align two point clouds. In computational perspectives, the main difficulty is to find the correspondence point on the reference point cloud to each observed point. Jump-table-based correspondence matching is one of the methods for reducing computation time. This paper proposes a method that corrects errors in an existing jump-table-based correspondence matching algorithm. The criterion activating the use of jump-table is modified so that the correspondence matching can be applied to the situations, such as point-cloud registration problems with highly curved surfaces, for which the existing correspondence-matching method is non-applicable. For demonstration, both hardware and simulation experiments are performed. In a hardware experiment using Hokuyo-10LX LiDAR sensor, our new algorithm shows 100% correspondence matching accuracy and 88% decrease in computation time. Using the F1TENTH simulator, the proposed algorithm is tested for an autonomous driving scenario with 2D range-bearing point cloud data and also shows 100% correspondence matching accuracy.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.9
• /
• pp.714-719
• /
• 2003

We propose a measuring method of large object using the pattern matching. It is hard and expensive to get the complete 3D data when the object is large and exceeds the limit of measuring devices. The large object is divided into several smaller areas and is scanned several times to get the data of all the pieces. These data are aligned to get the complete 3D data using the pattern matching method such as point pattern matching method and transform matrix algorithm. The laser slit beam and CCD camera are applied for the experimental measurement. Visual C＋＋ on Windows 98 is implemented in processing the algorithm.

• 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.

• 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.

• 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 Korean Institute of Telematics and Electronics
• /
• v.27 no.1
• /
• pp.96-104
• /
• 1990

In this paper, a novel method of jig-saw puzzle matching is proposed using a modifided boundary matching algorithm without a priori knowledge for the matched puzzle. Specifically, a boundary tracking algorithm is utilised to segment each puzzle from low-resolution image data. Segmented puzzle is described via corner point, angle and distance between two adjacent coner point, and convexity and/or concavity of corner point. Proposed algorithm is implemented and tested in IBM PC and PC version vision system, and applied successfully to real jig-saw puzzles.

• 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.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.11a
• /
• pp.307-310
• /
• 2000

The measuring method of large object using the pattern matching is discussed in the paper. It is hard and expensive to get the complete 3D data when the object is large or exceeds the limit of measuring devices. The large object is divided into several smaller areas and is scanned several times to get the data of all the pieces. These data are aligned to get the complete 3D data using the pattern matching method. The point pattern matching method and transform matrix algorithm are used for aligning. The laser slit beam and CCD camera is applied for experimental measurement. Visual C++ on Window98 is implemented in processing the algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.12
• /
• pp.1234-1239
• /
• 2011

The scan matching is widely used in localization and mapping of mobile robots. This paper presents a probabilistic scan matching method. To improve the performance of the scan matching, a direction of data point is incorporated into the scan matching. The direction of data point is calculated using the line fitted by the neighborhood data. Owing to the incorporation, the performance of the matching was improved. The number of iterations in the scan matching decreased, and the tolerance against a high rotation between scans increased. Based on real data of a laser range finder, experiments verified the performance of the proposed direction augmented probabilistic scan matching algorithm.

• Journal of Advanced Navigation Technology
• /
• v.18 no.4
• /
• pp.371-375
• /
• 2014

In this paper, the solutions of TE(transverse electric) scattering problems by a resistive strip grating over a grounded dielectric layer are analyzed by applying the PMM(point matching method) known as a numerical method of electromagnetic fileld. The boundary conditions are applied to obtain the unknown field coefficients and the resistive boundary condition is used for the relationship between the tangential magnetic field and the induced surface current density on the resistive strip. The induced surface current density of resistive strip is obtained by difference of the up and down of the magnetic field in two boundary areas of the resistive strip. The numerical results for reflected power of zeroth order mode analyzed by according as the resistivity, the width and spacing of resistive strip, the relative permittivity and thickness of dielectric layer, and incident angles. The numerical results shown in good agreement compared to those of the existing papers using FGMM(fourier galerkin moment method).