EEMCS

Full text available as:

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 1636 Kb

Official URL: http://dx.doi.org/10.1109/JSYST.2009.2034945

Abstract

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

Export this item as:

• BibTeX
• XML

To correct this item please ask your editor

Repository Staff Only: edit this item