Fingerprint Matching using the Onion Peeling Approach and Turning Function
Nazanin Padkan, B. Sadeghi Bigham, Mohammad Reza Faraji

TL;DR
This paper introduces a novel minutiae-based fingerprint matching method using the onion peeling approach and turning function, demonstrating improved accuracy and efficiency on the FVC2002 database.
Contribution
It proposes a new fingerprint matching algorithm that constructs nested convex polygons of minutiae and compares them with turning function distance, enhancing accuracy and reducing complexity.
Findings
Higher matching scores for same finger fingerprints.
Effective filtering based on layer difference and score thresholds.
Validated on FVC2002 database with promising results.
Abstract
Fingerprint, as one of the most popular and robust biometric traits, can be used in automatic identification and verification systems to identify individuals. Fingerprint matching is a vital and challenging issue in fingerprint recognition systems. Most fingerprint matching algorithms are minutiae-based. The minutiae in fingerprints can be determined by their discontinuity. Ridge ending and ridge bifurcation are two frequently used minutiae in most fingerprint-based matching algorithms. This paper presents a new minutiae-based fingerprint matching using the onion peeling approach. In the proposed method, fingerprints are aligned to find the matched minutiae points. Then, the nested convex polygons of matched minutiae points are constructed and the comparison between peer-to-peer polygons is performed by the turning function distance. Simplicity, accuracy, and low time complexity of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBiometric Identification and Security
