TY - GEN
T1 - K-plet and coupled BFS
T2 - International Conference on Biometrics, ICB 2006
AU - Chikkerur, Sharat
AU - Cartwright, Alexander N.
AU - Govindaraju, Venu
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/33744956992
M3 - Conference contribution
SN - 3540311114
SN - 9783540311119
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 309
EP - 315
BT - Advances in Biometrics - International Conference, ICB 2006, Proceedings
Y2 - 5 January 2006 through 7 January 2006
ER -