Abstract:
The fingerprint matching algorithm is a key issue of fingerprint recognition, and there already exist many fingerprint matching algorithms. According to the dependence of...Show MoreMetadata
Abstract:
The fingerprint matching algorithm is a key issue of fingerprint recognition, and there already exist many fingerprint matching algorithms. According to the dependence of the core point, fingerprint matching algorithms are divided into two groups: core-based match algorithms and noncore-based match algorithms. Most of the noncore-based matching algorithms are time consuming, therefore, they are not suitable for online application; while the core-based matching algorithm is more efficient than the noncore-based matching algorithm, but it highly depends on the core detection precision. In this paper, we present a new core-based structure matching algorithm which considers both efficient and precision. First, we use a core detection algorithm to obtain the core position, then define some local structures of the core area. Using these local structures, we can find some of the correspondent points of the two fingerprint image. Next, we use the correspondent points in the first stage to match the global feature of the fingerprint. Experimental results show that the performance of the proposed algorithm is good.
Published in: 2002 International Conference on Pattern Recognition
Date of Conference: 11-15 August 2002
Date Added to IEEE Xplore: 10 December 2002
Print ISBN:0-7695-1695-X
Print ISSN: 1051-4651