A Real-Time Matching System for Large Fingerprint Databases
IEEE Transactions on Pattern Analysis and Machine Intelligence
On-Line Fingerprint Verification
IEEE Transactions on Pattern Analysis and Machine Intelligence
Introduction to Algorithms
Handbook of Fingerprint Recognition
Handbook of Fingerprint Recognition
A minutia-based partial fingerprint recognition system
Pattern Recognition
A fingerprint recognizer using interminutiae binary constraint graph
EURASIP Journal on Advances in Signal Processing
Computational Methods for Determining Individuality
IWCF '08 Proceedings of the 2nd international workshop on Computational Forensics
Robust Fingerprint Matching Using Spiral Partitioning Scheme
ICB '09 Proceedings of the Third International Conference on Advances in Biometrics
Fingerprint hardening with randomly selected chaff minutiae
CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
A multiple substructure matching algorithm for fingerprint verification
CIARP'07 Proceedings of the Congress on pattern recognition 12th Iberoamerican conference on Progress in pattern recognition, image analysis and applications
A new fingerprint matching approach using level 2 and level 3 features
Proceedings of The Fourth International C* Conference on Computer Science and Software Engineering
Fingerprint recognition based on minutes groups using directing attention algorithms
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
An efficient DoG based fingerprint enhancement scheme
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
A robust fingerprint matching approach: growing and fusing of local structures
ICB'07 Proceedings of the 2007 international conference on Advances in Biometrics
| Hi-index | 0.00 |
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 [3] matching algorithm.