Data Structure for processing Fingerprint Image efficiently, and Minutiae Extraction and Matching Algorithms 


Vol. 34,  No. 8, pp. 220-226, Aug.  2009


PDF
  Abstract

In this paper, a new data structure is suggested called Union and Division, for processing binarized digital fingerprint image efficiently. We present a minutiae extraction algorithm that is using Union and Division and consists of binarization, noise removal, minutiae extraction stages. We present a matching algorithm which uses line segment connecting two minutiae on same ridge as reference point. A data structure has a meaning only if a time for processing the information when the data structure is used spends less than a time when the data structure is not used. Experimental result shows that a time for processing the binarized fingerprint image when the data structure is used where 1/3 is a time for processing the binarized fingerprint image when the data structure is not used. Our minutiae extraction algorithm and matching algorithm had processed the fingerprint images in SDB14 with 97% recognition rate and 3% false recognition rate in, on the average, 0.5 seconds.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

Y. Na, J. Park, B. Park, "Data Structure for processing Fingerprint Image efficiently, and Minutiae Extraction and Matching Algorithms," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 8, pp. 220-226, 2009. DOI: .

[ACM Style]

Young-nam Na, Jong-min Park, and Byung-jun Park. 2009. Data Structure for processing Fingerprint Image efficiently, and Minutiae Extraction and Matching Algorithms. The Journal of Korean Institute of Communications and Information Sciences, 34, 8, (2009), 220-226. DOI: .

[KICS Style]

Young-nam Na, Jong-min Park, Byung-jun Park, "Data Structure for processing Fingerprint Image efficiently, and Minutiae Extraction and Matching Algorithms," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 8, pp. 220-226, 8. 2009.