Fingerprint Verification Using Spectral Minutiae Representations

Most fingerprint recognition systems are based on the use of a minutiae set, which is an unordered collection of minutiae locations and orientations suffering from various deformations such as translation, rotation, and scaling. The spectral minutiae representation introduced in this paper is a novel method to represent a minutiae set as a fixed-length feature vector, which is invariant to translation, and in which rotation and scaling become translations, so that they can be easily compensated for. These characteristics enable the combination of fingerprint recognition systems with template protection schemes that require a fixed-length feature vector. This paper introduces the concept of algorithms for two representation methods: the location-based spectral minutiae representation and the orientation-based spectral minutiae representation. Both algorithms are evaluated using two correlation-based spectral minutiae matching algorithms. We present the performance of our algorithms on three fingerprint databases. We also show how the performance can be improved by using a fusion scheme and singular points

On the use of spectral minutiae in high-resolution palmprint recognition

The spectral minutiae representation has been proposed as a novel method to minutiae-based fingerprint recognition, which can handle minutiae translation and rotation and improve matching speed. As high-resolution palmprint recognition is also mainly based on minutiae sets, we apply spectral minutiae representation to palmprints and implement spectral minutiae based matching. We optimize key parameters for the method by experimental study on the characteristics of spectral minutiae using both fingerprints and palmprints. However, experimental results show that spectral minutiae representation has much worse performance for palmprints than that for fingerprints. EER 15.89% and 14.2% are achieved on the public high-resolution palmprint database THUPALMLAB using location-based spectral minutiae representation (SML) and the complex spectral minutiae representation (SMC) respectively while 5.1% and 3.05% on FVC2002 DB2A fingerprint database. Based on statistical analysis, we find the worse performance for palmprints mainly due to larger non-linear distortion and much larger number of minutiae

Spectral representation of fingerprints

Most fingerprint recognition systems are based on the use of a minutiae set, which is an unordered collection of minutiae locations and directions suffering from various deformations such as translation, rotation and scaling. The spectral minutiae representation introduced in this paper is a novel method to represent a minutiae set as a fixed-length feature vector, which is invariant to translation, and in which rotation and scaling become translations, so that they can be easily compensated for. These characteristics enable the combination of fingerprint recognition systems with a template protection scheme, which requires a fixed-length feature vector. This paper introduces the idea and algorithm of spectral minutiae representation. A correlation based spectral minutiae\ud matching algorithm is presented and evaluated. The scheme shows a promising result, with an equal error rate of 0.2% on manually extracted minutiae

Spectral minutiae representations for fingerprint recognition

The term biometrics refers to the technologies that measure and analyze human intrinsic physical or behavioral characteristics for authenticating individuals. Nowadays, biometric technology is increasingly deployed in civil and commercial applications. The growing use of biometrics is raising security and privacy concerns. Storing biometric data, known as biometric templates, in a database leads to several privacy risks such as identity fraud and cross matching. A solution is to apply biometric template protection techniques, which aim to make it impossible to recover the biometric data from the templates.\ud The goal of our research is to combine biometric systems with template protection. Aimed at fingerprint recognition, this thesis introduces the Spectral Minutiae Representation method, which enables the combination of a minutiae-based fingerprint recognition system with template protection schemes based on fuzzy commitment or helper data schemes.\ud In this thesis, three spectral minutiae representation methods have been proposed: the location-based spectral minutiae representation (SML), the orientation-based spectral minutiae representation (SMO) and the complex spectral minutiae representation (SMC). From the experiments shown in this thesis, SMC achieved the best results.\ud Based on the spectral minutiae features, this thesis further presented contributions in three research directions. First, this thesis recommends several ways to enhance the recognition performance of SMC. Second, with regard to feature reduction, this thesis introduced two feature reduction methods, Column-PCA (CPCA) and Line-DFT (LDFT). Third, with regard to quantization, this thesis introduced the Spectral Bits and Phase Bits representations. \ud The spectral minutiae representation scheme proposed in this thesis enables the combination of fingerprint recognition systems with template protection based on the helper data scheme. Furthermore, this scheme allows for a fast minutiae comparison, which renders this scheme suitable as a pre-selector for a large-scale fingerprint identification system, thus significantly reducing the time to perform matching. The binary spectral minutiae representation achieved an equal error rate of less than 1% on the FVC2000-DB2 database when applying multi-sample enrolment. The fast comparison speed together with the promising recognition performance makes this spectral minutiae scheme very applicable for real time applications

Spectral Minutiae Fingerprint Recognition System

Biometrics refers to the automatic recognition of individuals based on their physiological and/or behavioral characteristics, such as faces, finger prints, iris, and gait. In this paper, we focus on the application of finger print recognition system. The spectral minutiae fingerprint recognition is a method to represent a minutiae set as a fixedlength feature vector, which is invariant to translation, and in which rotation and scaling become translations, so that they can be easily compensated for. Based on the spectral minutiae features, this paper introduces two feature reduction algorithms: the Column Principal Component Analysis and the Line Discrete Fourier Transform feature reductions, which can efficiently compress the template size with a reduction rate of 94%.With reduced features, we can also achieve a fast minutiae-based matching algorithm. This paper presents the performance of the spectral minutiae fingerprint recognition system, this fast operation renders our system suitable for a large-scale fingerprint identification system, thus significantly reducing the time to perform matching, especially in systems like, police patrolling, airports etc,. The spectral minutiae representation system tends to significantly reduce the false acceptance rate with a marginal increase in the false rejection rate

A Fast Minutiae-Based Fingerprint Recognition System

The spectral minutiae representation is a method to represent a minutiae set as a fixed-length feature vector, which is invariant to translation, and in which rotation and scaling become translations, so that they can be easily compensated for. These characteristics enable the combination of fingerprint recognition systems with template protection schemes that require as an input a fixed-length feature vector. Based on the spectral minutiae features, this paper introduces two feature reduction algorithms: the Column Principal Component Analysis and the Line Discrete Fourier Transform feature reductions, which can efficiently compress the template size with a reduction rate of 94%. With reduced features, we can also achieve a fast minutiae-based matching algorithm. This paper presents the performance of the spectral minutiae fingerprint recognition system and shows a matching speed with 125 000 comparisons per second on a PC with Intel Pentium D processor 2.80 GHz and 1 GB of RAM. This fast operation renders our system suitable as a preselector for a large-scale fingerprint identification system, thus significantly reducing the time to perform matching, especially in systems operating at geographical level (e.g., police patrolling) or in complex critical environments (e.g., airports)

Improving the robustness of the usual fbe-based asr front-end

All speech recognition systems require some form of signal representation that parametrically models the temporal evolution of the spectral envelope. Current parameterizations involve, either explicitly or implicitly, a set of energies from frequency bands which are often distributed in a mel scale. The computation of those filterbank energies (FBE) always includes smoothing of basic spectral measurements and non-linear amplitude compression. A variety of linear transformations are typically applied to this time-frequency representation prior to the Hidden Markov Model (HMM) pattern-matching stage of recognition. In the paper, we will discuss some robustness issues involved in both the computation of the FBEs and the posterior linear transformations, presenting alternative techniques that can improve robustness in additive noise conditions. In particular, the root non-linearity, a voicing-dependent FBE computation technique and a time&frequency filtering (tiffing) technique will be considered. Recognition results for the Aurora database will be shown to illustrate the potential application of these alternatives techniques for enhancing the robustness of speech recognition systems.Peer ReviewedPostprint (published version

Homogeneous and Heterogeneous Face Recognition: Enhancing, Encoding and Matching for Practical Applications

Face Recognition is the automatic processing of face images with the purpose to recognize individuals. Recognition task becomes especially challenging in surveillance applications, where images are acquired from a long range in the presence of difficult environments. Short Wave Infrared (SWIR) is an emerging imaging modality that is able to produce clear long range images in difficult environments or during night time. Despite the benefits of the SWIR technology, matching SWIR images against a gallery of visible images presents a challenge, since the photometric properties of the images in the two spectral bands are highly distinct.;In this dissertation, we describe a cross spectral matching method that encodes magnitude and phase of multi-spectral face images filtered with a bank of Gabor filters. The magnitude of filtered images is encoded with Simplified Weber Local Descriptor (SWLD) and Local Binary Pattern (LBP) operators. The phase is encoded with Generalized Local Binary Pattern (GLBP) operator. Encoded multi-spectral images are mapped into a histogram representation and cross matched by applying symmetric Kullback-Leibler distance. Performance of the developed algorithm is demonstrated on TINDERS database that contains long range SWIR and color images acquired at a distance of 2, 50, and 106 meters.;Apart from long acquisition range, other variations and distortions such as pose variation, motion and out of focus blur, and uneven illumination may be observed in multispectral face images. Recognition performance of the face recognition matcher can be greatly affected by these distortions. It is important, therefore, to ensure that matching is performed on high quality images. Poor quality images have to be either enhanced or discarded. This dissertation addresses the problem of selecting good quality samples.;The last chapters of the dissertation suggest a number of modifications applied to the cross spectral matching algorithm for matching low resolution color images in near-real time. We show that the method that encodes the magnitude of Gabor filtered images with the SWLD operator guarantees high recognition rates. The modified method (Gabor-SWLD) is adopted in a camera network set up where cameras acquire several views of the same individual. The designed algorithm and software are fully automated and optimized to perform recognition in near-real time. We evaluate the recognition performance and the processing time of the method on a small dataset collected at WVU

Face Recognition via Ensemble Sift Matching of Uncorrelated Hyperspectral Bands and Spectral PCTS

Face recognition is not a new area of study, but facial recognition using through hyperspectral images is a somewhat new concept which is still in its infancy. Although the conventional method of face recognition using Red-Green-Blue (RGB) or grayscale images has been advanced over the last twenty years, these methods are still shown to have weak performance whenever there are variations or changes in lighting, pose, or temporal aspect of the subjects. A hyperspectral representation of an image captures more information that is available within a scene than a RGB image therefore it is beneficial to study the performance of face recognition using a hyperspectral representation of the subjects\u27 faces. We studied the results of a variety of methods for performing face recognition using the Scale Invariant Transformation Feature (SIFT) algorithm as a matching function on uncorrelated spectral bands, principal component representation of the spectral bands, and the ensemble decision of the two. We conclude that there is no dominating method in the scope of our research; however, we do obtain three methods with leading performances despite some trade-off between performance at lower ranks and performance at higher ranks...that outperform the results obtained from a previous study which only considered a SIFT application on a single hyperspectral band which also performs very well under temporal variation

A quality integrated spectral minutiae fingerprint recognition system

Many fingerprint recognition systems are based on minutiae matching. However, the recognition accuracy of minutiae-based matching algorithms is highly dependent on the fingerprint minutiae quality. Therefore, in this paper, we introduce a quality integrated spectral minutiae algorithm, in which the minutiae quality information is incorporated to enhance the performance of the spectral minutiae fingerprint recognition system. In our algorithm, two types of quality data are used. The first is the minutiae reliability, expressing the probability that a given point is indeed a minutia; the second is the minutiae location accuracy, quantifying the error on the minutiae location. We integrate these two types of quality information into the spectral minutiae representation algorithm and achieve a decrease of 1% in equal error rate in the experiment