• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.1-8
• /
• 2000

Point pattern matching schemes for finger print recognition do not guarantee robust matching performance for fingerprint Images of poor quality We present a finger print recognition scheme, where transformation parameters of matched ridge pairs are estimated by Hough transform and the matching hypothesis is verified by a new measure of the matching degree using selective directional information Proposed method may exhibit extremely low FAR(False accept rate) while maintaining low reject rate even for the Images of poor quality because of the robustness to the variation of minutia points.

• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2209-2211
• /
• 1998

This paper presents the matching algorithm with the satellite images using the image warping method. Two stereo images, which are used for the DEM(Digital Elevation Model) extraction, are generally distorted because the images are acquired at different locations and angles. Therefore, the matching Process can't be executed with the original images. To solve this problem, a dynamic triangular image warping method is proposed. At first, the initial matching is executed with seed point, and then, using the matched points from the initial matching, the distorted images is compensated. We experimented this algorithm with the parts of the $6000{\times}6000$ SPOT satellite images. The experiment results show this algorithm is superior to other warping algorithm.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.6_1
• /
• pp.583-590
• /
• 2012

This study proposes fusion image matching method according to land cover property to generate a detailed DEM using the high resolution IKONOS-2 stereo pair. A classified image, consists of building, crop-land, forest, road and shadow-water, is produced by color image with four bands. Edges and points are also extracted from panchromatic image. Matching is performed by the cross-correlation computing after five classes are automatically selected in a reference image. In each of building class, crop-land class, forest class and road class, matching was performed by the grid and edge, only grid, only grid, grid and point, respectively. Shadow-water class was excepted in the matching because this area causes excessive error of the DEM. As the results, edge line, building and residential area could be expressed more dense than DEM by the conventional method.

• Journal of Korean Society for Geospatial Information Science
• /
• v.3 no.2 s.6
• /
• pp.213-220
• /
• 1995

Map Matching is the method for correcting the current position from dead reckoning in Car Navigation System. In this paper, we proposed the new map matching algorithm that can correct the positioning error caused by sensors and digital map data around the cross road area. To do this, first we set the error boundary of the cross road area by combining the relative error of moving distance and the absolute error of road length, second, we find out the starting point of turning within the determined error boundary of the cross point area, third, we compare the turning angle of the car to the angle of each possible road, and the last, we decide the matched road. We used wheel sensor as a speed sensor and used optical fiber gyro as a directional sensor, and assembled the sensors to the notebook computer. We testified our algorithm by driving the Daejeon area-which is a part of south Korea-as a test area. And we proved the efficiency by doing that.

• The KIPS Transactions:PartB
• /
• v.9B no.5
• /
• pp.653-662
• /
• 2002

Fingerprint recognition is a task to find a matching pattern in a database for a specific persons fingerprint. To accomplish this task, preprocessing, classification, and matching steps are taken for a large-scale fingerprint database but only the matching step is taken without classification for a small-scale database. The primary matching method is based on minutiae (ridge ending point, bifurcation). This matching method, however, requires a very complex computation to extract minutiae and match minutiae-to-minutiae accurately due to translation, rotation, nonlinear deformation of fingerprint and occurrence of spurious minutiae. In addition, this method requires a laborious preprocessing step in order to improve the quality of fingerprint Images. This paper proposes a new simple method to eliminate these problems. With this method, Gabor variance is used instead of minutiae for fingerprint recognition. The Gabor variance is computed from Gabor features that result from filtering a fingerprint image through Gabor filter. In this paper, this method is described and its test result is shown, demonstrating the potential of using this new method for fingerprint recognition.

• Journal of KIISE
• /
• v.43 no.5
• /
• pp.562-568
• /
• 2016

Point cloud data can be expressed in a specific coordinate system of a data set with a large number of points, to represent any form that generally has different characteristics in the three-dimensional coordinate space. This paper is aimed at finding a cylindrical pipe in the point cloud of the three-dimensional coordinate system using RANSAC, which is faster than the conventional Hough Transform method. In this study, the proposed cylindrical pipe is estimated by combining the results of parameters based on two mathematical models. The two kinds of mathematical models include a sphere and line, searching the sphere center point and radius in the cylinder, and detecting the cylinder with straightening of center. This method can match cylindrical pipe with relative accuracy; furthermore, the process is rapid except for normal estimation and segmentation. Quick cylinders matching could benefit from laser scanning and reverse engineering construction sectors that require pipe real-time estimates.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.128-140
• /
• 2000

In this paper, we propose a fast block matching algorithm using the mean absolute error (MAE) of neighbor search point and search region reduction. The proposed algorithm is composed of two stages. At the first stage,the search region is divided into nonoverlapped 3$\times$3 areas and MAE of the center point of each area iscalculated. The minimum MAE value of all the calculated MAE's is determined as reference MAE. At thesecond stage, because the possibility that final motion vector exist near the position of reference MAE is veryhigh, we use smaller search region than first stage, And, using the MAE of center point of each area, the lowerbound of rest search point of each area is calculated and block matching process is performed only at the searchpoints that the lower bound is smaller than reference MAE. By doing so, we can significantly reduce thecomputational complexity while keep the increasement of motion estimation error small.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.3
• /
• pp.41-56
• /
• 2000

In this paper, we propose a two-stage fast block matching algorithm using the mean absolute error (MAE) of neighbor search point that can reduce the computational complexity to estimate motion vector while the motion estimation error performance is nearly the same as full search algorithm (FSA) In the proposed method, the lower bound of MAE 6at current search point IS calculated using the MAE of neighbor search point And we reduce the computational complexity by performing the block matching process only at the search point that has to be block matched using the lower bound of MAE The proposed algorithm is composed of two stages The experimental results show that the proposed method drastically reduces the computational complexity while the motion compensated error performance is nearly kept same as that of FSA.

• Journal of Korean Society for Geospatial Information Science
• /
• v.23 no.1
• /
• pp.123-128
• /
• 2015

In this study, experimented how to increase corresponding points which are obtained through stereo matching for dense 3D reconstruction. After extracting a snapshot image from the images acquired through stereo CCTVs, the matching points obtained using the SIFT matching and RANSAC procedure were gradually overlapped. In conclusion, it was confirmed that as images are overlapped, the number of matching points continues to grow.

• Korean Journal of Remote Sensing
• /
• v.26 no.1
• /
• pp.39-45
• /
• 2010

This study used the keypoint observed simultaneously on two images and on twodimensional intensity image data, which was obtained along with the two point clouds data that were approached for automatic focus among points on terrestrial LiDAR data, and selected matching point through SIFT algorithm. Also, for matching error diploid, RANSAC algorithm was applied to improve the accuracy of focus. As calculating the degree of three-dimensional rotating transformation, which is the transformation-type parameters between two points, and also the moving amounts of vertical/horizontal, the result was compared with the existing result by hand. As testing the building of College of Science at Konkuk University, the difference of the transformation parameters between the one through automatic matching and the one by hand showed 0.011m, 0.008m, and 0.052m in X, Y, Z directions, which concluded to be used as the data for automatic focus.