Hybrid algorithm for fingerprint matching using Delaunay triangulation and local binary patterns

10Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

This paper proposes a hybrid algorithm for fingerprint matching using geometric structures with Delaunay triangle's based formed by the minutiae. For those minutiae triangles candidates for fingerprint matching, the texture information is extracted from the original raw image localized inside the triangle using Local Binary Patterns techniques (LBP). The preliminary results have shown that the merging technique is fairly robust for genuine fingerprint matching discrimination, reducing thus the error rate for FRR and FAR and the time comparison between fingerprint in the verification and/or identification process. The experimental results have shown that the proposed algorithm is effective and reliable. Tests were conducted from the database BD1 and BD2 of FVC2002 competition, obtaining an EER of 6.18% and 3.17% respectively. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Chau, A. C., & Soto, C. P. (2011). Hybrid algorithm for fingerprint matching using Delaunay triangulation and local binary patterns. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7042 LNCS, pp. 692–700). https://doi.org/10.1007/978-3-642-25085-9_82

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