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

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

Fingerprint template protection using minutia-pair spectral representations

Storage of biometric data requires some form of template protection in order to preserve the privacy of people enrolled in a biometric database. One approach is to use a Helper Data System. Here it is necessary to transform the raw biometric measurement into a fixed-length representation. In this paper we extend the spectral function approach of Stanko and Skoric [WIFS2017], which provides such a fixed-length representation for fingerprints. First, we introduce a new spectral function that captures different information from the minutia orientations. It is complementary to the original spectral function, and we use both of them to extract information from a fingerprint image. Second, we construct a helper data system consisting of zero-leakage quantisation followed by the Code Offset Method. We show empirical data which demonstrates that applying our helper data system causes only a small performance penalty compared to fingerprint authentication based on the unprotected spectral functions

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 minutiae representations of fingerprints enhanced by quality data

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 one is the minutiae reliability, expressing the probability that a given point is indeed a minutia; the second one 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 in the Equal Error Rate of over 20% in the experiment

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