Quality-based fingerprint segmentation

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

Abstract

The need for segmentation of low quality fingerprints in forensics, high security and civilian applications is constantly increasing. Most segmentation algorithms proposed in the literature normally deal with separation of the background from the foreground. However, low quality foreground regions must also be removed to lower errors in feature extraction, matching and decision modules. In this research work, a quality based fingerprint segmentation algorithm is proposed. The proposed algorithm is block-wise, it utilizes the auto-correlation matrix of gradients and its eigenvalue to compute the score quality measure of each block. The score quality measures both local contrast and orientation in each block. The threshold is computed by taking the mean for all the scores assigned to each block. It was evaluated on FVC 2002 and NIST High Resolution 27A databases. Its performance compared to other algorithms was evaluated by independent fingerprint quality measure algorithm. The results from both FVC and NIST databases show that the proposed algorithm results are promising. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Mngenge, N. A., Nelwamondo, F. V., Malumedzha, T., & Msimang, N. (2012). Quality-based fingerprint segmentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7325 LNCS, pp. 54–63). https://doi.org/10.1007/978-3-642-31298-4_7

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