Abstract
Fingerprint verification is an important biometric technique for personal identification. This paper presents a performance evaluation of different fingerprint feature extraction methods. Fingerprint matching scheme based on transform features, like DCT (Discrete Cosine Transform), FFT (Fast Fourier Transform) and DWT (Discrete wavelet transform), have been presented and compared. In the fingerprint recognition application utilizing more information other than minutiae is much helpful. The technique described here obviates the need for extracting minutiae points to match fingerprint images. The transform coefficients are used to obtain the feature vector in terms of standard deviation and energy. Matching is performed using fast Euclidean distance between two feature vectors. The algorithms have been tested on database available from University of Bologna. Our comparison shows that DCT and FFT yields better GAR (Genuine acceptance rate) at low FAR (False acceptance rate) with reduced computational complexity over existing DWT and Gabor based algorithms. Because of reduced computational complexity these algorithms can be easily implemented as an embedded automatic fingerprint identification system (AFIS).
Original language | English |
---|---|
Title of host publication | Proceedings of the IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2012 |
Pages | 132-137 |
Number of pages | 6 |
DOIs | |
Publication status | Published - 08-08-2012 |
Externally published | Yes |
Event | IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2012 - Crete, Greece Duration: 18-06-2012 → 20-06-2012 |
Conference
Conference | IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2012 |
---|---|
Country/Territory | Greece |
City | Crete |
Period | 18-06-12 → 20-06-12 |
All Science Journal Classification (ASJC) codes
- Computer Vision and Pattern Recognition
- Signal Processing