A fast fingerprint matching algorithm using Parzen density estimation

  • Authors:
  • Choonwoo Ryu;Hakil Kim

  • Affiliations:
  • Dept. of Automation Engineering, College of Engineering, Inha University, Incheon, Korea;Dept. of Automation Engineering, College of Engineering, Inha University, Incheon, Korea

  • Venue:
  • ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Minutiae-based fingerprint matching algorithms generally consist of two steps: alignment of minutiae and search for the corresponding minutiae. This paper presents a triangular matching algorithm for fast alignment, in which the overall processing time can be significantly cut down by making a quick decision on the amounts of rotation and translation between a pair of fingerprint images. The alignment algorithm proposes a novel triangular data structure and utilizes Parzen density estimation. The proposed algorithm has been tested under well-formed testing scenario over an Atmel fingerprint database and demonstrated promising improvement both in processing time and in recognition accuracy.