Latent fingerprint matching using descriptor-based hough transform

  • Authors:
  • Alessandra A. Paulino;Jianjiang Feng;Anil K. Jain

  • Affiliations:
  • Dept. of Computer Science and Engineering, Michigan State University, East Lansing, U.S.A.;Dept. of Automation, Tsinghua University, Beijing, China;Dept. of Computer Science and Engineering, Michigan State University, East Lansing, U.S.A.

  • Venue:
  • IJCB '11 Proceedings of the 2011 International Joint Conference on Biometrics
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Identifying suspects based on impressions of fingers lifted from crime scenes (latent prints) is extremely important to law enforcement agencies. Latents are usually partial fingerprints with small area, contain nonlinear distortion, and are usually smudgy and blurred. Due to some of these characteristics, they have a significantly smaller number of minutiae points (one of the most important features in fingerprint matching) and therefore it can be extremely difficult to automatically match latents to plain or rolled fingerprints that are stored in law enforcement databases. Our goal is to develop a latent matching algorithm that uses only minutiae information. The proposed approach consists of following three modules: (i) align two sets of minutiae by using a descriptor-based Hough Transform; (ii) establish the correspondences between minutiae; and (iii) compute a similarity score. Experimental results on NIST SD27 show that the proposed algorithm outperforms a commercial fingerprint matcher.