Comparison of the Minutiae Quadruplets and Minutiae Triplets Techniques

Identifying distorted ngerprint images is a major problem in ngerprint recog-nition systems. Several techniques, such as the minutiae triplets technique, have been proposed for minutiae matching and indexing. The minutiae triplets technique however is largely aected by minutiae distortions and occlusions and hence can rarely produce a stable feature set. In this paper, the characteristics of the minutiae quadruplets and the minutiae triplets structures are compared. The minutiae quadruplet technique is proposed as a better technique because the features are robust to minutiae distortions and occlusions and it eliminates the known drawbacks of the minutiae triplet technique

Heap-based Algorithms to Accelerate Fingerprint Matching on Parallel Platforms

Nowadays, fingerprint is the most used biometric trait for individuals identification. In this area, the state-of-the-art algorithms are very accurate, but when the database contains millions of identities, an acceleration of the algorithm is required. From these algorithms, Minutia Cylinder-Code (MCC) stands out for its good results in terms of accuracy, however its efficiency in computational time is not high. In this work, we propose to use two different parallel platforms to accelerate fingerprint matching process by using MCC: (1) a multi-core server, and (2) a Xeon Phi coprocessor. Our proposal is based on heaps as auxiliary structure to process the global similarity of MCC. As heap-based algorithms are exhaustive (all the elements are accessed), we also explored the use an indexing algorithm to avoid comparing the query against all the fingerprints of the database. Experimental results show an improvement up to 97.15x of speed-up, which is competitive compared to other state-of-the-art algorithms in GPU and FPGA. To the best of our knowledge, this is the first work for fingerprint identification using a Xeon Phi coprocessor.Instituto de Investigación en Informátic

Heap-based Algorithms to Accelerate Fingerprint Matching on Parallel Platforms

Nowadays, fingerprint is the most used biometric trait for individuals identification. In this area, the state-of-the-art algorithms are very accurate, but when the database contains millions of identities, an acceleration of the algorithm is required. From these algorithms, Minutia Cylinder-Code (MCC) stands out for its good results in terms of accuracy, however its efficiency in computational time is not high. In this work, we propose to use two different parallel platforms to accelerate fingerprint matching process by using MCC: (1) a multi-core server, and (2) a Xeon Phi coprocessor. Our proposal is based on heaps as auxiliary structure to process the global similarity of MCC. As heap-based algorithms are exhaustive (all the elements are accessed), we also explored the use an indexing algorithm to avoid comparing the query against all the fingerprints of the database. Experimental results show an improvement up to 97.15x of speed-up, which is competitive compared to other state-of-the-art algorithms in GPU and FPGA. To the best of our knowledge, this is the first work for fingerprint identification using a Xeon Phi coprocessor.Instituto de Investigación en Informátic

A Review of Fingerprint Feature Representations and Their Applications for Latent Fingerprint Identification: Trends and Evaluation

Latent fingerprint identification is attracting increasing interest because of its important role in law enforcement. Although the use of various fingerprint features might be required for successful latent fingerprint identification, methods based on minutiae are often readily applicable and commonly outperform other methods. However, as many fingerprint feature representations exist, we sought to determine if the selection of feature representation has an impact on the performance of automated fingerprint identification systems. In this paper, we review the most prominent fingerprint feature representations reported in the literature, identify trends in fingerprint feature representation, and observe that representations designed for verification are commonly used in latent fingerprint identification. We aim to evaluate the performance of the most popular fingerprint feature representations over a common latent fingerprint database. Therefore, we introduce and apply a protocol that evaluates minutia descriptors for latent fingerprint identification in terms of the identification rate plotted in the cumulative match characteristic (CMC) curve. From our experiments, we found that all the evaluated minutia descriptors obtained identification rates lower than 10% for Rank-1 and 24% for Rank-100 comparing the minutiae in the database NIST SD27, illustrating the need of new minutia descriptors for latent fingerprint identification.This work was supported in part by the National Council of Science and Technology of Mexico (CONACYT) under Grant PN-720 and Grant 63894

Biometrics based privacy-preserving authentication and mobile template protection

Smart mobile devices are playing a more and more important role in our daily life. Cancelable biometrics is a promising mechanism to provide authentication to mobile devices and protect biometric templates by applying a noninvertible transformation to raw biometric data. However, the negative effect of nonlinear distortion will usually degrade the matching performance significantly, which is a nontrivial factor when designing a cancelable template. Moreover, the attacks via record multiplicity (ARM) present a threat to the existing cancelable biometrics, which is still a challenging open issue. To address these problems, in this paper, we propose a new cancelable fingerprint template which can not only mitigate the negative effect of nonlinear distortion by combining multiple feature sets, but also defeat the ARM attack through a proposed feature decorrelation algorithm. Our work is a new contribution to the design of cancelable biometrics with a concrete method against the ARM attack. Experimental results on public databases and security analysis show the validity of the proposed cancelable template

Heap-based Algorithms to Accelerate Fingerprint Matching on Parallel Platforms

Nowadays, fingerprint is the most used biometric trait for individuals identification. In this area, the state-of-the-art algorithms are very accurate, but when the database contains millions of identities, an acceleration of the algorithm is required. From these algorithms, Minutia Cylinder-Code (MCC) stands out for its good results in terms of accuracy, however its efficiency in computational time is not high. In this work, we propose to use two different parallel platforms to accelerate fingerprint matching process by using MCC: (1) a multi-core server, and (2) a Xeon Phi coprocessor. Our proposal is based on heaps as auxiliary structure to process the global similarity of MCC. As heap-based algorithms are exhaustive (all the elements are accessed), we also explored the use an indexing algorithm to avoid comparing the query against all the fingerprints of the database. Experimental results show an improvement up to 97.15x of speed-up, which is competitive compared to other state-of-the-art algorithms in GPU and FPGA. To the best of our knowledge, this is the first work for fingerprint identification using a Xeon Phi coprocessor.Instituto de Investigación en Informátic

Reconstruction of fingerprints from minutiae points

Most fingerprint authentication systems utilize minutiae information to compare fingerprint images. During enrollment, the minutiae template of a user\u27s fingerprint is extracted and stored in the database. In this work, we concern ourselves with the amount of fingerprint information that can be elicited from the minutiae template of a user\u27s fingerprint. We demonstrate that minutiae information can reveal substantial details such as the orientation field and class of the (unseen) parent fingerprint that can potentially be used to reconstruct the original fingerprint image.;Given a minutiae template, the proposed method first estimates the orientation map of the parent fingerprint by constructing minutiae triplets. The estimated orientation map is observed to be remarkably consistent with the underlying ridge flow of the unseen parent fingerprint. We also discuss a fingerprint classification technique that utilizes only the minutiae information to determine the class of the fingerprint (Arch, Left loop, Right loop and Whorl). The proposed classifier utilizes various properties of the minutiae distribution such as angular histograms, density, relationship between minutiae pairs, etc. A classification accuracy of 82% is obtained on a subset of the NIST-4 database. This indicates that the seemingly random minutiae distribution of a fingerprint can reveal important class information. (Abstract shortened by UMI.)

Identifying individuals from average quality fingerprint reference templates, when the best do not provide the best results !

International audienceThe fingerprint is one of the most used biometric modalities because of its persistence, uniqueness characteristics and ease of acquisition. Nowadays, there are large country-sized fingerprint databases for identification purposes, for border access controls and also for Visa issuance procedures around the world. The objective usually is to identify an input fingerprint among a large fingerprint database. In order to achieve this goal, different fingerprint pre-selection, classification or indexing techniques have been developed to speed up the research process to avoid comparison of the input fingerprint template against each fingerprint in the database. Although these methods are fairly accurate for identification process, we think that all of them assume the hypothesis to have a good quality of the fingerprint template for the first step of enrollment. In this paper, we show how the quality of reference templates can impact the performance of identification algorithms. We collect information and implement differents methods from the state of the art of fingerprint identification. Then, for these differents methods, we vary the quality of reference templates by using NFIQ2 metric quality. This allowed us to build a benchmark in order to evaluate the impact of these different enrollment scenarios on identification