A minutiae matching algorithm in fingerprint verification
- 11 November 2002
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4, 833-836 vol.4
- https://doi.org/10.1109/icpr.2000.903046
Abstract
Fingerprint matching is one of the most important problems in AFIS. In general, we use minutiae such as ridge endings and ridge bifurcation to represent a fingerprint and do fingerprint matching through minutiae matching. We propose a minutiae matching algorithm which modified Jain et al.'s algorithm (1997). Our algorithm can better distinguish two images from different fingers and is more robust to nonlinear deformation. Experiments done on a set of fingerprint images captured with an inkless scanner shows that our algorithm is fast and has high accuracy.Keywords
This publication has 5 references indexed in Scilit:
- On-line fingerprint verificationIeee Transactions On Pattern Analysis and Machine Intelligence, 1997
- Fast algorithm for point pattern matching: Invariant to translations, rotations and scale changesPattern Recognition, 1997
- Automated fingerprint recognition using structural matchingPattern Recognition, 1990
- Fingerprint identification using graph matchingPattern Recognition, 1986
- Point pattern matching by relaxationPattern Recognition, 1980