Approximate fingerprint matching using kd-tree

Author

Bhowmick, Partha ; Bhattacharya, Bhargab B.

Author_Institution

Dept. of Comput. Sci. & Technol., Bengal Eng. Coll., Howrah, India

Volume

1

fYear

2004

fDate

23-26 Aug. 2004

Firstpage

544

Abstract

Fast and robust fingerprint matching is a challenging task today in fingerprint-based biometric systems. A fingerprint matching algorithm compares two given fingerprints and returns either a degree of similarity or a binary decision. Minutiae-based fingerprint matching is the most well-known and widely used method. This paper reveals a new technique of fingerprint matching, using an efficient data structure, combining the minutiae representation with the individual usefulness of each minutia, to make the matching more powerful. Experimental results exhibit the strength of this method.

Keywords

data structures; fingerprint identification; image matching; image representation; tree data structures; trees (mathematics); binary decision; data structure; fingerprint based biometric systems; fingerprint matching algorithm; kd-tree; minutiae representation; Bifurcation; Computer science; Data mining; Educational institutions; Fingerprint recognition; Fingers; Gray-scale; Image matching; Pattern matching; Robustness;

fLanguage

English

Publisher

ieee

Conference_Titel

Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on

ISSN

1051-4651

Print_ISBN

0-7695-2128-2

Type

conf

DOI

10.1109/ICPR.2004.1334194

Filename

1334194