Fingerprint Matching using the Onion Peeling Approach and Turning Function

• URL: http://arxiv.org/abs/2110.00958v1
• Date: Sun, 3 Oct 2021 09:10:44 GMT
• Title: Fingerprint Matching using the Onion Peeling Approach and Turning Function
• Authors: Nazanin Padkan, B. Sadeghi Bigham, Mohammad Reza Faraji
• Abstract summary: Fingerprint is one of the most popular and robust biometric traits. Most fingerprint matching algorithms are minutiae-based. This paper presents a new minutiae-based fingerprint matching using the onion peeling approach.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• 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 the Onion peeling approach are three important factors that make it a standard method for fingerprint matching purposes. The performance of the proposed algorithm is evaluated on the database $FVC2002$. The results show that fingerprints of the same fingers have higher scores than different fingers. Since the fingerprints that the difference between the number of their layers is more than $2$ and the minutiae matching score lower than 0.15 are ignored, the better results are obtained.

Related papers

• A Robust Algorithm for Contactless Fingerprint Enhancement and Matching [7.820996917431323]
  contactless fingerprint images exhibit four distinct characteristics. They contain less noise, have fewer discontinuities in ridge patterns, and pose an interoperability problem. We propose a novel contactless fingerprint identification solution that enhances the accuracy of minutiae detection.
  arXiv  Detail & Related papers  (2024-08-18T10:01:42Z)
• Deep Learning-Based Approaches for Contactless Fingerprints Segmentation and Extraction [1.2441902898414798]
  We develop a deep learning-based segmentation tool for contactless fingerprint localization and segmentation. In our evaluation, our segmentation method demonstrated an average mean absolute error (MAE) of 30 pixels, an error in angle prediction (EAP) of 5.92 degrees, and a labeling accuracy of 97.46%.
  arXiv  Detail & Related papers  (2023-11-26T01:56:10Z)
• FIGO: Enhanced Fingerprint Identification Approach Using GAN and One Shot Learning Techniques [0.0]
  We propose a Fingerprint Identification approach based on Generative adversarial network and One-shot learning techniques. First, we propose a Pix2Pix model to transform low-quality fingerprint images to a higher level of fingerprint images pixel by pixel directly in the fingerprint enhancement tier. Second, we construct a fully automated fingerprint feature extraction model using a one-shot learning approach to differentiate each fingerprint from the others in the fingerprint identification process.
  arXiv  Detail & Related papers  (2022-08-11T02:45:42Z)
• A review of schemes for fingerprint image quality computation [66.32254395574994]
  This paper reviews existing approaches for fingerprint image quality computation. We also implement, test and compare a selection of them using the MCYT database including 9000 fingerprint images.
  arXiv  Detail & Related papers  (2022-07-12T10:34:03Z)
• On the vulnerability of fingerprint verification systems to fake fingerprint attacks [57.36125468024803]
  A medium-size fake fingerprint database is described and two different fingerprint verification systems are evaluated on it. Results for an optical and a thermal sweeping sensors are given.
  arXiv  Detail & Related papers  (2022-07-11T12:22:52Z)
• Pair-Relationship Modeling for Latent Fingerprint Recognition [25.435974669629374]
  We propose a new scheme that can model the pair-relationship of two fingerprints directly as the similarity feature for recognition. Experimental results on two databases show that the proposed method outperforms the state of the art.
  arXiv  Detail & Related papers  (2022-07-02T11:31:31Z)
• A Comparative Study of Fingerprint Image-Quality Estimation Methods [54.84936551037727]
  Poor-quality images result in spurious and missing features, thus degrading the performance of the overall system. In this work, we review existing approaches for fingerprint image-quality estimation. We have also tested a selection of fingerprint image-quality estimation algorithms.
  arXiv  Detail & Related papers  (2021-11-14T19:53:12Z)
• ProxyFAUG: Proximity-based Fingerprint Augmentation [81.15016852963676]
  ProxyFAUG is a rule-based, proximity-based method of fingerprint augmentation. The best performing positioning method on this dataset is improved by 40% in terms of median error and 6% in terms of mean error, with the use of the augmented dataset.
  arXiv  Detail & Related papers  (2021-02-04T15:59:30Z)
• Responsible Disclosure of Generative Models Using Scalable Fingerprinting [70.81987741132451]
  Deep generative models have achieved a qualitatively new level of performance. There are concerns on how this technology can be misused to spoof sensors, generate deep fakes, and enable misinformation at scale. Our work enables a responsible disclosure of such state-of-the-art generative models, that allows researchers and companies to fingerprint their models.
  arXiv  Detail & Related papers  (2020-12-16T03:51:54Z)
• Latent Fingerprint Registration via Matching Densely Sampled Points [100.53031290339483]
  Existing latent fingerprint registration approaches are mainly based on establishing correspondences between minutiae. We propose a non-minutia latent fingerprint registration method which estimates the spatial transformation between a pair of fingerprints. The proposed method achieves the state-of-the-art registration performance, especially under challenging conditions.
  arXiv  Detail & Related papers  (2020-05-12T15:51:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.