An Efficient Algorithm for Fingerprint Matching Based on Convex Hulls

The purpose of fingerprint matching is to compare two fingerprint images and return a similarity score that represents to the probability of match between the two fingerprints. The performance of an automatic fingerprint identification system is greatly determined by its fingerprint matching algorithm. In this paper, a full fingerprint matching algorithm is presented. The main contribution of this paper is that a novel algorithm based on convex hulls for eliminating spurious matching in fingerprint matching is proposed. It is very important for improving the performance of fingerprint matching algorithm to reducing spurious matching. The algorithm is tested on a public database FVC2002 DB1_A. Experimental results show that the proposed algorithm is performed well compared with other ones.

[1]  Anil K. Jain,et al.  Handbook of Fingerprint Recognition , 2005, Springer Professional Computing.

[2]  Sang Uk Lee,et al.  Fingerprint Matching Method Using Minutiae Clustering and Warping , 2006, 18th International Conference on Pattern Recognition (ICPR'06).

[3]  Venu Govindaraju,et al.  A minutia-based partial fingerprint recognition system , 2005, Pattern Recognit..

[4]  Weiguo Sheng,et al.  A Memetic Fingerprint Matching Algorithm , 2007, IEEE Transactions on Information Forensics and Security.

[5]  Venu Govindaraju,et al.  K-plet and Coupled BFS: A Graph Based Fingerprint Representation and Matching Algorithm , 2006, ICB.

[6]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[7]  Li Tian,et al.  Fingerprint Matching Using Dual Hilbert Scans , 2007, 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System.