Fast and Accurate Fingerprint Verification

Speed and accuracy are the prerequisites of a biometric authentication system. However, most fingerprint verification methods compromise speed for accuracy or vice versa. In this paper we propose a novel fingerprint verification algorithm as a solution to this problem. The algorithm is inspired by a basic Computer Vision approach to model-based recognition of objects-alignment. We pose the problem of fingerprint matching as one of matching the corresponding feature sets. We propose a novel transformation consistency checking scheme to make verification accurate. We employ an early elimination strategy to eliminate inconsistent transformations and thereby achieve significant speed-up. Further speed-up is obtained by sampling based on geometric nearness. Our algorithm is simple, intuitive, easy to implement even on the simplest hardware and does not make any assumption on the availability of singularities like core and delta in the fingerprint. We report our results on three representative fingerprint databases.

[1]  Sandy Irani,et al.  Combinatorial and experimental results for randomized point matching algorithms , 1996, SCG '96.

[2]  Erdal Panayirci,et al.  Extension of the Cox-Lewis method for testing multi-dimensional data , 1988 .

[3]  King-Sun Fu,et al.  A syntactic approach to fingerprint pattern recognition , 1975, Pattern Recognit..

[4]  Anil K. Jain,et al.  On-line fingerprint verification , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[5]  Sharath Pankanti,et al.  FingerCode: a filterbank for fingerprint representation and matching , 1999, Proceedings. 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No PR00149).

[6]  Safwat G. Zaky,et al.  Fingerprint identification using graph matching , 1986, Pattern Recognit..

[7]  Anil K. Jain,et al.  A Real-Time Matching System for Large Fingerprint Databases , 1996, IEEE Trans. Pattern Anal. Mach. Intell..