A Fingerprint Matching Algorithm Based On Delaunay Triangulation Net

  • Authors:
  • Ning Liu;Yilong Yin;Hongwei Zhang

  • Affiliations:
  • Shandong University;Shandong University;Shandong University

  • Venue:
  • CIT '05 Proceedings of the The Fifth International Conference on Computer and Information Technology
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Fingerprint matching is a key issue in research of an automatic fingerprint identification system. On the basis of Delaunay triangulation (DT) in computational geometry, we proposed a fingerprint matching algorithm based on DT net in this paper. It uses DT in fingerprint matching, and then develops a matching algorithm based on DT net to find reference minutiae pairs (RMPs). Using DT on the topological structure of minutiae set, a DT net is formed with minutiae as vertexes. From the nets of the input minutiae set and template minutiae set, select out a certain pairs of minutiae which have similar structures as RMPs for aligning, and matching is carried out based on point pattern. The experiment is conducted on FVC2002, and the result indicates the validity of our algorithm.