Approximate Fingerprint Matching Using Kd-Tree

Authors:
Partha Bhowmick;Bhargab B. Bhattacharya
Affiliations:
Bengal Engineering College (DU), India;Indian Statistical Institute, India
Venue:
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 1 - Volume 01
Year:
2004

Citing 0
Cited 4

Removal of digitization errors in fingerprint ridgelines using B-splines

Pattern Recognition
Real Polygonal Covers of Digital Discs - Some Theories and Experiments

Fundamenta Informaticae
Approximation of digital circles by regular polygons

ICAPR'05 Proceedings of the Third international conference on Advances in Pattern Recognition - Volume Part I
Real Polygonal Covers of Digital Discs - Some Theories and Experiments

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

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 [Handbook of Fingerprint Recognition]. 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.