• Proceedings of the Korean Society of Computer Information Conference
• /
• 2011.01a
• /
• pp.55-58
• /
• 2011

This paper proposes a method of occluded number recognition by matching interest points. Interest points of input pattern are found via SURF features extracting and matched to interest points of clusters in database following three steps: SURF matching, coordinate matching and SURF matching on coordinate matched points. Then the satisfied interest points are counted to compute matching rate of each cluster. The input pattern will be assigned to cluster having highest matching rate. We have experimented our method to different numerical fonts and got encouraging results.

• Proceedings of the KIEE Conference
• /
• 2000.11d
• /
• pp.747-749
• /
• 2000

In this paper, we proposed color stereo matching algorithm using dynamic programming. The conventional gray stereo matching algorithms show blur at depth discontinuities and non-existence of matching pixel in occlusion lesions. Also it accompanies matching error by lack of matching information in the untextured region. This paper defines new cost function makes up for the problems happening in conventional gray stereo matching algorithm. New cost function contain the following properties. I) Edge points are corresponded to edge points. ii) Non-edge points are corresponded to non-edge points. iii) In case of exiting the amount of edges, the cost function has some weight in proportion to path distance. Proposed algorithm was applied in various images obtained by parallel camera model. As the result, proposed algorithm showed improved performance in the aspect of matching error and processing in the occlusion region compared to conventional gray stereo matching algorithms.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2004.04a
• /
• pp.171-176
• /
• 2004

Image matching is fundamental process in photogrammetry and computer vision to identify and to measure corresponding features on the multiple images. Uniqueness of the matching entities and robustness of the algorithm are the key issues that have influence on quality of the matching result. The optimal solution could be obtained by utilizing appropriate matching entities in the first place. In this study, candidate matching points were extracted by interest operator, and an area-based matching method was applied with characteristics of the gray value distribution as the matching entities. The characteristic information is based on the concept of "intrinsic image" (or parameter image). The information was utilized as additional and/or complementary matching entities. Matching on interest points with the characteristic information resulted in high quality of matching because matching windows were created with surrounding pixels of the interest points that contain distinct and unique features. The experiment shows that matching quality and reliability increase by exploiting interest operator, and the characteristic information has potential to be matching entity.

• Journal of Information Processing Systems
• /
• v.15 no.1
• /
• pp.22-33
• /
• 2019

This paper introduces an efficient fingerprint matching method based on multiple reference minutiae points. First, we attempt to effectively align two fingerprints by employing multiple reference minutiae points. However, the corresponding minutiae points between two fingerprints are ambiguous since a minutia of one fingerprint can be a match to any minutia of the other fingerprint. Therefore, we introduce a novel method based on linear classification concept to establish minutiae correspondences between two fingerprints. Each minutiae correspondence represents a possible alignment. For each possible alignment, a matching score is computed using minutiae and ridge orientation features and the maximum score is then selected to represent the similarity of the two fingerprints. The proposed method is evaluated using fingerprint databases, FVC2002 and FVC2004. In addition, we compare our approach with two existing methods and find that our approach outperforms them in term of matching accuracy, especially in the case of non-linear distorted fingerprints. Furthermore, the experiments show that our method provides additional advantages in low quality fingerprint images such as inaccurate position, missing minutiae, and spurious extracted minutiae.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.38 no.2
• /
• pp.165-172
• /
• 2020

There is growing interest in Vision-based video image matching owing to the constantly developing technology of unmanned-based systems. The purpose of this paper is the development of a fast and effective matching technique for the UAV oblique video image. We first extracted initial matching points using NCC (Normalized Cross-Correlation) algorithm and improved the computational efficiency of NCC algorithm using integral image. Furthermore, we developed a triangulation-based outlier removal algorithm to extract more robust matching points among the initial matching points. In order to evaluate the performance of the propose method, our method was quantitatively compared with existing image matching approaches. Experimental results demonstrated that the proposed method can process 2.57 frames per second for video image matching and is up to 4 times faster than existing methods. The proposed method therefore has a good potential for the various video-based applications that requires image matching as a pre-processing.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.28 no.4
• /
• pp.463-469
• /
• 2010

Since MOLA(Mars Orbiter Laser Altimeter) data, which provides altimetry data for Mars, does not cover the whole Mars area, image matching with MOC imagery should be implemented for the generation of DEM. However, automatic image matching is difficult because of insufficient features and low contrast. In this paper, we present the area based semi-automatic image matching algorithm with MOC-NA(Mars Orbiter Camera ? Narrow Angle) imagery. To accomplish this, seed points describing conjugate points are manually added for the stereo imagery, and interesting points are automatically produced by using such seed points. Produced interesting points being used as initial conjugate points, area based image matching is implemented. For the points which fail to match, the locations of initial conjugate points are recalculated by using matched six points and image matching process is re-implemented. The quality assessment by reversing the role of target and search image shows 97.5 % of points were laid within one pixel absolute difference.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.8
• /
• pp.44-53
• /
• 1992

In this paper, a matching method is proposed to improve the correct matching rate in stereo correspondence matching in which the fingerprint of zero-crossing points on the scale-space is used as the robust matching feature. The dynamic programming, which is appropriate for the fingerprint feature, is introduced for correspondence matching. We also improve the matching rate by using the post-processing for correcting mismatched points. In simulation, we apply the proposed algorithm to the synthetic and real images and obtain good matching results.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.1467-1469
• /
• 2003

Image matching is fundamental process to identify conjugate points on the stereo images. However, standard methods or general solutions for matching problem have not been found yet, in spite of long history. Quality of the matching basically depends on uniqueness of the matching entity and robustness of the algorithm. In this study, conjugate points were extracted by implementing interest operator, then area based matching method was applied to the topographical characteristics of the gray value as the matching entities. The matching entities were utilized based on the concept of the intrinsic image.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.14 no.1
• /
• pp.9-16
• /
• 1996

A new stereo matching method for the relative orientation and the photogrammetric triangulation has been pro-posed. It matches the pairs of conjugate points to be used as pass points and tie points in digital aerial photographs instead of selecting these points with manual point transfer and measurements. Three unique steps included in the proposed matching method are as followings. The first step is searching interest points, and designating them as candidate points to be matched. The second is matching the points from the pair of images by the Cross Correlation Method in both direction(left to right direction and right to left). The third is selecting consistent pairs in the both matching directions. Computer programs based on the proposed matching method have been developed, and with digital aerial photographs which have full ground coordinate information tests were performed to know reliabiliy and positional accuracy of proposed method. Results of the tests reveal that the proposed matching method can eliminate the in-correctly matched pairs more efficiently than other matching methods, thus this can be more reliably applied to the relative orientation and the photogrammetric triangulation.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.3
• /
• pp.248-253
• /
• 2011

This paper proposes the robust matching algorithm for optical images obtained by WSI(White-light Scanning Interferometer) machine. The matching algorithms are divided by two part according to the matching points: algorithm whether the matching points between two images exist or not. Also, after matching the images, we propose the algorithm to smooth the matched image. Finally, we show the effectiveness and feasibility of the proposed method through some experiments.