TY - GEN
T1 - Performance evaluation of transform based feature extraction methods for identity authentication system using fingerprint matching
AU - Daftry, Shreyansh
AU - Dawar, Saloni
PY - 2012/8/8
Y1 - 2012/8/8
N2 - 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).
AB - 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).
UR - https://www.scopus.com/pages/publications/84864771857
UR - https://www.scopus.com/inward/citedby.url?scp=84864771857&partnerID=8YFLogxK
U2 - 10.2316/P.2012.778-018
DO - 10.2316/P.2012.778-018
M3 - Conference contribution
AN - SCOPUS:84864771857
SN - 9780889869219
T3 - Proceedings of the IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2012
SP - 132
EP - 137
BT - Proceedings of the IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2012
T2 - IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2012
Y2 - 18 June 2012 through 20 June 2012
ER -