Performance and computational complexity comparison of block-based fingerprint enhancement

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Performance and computational complexity comparisons of various block-based fingerprint enhancement schemes are tested and reported in this literature. Enhancement performance is evaluated by comparing equal error rates, which obtained by a proposed fingerprint matching algorithm using local and global features. Various enhancement methods are tested; i.e. three types of spatial Gabor filtering, short-time Fourier transform filtering, and discrete cosine transform filtering. These enhancement schemes also tested with various databases such as FVC2000, FVC2002, and FVC2004. Finally, computational complexity of enhancement implementation is analyzed and concluded. © Springer-Verlag Berlin Heidelberg 2009.

Cite

CITATION STYLE

APA

Jirachaweng, S., Leelasawassuk, T., & Areekul, V. (2009). Performance and computational complexity comparison of block-based fingerprint enhancement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5558 LNCS, pp. 656–665). Springer Verlag. https://doi.org/10.1007/978-3-642-01793-3_67

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