This paper proposes a novel minutiae-based fingerprint matching algorithm. A fingerprint is represented by minutiae set and sampling points on all ridges. Therefore, the foreground of a fingerprint image can be accurately estimated by the sampling points. The similarity between two minutiae is measured by two parts: neighboring minutiae which are different in minutiae pattern and neighboring sampling points which are different in orientation and frequency. After alignment and minutiae pairing, Nine features are extracted to represent the matching status and penalized logistic regression (PLR) is adopted to calculate the matching score. The proposed algorithm is evaluated on fingerprint databases of FVC2002 and compared with the participants in FVC 2002. Experimental results show that the proposed algorithm achieves good performance and ranks 5th according to average equal error rate. © Springer-Verlag Berlin Heidelberg 2009.
CITATION STYLE
Cao, K., Yang, X., Tian, J., Zhang, Y., Li, P., & Tao, X. (2009). Fingerprint matching based on neighboring information and penalized logistic regression. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5558 LNCS, pp. 617–626). https://doi.org/10.1007/978-3-642-01793-3_63
Mendeley helps you to discover research relevant for your work.