A complete fingerprint matching algorithm on GPU for a large scale identification system

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

Abstract

Fingerprints are most used biometrics features for identification. Although state-of-the-art algorithms are very accurate, but the need for processing speed for databases with millions fingerprints are very demanding. GPU devices are used widely in parallel computing tasks for their efficiency and low-cost. Most approaches make use of GPU for the filtering process in a multi-stage matching system. In this paper, we present a complete fingerprint matching algorithm on GPU. Our approach uses minutia cylinder-code (MCC) representation with a global consolidation stage and a careful design to make it suitable for the architecture of GPU. The result tested with GTX- 680 device shows that the proposed algorithm can perform 1.8 millions matches per second, making it applicable for real time identification systems with databases of millions fingerprints.

Cite

CITATION STYLE

APA

Le, H. H., Nguyen, N. H., & Nguyen, T. T. (2016). A complete fingerprint matching algorithm on GPU for a large scale identification system. In Lecture Notes in Electrical Engineering (Vol. 376, pp. 679–688). Springer Verlag. https://doi.org/10.1007/978-981-10-0557-2_67

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