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

Unifying the Visible and Passive Infrared Bands: Homogeneous and Heterogeneous Multi-Spectral Face Recognition

Face biometrics leverages tools and technology in order to automate the identification of individuals. In most cases, biometric face recognition (FR) can be used for forensic purposes, but there remains the issue related to the integration of technology into the legal system of the court. The biggest challenge with the acceptance of the face as a modality used in court is the reliability of such systems under varying pose, illumination and expression, which has been an active and widely explored area of research over the last few decades (e.g. same-spectrum or homogeneous matching). The heterogeneous FR problem, which deals with matching face images from different sensors, should be examined for the benefit of military and law enforcement applications as well. In this work we are concerned primarily with visible band images (380-750 nm) and the infrared (IR) spectrum, which has become an area of growing interest.;For homogeneous FR systems, we formulate and develop an efficient, semi-automated, direct matching-based FR framework, that is designed to operate efficiently when face data is captured using either visible or passive IR sensors. Thus, it can be applied in both daytime and nighttime environments. First, input face images are geometrically normalized using our pre-processing pipeline prior to feature-extraction. Then, face-based features including wrinkles, veins, as well as edges of facial characteristics, are detected and extracted for each operational band (visible, MWIR, and LWIR). Finally, global and local face-based matching is applied, before fusion is performed at the score level. Although this proposed matcher performs well when same-spectrum FR is performed, regardless of spectrum, a challenge exists when cross-spectral FR matching is performed. The second framework is for the heterogeneous FR problem, and deals with the issue of bridging the gap across the visible and passive infrared (MWIR and LWIR) spectrums. Specifically, we investigate the benefits and limitations of using synthesized visible face images from thermal and vice versa, in cross-spectral face recognition systems when utilizing canonical correlation analysis (CCA) and locally linear embedding (LLE), a manifold learning technique for dimensionality reduction. Finally, by conducting an extensive experimental study we establish that the combination of the proposed synthesis and demographic filtering scheme increases system performance in terms of rank-1 identification rate

An Asymmetric Fingerprint Matching Algorithm for Java Card

A novel fingerprint matching algorithm is proposed in this paper. The algorithm is based on the minutiae local structures, that are invariant with respect to global transformations like translation and rotation. Match algorithm has been implemented inside a smartcard over the Java Card? platform, meeting the individual\u27s need for information privacy and the overall authentication procedure security, since the card owner biometric template never leaves the private support device and the match is computed inside a secure environment. The main characteristic of the algorithm is to have an asymmetric behaviour between correct positive matches (between two same fingerprint samples) and correct negative matches (between two different fingerprint images): in the first case, the match procedure stops as it finds that images belong to the same fingerprint, gaining high speed efficiency, while in the second case the verification process lasts longer, exploring all the minutiae pairings. The performances in terms of authentication reliability and speed have been tested on the databases from the Fingerprint Verification Competition 2002 edition (FVC2002) by taking in account the different hardware to run the algorithms. Moreover, our procedure has showed better reliability results when compared on a common database with a related algorithm developed specifically for Java Card?