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

Performance Evaluation of Feature Sets of Minutiae Quadruplets

The features proposed in this paper are derived from minutiae quadruplets and are applicable in matching and indexing ngerprint images. In this work nineteen different possibilities of features were explored for indexing and the performances of some of the feature sets were mixed: some giving good performances on certain databases and poor performances on other databases. A nal ranking was done and one feature-set was chosen as viable geometrical features for minutiae matching and indexing based on their performances on three Fingerprint Verication Databases (FVC) 2000, 2002 and 2004

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

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

Feature level fusion based bimodal biometric using transformation domine techniques

Bimodal biometric used to authenticate a person is more accurate compared to single biometric trait. In this paper we propose Feature Level Fusion based Bimodal Biometric using Transformation Domine Techniques (FLFBBT). The algorithm uses two physiological traits viz., Fingerprint and Face to identify a person. The Region of Interest (ROI) of fingerprint is obtained using preprocessing. The features of fingerprint are extracted using Dual Tree Complex Wavelet Transforms (DTCWT) by computing absolute values of high and low frequency components. The final features of fingerprint are computed by applying log on concatenated absolute value of high and low frequency components. The face image is preprocessed by cropping only face part and Discrete Wavelet Transforms (DWT) is applied. The approximation band coefficients are considered as features of face. The fingerprint and face image features are concatenated to derive final feature vector of bimodal biometric. The Euclidian Distance (ED) is used in matching section to compare test biometric in the database, it is observed that the values of EER and TSR are better in the case of proposed algorithm compared to individual transformation domain techniques

De-Duplication of Person's Identity Using Multi-Modal Biometrics

The objective of this work is to explore approaches to create unique identities by the de-duplication process using multi-modal biometrics. Various government sectors in the world provide different services and welfare schemes for the beneffit of the people in the society using an identity number. A unique identity (UID) number assigned for every person would obviate the need for a person to produce multiple documentary proofs of his/her identity for availing any government/private services. In the process of creating unique identity of a person, there is a possibility of duplicate identities as the same person might want to get multiple identities in order to get extra beneffits from the Government. These duplicate identities can be eliminated by the de-duplication process using multi-modal biometrics, namely, iris, ngerprint, face and signature. De-duplication is the process of removing instances of multiple enrollments of the same person using the person's biometric data. As the number of people enrolledinto the biometric system runs into billions, the time complexity increases in the de duplication process. In this thesis, three different case studies are presented to address the performance issues of de-duplication process in order to create unique identity of a person

Development and Properties of the ROC-ABC Bayes Factor for the Quantification of the Weight of Forensic Evidence

Many scholars have proposed the use of a Bayes factor to quantify the weight of forensic evidence. However, due to the complex and high-dimensional nature of pattern evidence, likelihood functions are intractable and thus, Bayes factors cannot be assigned using traditional methods. Approximate Bayesian Computation (ABC) model selection algorithms provide likelihood-free methods to assign Bayes factors. ABC Bayes factors leverage the use of the scoring functions commonly used in recent years in forensic statistics in a rigorous statistical manner. However, traditional methods for assigning ABC Bayes factors are subject of several criticisms. In this dissertation, one of the main criticisms of traditional ABC Bayes factors is alleviated by deriving a relationship between ABC Bayes factors and ROC curves. Additionally, the use of the ROC curve allows for an intuitive communication of the ABC Bayes factor. A simple example is outlined to illustrate the implementation of a ROC-ABC algorithm. Asymptotic properties of the ROC-ABC Bayes factor are explored. The ROC-ABC algorithm is implemented to quantify the weight of fingerprint evidence