Indexing techniques for fingerprint and iris databases

This thesis addresses the problem of biometric indexing in the context of fingerprint and iris databases. In large scale authentication system, the goal is to determine the identity of a subject from a large set of identities. Indexing is a technique to reduce the number of candidate identities to be considered by the identification algorithm. The fingerprint indexing technique (for closed set identification) proposed in this thesis is based on a combination of minutiae and ridge features. Experiments conducted on the FVC2002 and FVC2004 databases indicate that the inclusion of ridge features aids in enhancing indexing performance. The thesis also proposes three techniques for iris indexing (for closed set identification). The first technique is based on iriscodes. The second technique utilizes local binary patterns in the iris texture. The third technique analyzes the iris texture based on a pixel-level difference histogram. The ability to perform indexing at the texture level avoids the computational complexity involved in encoding and is, therefore, more attractive for iris indexing. Experiments on the CASIA 3.0 database suggest the potential of these schemes to index large-scale iris databases

Comparative Study of Fingerprint Database Indexing Methods

International audienceNowadays, there are large country-sized fingerprint databases for identification purposes, for border access controls and also for Visa issuance procedures around the world. Fingerprint indexing techniques aim to speed up the research process in automatic fingerprint identification systems. Therefore, several preselection, classification and indexing techniques have been proposed in the literature. However, the proposed systems have been evaluated with different experimental protocols, that makes it difficult to assess their performances. The main objective of this paper is to provide a comparative study of fingerprint indexing methods using a common experimental protocol. Four fingerprint indexing methods, using naive, cascade, matcher and Minutiae Cylinder Code (MCC) approaches are evaluated on FVC databases from the Fingerprint Verification Competition (FVC) using the Cumulative Matches Curve (CMC) and for the first time using also the computing time required. Our study shows that MCC gives the best compromise between identification accuracy and computation time

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

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

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.)

A new algorithm for minutiae extraction and matching in fingerprint

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.A novel algorithm for fingerprint template formation and matching in automatic fingerprint recognition has been developed. At present, fingerprint is being considered as the dominant biometric trait among all other biometrics due to its wide range of applications in security and access control. Most of the commercially established systems use singularity point (SP) or ‘core’ point for fingerprint indexing and template formation. The efficiency of these systems heavily relies on the detection of the core and the quality of the image itself. The number of multiple SPs or absence of ‘core’ on the image can cause some anomalies in the formation of the template and may result in high False Acceptance Rate (FAR) or False Rejection Rate (FRR). Also the loss of actual minutiae or appearance of new or spurious minutiae in the scanned image can contribute to the error in the matching process. A more sophisticated algorithm is therefore necessary in the formation and matching of templates in order to achieve low FAR and FRR and to make the identification more accurate. The novel algorithm presented here does not rely on any ‘core’ or SP thus makes the structure invariant with respect to global rotation and translation. Moreover, it does not need orientation of the minutiae points on which most of the established algorithm are based. The matching methodology is based on the local features of each minutiae point such as distances to its nearest neighbours and their internal angle. Using a publicly available fingerprint database, the algorithm has been evaluated and compared with other benchmark algorithms. It has been found that the algorithm has performed better compared to others and has been able to achieve an error equal rate of 3.5%

Ridge orientation modeling and feature analysis for fingerprint identification

This thesis systematically derives an innovative approach, called FOMFE, for fingerprint ridge orientation modeling based on 2D Fourier expansions, and explores possible applications of FOMFE to various aspects of a fingerprint identification system. Compared with existing proposals, FOMFE does not require prior knowledge of the landmark singular points (SP) at any stage of the modeling process. This salient feature makes it immune from false SP detections and robust in terms of modeling ridge topology patterns from different typological classes. The thesis provides the motivation of this work, thoroughly reviews the relevant literature, and carefully lays out the theoretical basis of the proposed modeling approach. This is followed by a detailed exposition of how FOMFE can benefit fingerprint feature analysis including ridge orientation estimation, singularity analysis, global feature characterization for a wide variety of fingerprint categories, and partial fingerprint identification. The proposed methods are based on the insightful use of theory from areas such as Fourier analysis of nonlinear dynamic systems, analytical operators from differential calculus in vector fields, and fluid dynamics. The thesis has conducted extensive experimental evaluation of the proposed methods on benchmark data sets, and drawn conclusions about strengths and limitations of these new techniques in comparison with state-of-the-art approaches. FOMFE and the resulting model-based methods can significantly improve the computational efficiency and reliability of fingerprint identification systems, which is important for indexing and matching fingerprints at a large scale