K-plet and Coupled BFS: A Graph Based Fingerprint Representation and Matching Algorithm
In this paper, we present a new fingerprint matching algorithm based on graph matching principles. We define a new representation called K-plet to encode the local neighborhood of each minutiae. We also present CBFS (Coupled BFS), a new dual graph traversal algorithm for consolidating all the local neighborhood matches and analyze its computational complexity. The proposed algorithm is robust to non-linear distortion. Ambiguities in minutiae pairings are solved by employing a dynamic programming based optimization approach. We present an experimental evaluation of the proposed approach and showed that it exceeds the performance of the NIST BOZORTH3  matching algorithm.
- 2.Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. McGraw-Hill Book Company, New York (1998)Google Scholar
- 3.Garris, M.D., Watson, C.I., McCabe, R.M., Wilson, C.L.: User’s guide to nist fingerprint image software (nfis).Technical Report NISTIR 6813, National Institute of Standards and Technology (2002)Google Scholar
- 5.Jea, T.Y., Govindaraju, V.: A minutia-based partial fingerprint recognition system. Submitted to Pattern Recognition (2004)Google Scholar
- 6.Jiang, X., Yau, W.Y.: Fingerprint minutiae matching based on the local and global structures. In: International Conference on Pattern Recognition, pp. 1038–1041 (2000)Google Scholar
- 8.Ranade, A., Rosenfeld, A.: Point pattern matching by relaxation. Pattern Recognition 12(2), 269–275 (1993)Google Scholar
- 10.Ratha, N.K., Pandit, V.D., Bolle, R.M., Vaish, V.: Robust fingerprint authentication using local structure similarity. In: Workshop on applications of Computer Vision, pp. 29–34 (2000)Google Scholar