Skip to main navigation Skip to search Skip to main content

A fingerprint identification algorithm by clustering similarity

  • Jie Tian*
  • , Yuliang He
  • , Hong Chen
  • , Xin Yang
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

This paper introduces a fingerprint identification algorithm by clustering similarity with the view to overcome the dilemmas encountered in fingerprint identification. To decrease multi-spectrum noises in a fingerprint, we first use a dyadic scale space (DSS) method for image enhancement. The second step describes the relative features among minutiae by building a minutia-simplex which contains a pair of minutiae and their local associated ridge information, with its transformation-variant and invariant relative features applied for comprehensive similarity measurement and for parameter estimation respectively. The clustering method is employed to estimate the transformation space. Finally, multi-resolution technique is used to find an optimal transformation model for getting the maximal mutual information between the input and the template features. The experimental results including the performance evaluation by the 2nd International Verification Competition in 2002 (FVC2002), over the four fingerprint databases of FVC2002 indicate that our method is promising in an automatic fingerprint identification system (AFIS). Copyright by Science in China Press 2005.

Original languageEnglish
Pages (from-to)437-451
Number of pages15
JournalScience in China, Series F: Information Sciences
Volume48
Issue number4
DOIs
StatePublished - Aug 2005
Externally publishedYes

Keywords

  • Comprehensive similarity
  • Dyadic scale space (DSS)
  • Minutia-simplex
  • Multi-resolution

Fingerprint

Dive into the research topics of 'A fingerprint identification algorithm by clustering similarity'. Together they form a unique fingerprint.

Cite this