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 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)

Hand-based multimodal identification system with secure biometric template storage

WOS:000304107200001This study proposes a biometric system for personal identification based on three biometric characteristics from the hand, namely: the palmprint, finger surfaces and hand geometry. A protection scheme is applied to the biometric template data to guarantee its revocability, security and diversity among different biometric systems. An error-correcting code (ECC), a cryptographic hash function (CHF) and a binarisation module are the core of the template protection scheme. Since the ECC and CHF operate on binary data, an additional feature binarisation step is required. This study proposes: (i) a novel identification architecture that uses hand geometry as a soft biometric to accelerate the identification process and ensure the system's scalability; and (ii) a new feature binarisation technique that guarantees that the Hamming distance between transformed binary features is proportional to the difference between their real values. The proposed system achieves promising recognition and speed performances on two publicly available hand image databases.info:eu-repo/semantics/acceptedVersio