Local and global tree graph structures for fingerprint verification

  • Authors:

  • S. Nalin Pradeep;Mayur D. Jain;R. Balasubramanian;Rama Bhargava

  • Affiliations:

  • Vision Technologies Group, Sarnoff Innovative Technologies Private Ltd., Bangalore, India;Microsoft (R&D) India Private Ltd., Hyderabad, India;Department of Mathematics, Indian Institute of Technology, Roorkee, India;Department of Mathematics, Indian Institute of Technology, Roorkee, India

  • Venue:
  • SPPRA'06 Proceedings of the 24th IASTED international conference on Signal processing, pattern recognition, and applications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce fingerprint verification, one of the most reliable personal identification methods in the biometric technology. In this paper, a new approach to the fingerprint verification based on tree graph construction is presented. Initially we find all possible minutiae points, followed by two levels of matching. At the first level match a local tree graph structure (LTGS) is constructed for each minutia considering its nearest points. Through matching of these tree graphs for each minutia, we get a reference point in the fingerprint. Using this reference point, in the second level match we construct a global tree graph structure (GTGS) spread in four quadrants to reliably determine the uniqueness of fingerprint. Therefore, tree graphs constructed using local and global features of minutiae together provide a solid basis for reliable and robust matching. With several fingerprint images, we tested our proposed verification system and the experimental results shows that the performance of our algorithm is good.