An improved fingerprint indexing algorithm based on the triplet approach

16Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes a triplet based fingerprint indexing algorithm which selects the candidates for identification from a large number of enrolled fingerprints. Previous triplet based indexing algorithms have three problems: quantization error, triplet matching error, the proportional increase of similarity score to the number of enrolled triplets. The proposed algorithm solves these problems as follows. First, we generate weighted indices through fuzzy membership functions based on the statistics to reduce quantization error. Second, we apply Geometric Relationships to reduce triplet matching error. Finally, we normalize similarity score to solve the last problem. We compare the proposed algorithm with the previous triplet approach and the Fingercode. Experimental results show that the average rank of the enrolled fingerprint which is identical to an input fingerprint, becomes 2.01 times less than the previous triplet method, and becomes 0.4 times less than the Fingercode. © Springer-Verlag 2003.

Cite

CITATION STYLE

APA

Choi, K., Lee, D., Lee, S., & Kim, J. (2003). An improved fingerprint indexing algorithm based on the triplet approach. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2688, 584–591. https://doi.org/10.1007/3-540-44887-x_69

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free