DSpace
 

Researchspace >
General science, engineering & technology >
General science, engineering & technology >
General science, engineering & technology >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10204/5755

Title: A comparative study of fingerprint thinning algorithms
Authors: Khanyile, NP
Tapamo, JR
Dube, E
Keywords: Fingerprint Recognition
Fingerprint thinning algorithms
Biometrics
Optical Character Recognition
OCR
Issue Date: Aug-2011
Publisher: IEEE
Citation: Khanyile, NP, Tapamo, JR and Dube, E. A comparative study of fingerprint thinning algorithms. 10th Annual Information Security for South Africa Conference (ISSA 2011), Hayatt Regency Hotel, Rosebank, South Africa, 15-17 August 2011
Series/Report no.: Workflow;8415
Abstract: Thinning plays a very important role in the preprocessing phase of automatic fingerprint recognition/identification systems. The performance of minutiae extraction relies heavily on the quality of skeletons used. A good fingerprint thinning algorithm can depress image noise and promote the robustness of the minutiae extraction algorithm which helps improve the overall performance of the system. Many thinning algorithms have been devised and applied to a wide range of applications including, Optical Character Recognition (OCR), biological cell structures and fingerprint patterns. With so many thinning algorithms available, deciding which one is appropriate for a particular application has become very difficult. In an effort to assist fingerprint biometrics developers choose an appropriate thinning algorithm, a study was taken to compare performance of four different thinning algorithms. These four algorithms are implemented and their performance evaluated and compared. The algorithms are compared in terms of the quality of the skeletons they produce (i.e. connectivity and spurious branches) as well as the time complexity associated with each algorithm. Results show that faster algorithms have difficulty preserving connectivity. Zhang and Suen’s algorithm gives the least processing time, while Guo and Hall’s algorithm produces the best skeleton quality.
Description: Copyright: 2011 IEEE. This is the post-print version of the work. Reprinted, with permission, from Khanyile, NP, Tapamo, JR and Dube, E. A comparative study of fingerprint thinning algorithms. 10th Annual Information Security for South Africa Conference (ISSA 2011), Hayatt Regency Hotel, Rosebank, South Africa, 15-17 August 2011. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of CSIR Information Services' products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
URI: http://icsa.cs.up.ac.za/issa/2011/Proceedings/Research/Khanyile_Tapamo_Dube.pdf
http://hdl.handle.net/10204/5755
ISBN: 978-1-4577-1482-5
Appears in Collections:Information security
General science, engineering & technology

Files in This Item:

File Description SizeFormat
Dube3_2011.pdf1.12 MBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback