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

A New Biometric Template Protection using Random Orthonormal Projection and Fuzzy Commitment

Biometric template protection is one of most essential parts in putting a biometric-based authentication system into practice. There have been many researches proposing different solutions to secure biometric templates of users. They can be categorized into two approaches: feature transformation and biometric cryptosystem. However, no one single template protection approach can satisfy all the requirements of a secure biometric-based authentication system. In this work, we will propose a novel hybrid biometric template protection which takes benefits of both approaches while preventing their limitations. The experiments demonstrate that the performance of the system can be maintained with the support of a new random orthonormal project technique, which reduces the computational complexity while preserving the accuracy. Meanwhile, the security of biometric templates is guaranteed by employing fuzzy commitment protocol.Comment: 11 pages, 6 figures, accepted for IMCOM 201

Multi-bits biometric string generation based on the likelyhood ratio

Preserving the privacy of biometric information stored in biometric systems is becoming a key issue. An important element in privacy protecting biometric systems is the quantizer which transforms a normal biometric template into a binary string. In this paper, we present a user-specific quantization method based on a likelihood ratio approach (LQ). The bits generated from every feature are concatenated to form a fixed length binary string that can be hashed to protect its privacy. Experiments are carried out on both fingerprint data (FVC2000) and face data (FRGC). Results show that our proposed quantization method achieves a reasonably good performance in terms of FAR/FRR (when FAR is 10−4, the corresponding FRR are 16.7% and 5.77% for FVC2000 and FRGC, respectively)

Research of Ateb-Gabor filter in biometric protection systems

Biometric recognition systems require the development of new technologies and need improvement. A new filter of Ateb-Gabor has been investigated. The filter is based on the use of a combination of Gabor filter and periodic Atebfunctions. This combination allows us to provide flexibility for control by choosing two parameters m and n, which is provided by the mathematical apparatus of the Ateb functions. Filtration was performed on the example of biometric images. It has been shown that Ateb-Gabor filtration gives better filtration results than ordinary Gabor filter. Experimental research has been carried ou

A Formal Study of the Privacy Concerns in Biometric-Based Remote Authentication Schemes

With their increasing popularity in cryptosystems, biometrics have attracted more and more attention from the information security community. However, how to handle the relevant privacy concerns remains to be troublesome. In this paper, we propose a novel security model to formalize the privacy concerns in biometric-based remote authentication schemes. Our security model covers a number of practical privacy concerns such as identity privacy and transaction anonymity, which have not been formally considered in the literature. In addition, we propose a general biometric-based remote authentication scheme and prove its security in our security model

Binary palmprint representation for feature template protection

The major challenge of biometric template protection comes from the intraclass variations of biometric data. The helper data scheme aims to solve this problem by employing the Error Correction Codes (ECC). However, many reported biometric binary features from the same user reach bit error rate (BER) as high as 40%, which exceeds the error correcting capability of most ECC (less than 25%). Therefore, a novel palmprint binary feature extraction method is proposed in this paper. The real-valued features are firstly extracted. Then one-bit quantization and reliable bits selection are processed. For verification multiple samples are required to be enrolled while training is not necessary. Experiments have been carried out on the HongKong PolyU Palmprint database. Results show that our method achieves much lower BER, lower verification error rate and allows a secret key long enough for security

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