Any well known fingerprint matching algorithm cannot provide 100% accuracy for all databases. One should explore the possibility of fusion of multi-algorithms to achieve better performance on such databases. One of the major challenges is to design a fusion strategy which is both adaptive and improving with respect to the candidate database. This paper proposes an adaptive ensemble using statistical properties of two well known state-of-the-art minutiae based fingerprint matching algorithms to achieve (1) improvement on fingerprint recognition benchmark, (2) outperform on multiple databases. Experiments have been conducted on two databases containing multiple fingerprint impressions of 140 and 500 users. One of them is widely used publicly available databases and another one is our in-house database. Experimental results have shown the significant gain in performance.
CITATION STYLE
Tiwari, K., Kaushik, V. D., & Gupta, P. (2016). An adaptive multi-algorithm ensemble for fingerprint matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9771, pp. 49–60). Springer Verlag. https://doi.org/10.1007/978-3-319-42291-6_6
Mendeley helps you to discover research relevant for your work.