A fingerprint verification algorithm using the smallest minimum sum of closest Euclidean distance

Ujjal Kumar Bhowmik, Ashkan Ashrafi, Reza R. Adhami

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, a Euclidean distance based minutia matching algorithm is proposed to improve the matching accuracy in fingerprint verification system. This algorithm extracts matched minutia pairs from input and template fingerprints by using the smallest minimum sum of closest Euclidean distance (SMSCED), corresponding rotation angle and empirically chosen statistical threshold values. Instead of using the minutia type and orientation angle, which are widely employed in existing algorithms, the proposed algorithm uses only the minutia location, to reduce the effect of non-linear distortion. Experimental results show that the proposed method has higher accuracy with improved verification rate and rejection rate.

Original languageEnglish (US)
Title of host publicationCONIELECOMP 2009 - 19th International Conference on Electronics Communications and Computers
Pages90-95
Number of pages6
DOIs
StatePublished - 2009
Externally publishedYes
Event19th International Conference on Electronics Communications and Computers, CONIELECOMP 2009 - Cholula, Puebla, Mexico
Duration: Feb 26 2009Feb 28 2009

Publication series

NameCONIELECOMP 2009 - 19th International Conference on Electronics Communications and Computers

Conference

Conference19th International Conference on Electronics Communications and Computers, CONIELECOMP 2009
Country/TerritoryMexico
CityCholula, Puebla
Period2/26/092/28/09

Keywords

  • Automatic fingerprint verification system (AFVS)
  • Input fingerprint
  • Minutia matching
  • Smallest minimum sum of closest Euclidean distance (SMSCED)
  • Template fingerprint

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Communication

Fingerprint

Dive into the research topics of 'A fingerprint verification algorithm using the smallest minimum sum of closest Euclidean distance'. Together they form a unique fingerprint.

Cite this