Spectral eigenfeatures for effective DP matching in fingerprint recognition

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Dynamic Programming (DP) matching has been applied to solve distortion in spectral-based fingerprint recognition. However, spectral data is redundant, and its size is huge. PCA could be used to reduce the data size, but leads to loss of topographical information in projected vectors. This allows only inter-vector similarity estimations such as Euclid or Mahalanobis distances, and proves to be inadequate in presence of distortion occurring in finger sweeping with a line sensor. In this paper, we propose a novel two-step PCA to extract compact eigenfeatures amenable to DP matching. The first PCA extracts eigenfeatures of Fourier spectra from each image line. The second extracts eigenfeatures from all lines to form the feature templates. In matching, the feature templates are inversely transformed to line-by-line representations on the first PCA subspace for DP matching. Fingerprint matching experiments demonstrate the effectiveness of our proposed approach in template size reduction and accuracy improvement. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Danev, B., & Kamei, T. (2007). Spectral eigenfeatures for effective DP matching in fingerprint recognition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4673 LNCS, pp. 809–816). Springer Verlag. https://doi.org/10.1007/978-3-540-74272-2_100

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free