A robust fingerprint matching algorithm using local alignment

Lee Dongjae, Choi Kyoungtaek, Jaihie Kim

Research output: Contribution to journalArticle

65 Citations (Scopus)

Abstract

This paper describes a minutiae-based fingerprint matching algorithm. Generally, a fingerprint image is nonlinearly deformed by torsion and traction when a finger is pressed on the sensor. This nonlinear deformation changes both position and orientation of minutiae and decreases the reliability of minutiae. Therefore, in matching algorithm using one reference minutiae pair, the reliability of a minutia decreases as the distance from the minutia to the minutia used for alignment increases. The proposed algorithm overcomes this problem by normalizing the distance between minutiae and using local alignment. Experimental results show that the performance of the proposed algorithm is superior to that of using one reference minutiae pair.

Original languageEnglish
Pages (from-to)803-806
Number of pages4
JournalProceedings - International Conference on Pattern Recognition
Volume16
Issue number3
Publication statusPublished - 2002 Dec 1

Fingerprint

Torsional stress
Sensors

All Science Journal Classification (ASJC) codes

  • Computer Vision and Pattern Recognition

Cite this

@article{ac696de2a71c4f82bad11d04b6ccdb9b,
title = "A robust fingerprint matching algorithm using local alignment",
abstract = "This paper describes a minutiae-based fingerprint matching algorithm. Generally, a fingerprint image is nonlinearly deformed by torsion and traction when a finger is pressed on the sensor. This nonlinear deformation changes both position and orientation of minutiae and decreases the reliability of minutiae. Therefore, in matching algorithm using one reference minutiae pair, the reliability of a minutia decreases as the distance from the minutia to the minutia used for alignment increases. The proposed algorithm overcomes this problem by normalizing the distance between minutiae and using local alignment. Experimental results show that the performance of the proposed algorithm is superior to that of using one reference minutiae pair.",
author = "Lee Dongjae and Choi Kyoungtaek and Jaihie Kim",
year = "2002",
month = "12",
day = "1",
language = "English",
volume = "16",
pages = "803--806",
journal = "Proceedings - International Conference on Pattern Recognition",
issn = "1051-4651",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

A robust fingerprint matching algorithm using local alignment. / Dongjae, Lee; Kyoungtaek, Choi; Kim, Jaihie.

In: Proceedings - International Conference on Pattern Recognition, Vol. 16, No. 3, 01.12.2002, p. 803-806.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A robust fingerprint matching algorithm using local alignment

AU - Dongjae, Lee

AU - Kyoungtaek, Choi

AU - Kim, Jaihie

PY - 2002/12/1

Y1 - 2002/12/1

N2 - This paper describes a minutiae-based fingerprint matching algorithm. Generally, a fingerprint image is nonlinearly deformed by torsion and traction when a finger is pressed on the sensor. This nonlinear deformation changes both position and orientation of minutiae and decreases the reliability of minutiae. Therefore, in matching algorithm using one reference minutiae pair, the reliability of a minutia decreases as the distance from the minutia to the minutia used for alignment increases. The proposed algorithm overcomes this problem by normalizing the distance between minutiae and using local alignment. Experimental results show that the performance of the proposed algorithm is superior to that of using one reference minutiae pair.

AB - This paper describes a minutiae-based fingerprint matching algorithm. Generally, a fingerprint image is nonlinearly deformed by torsion and traction when a finger is pressed on the sensor. This nonlinear deformation changes both position and orientation of minutiae and decreases the reliability of minutiae. Therefore, in matching algorithm using one reference minutiae pair, the reliability of a minutia decreases as the distance from the minutia to the minutia used for alignment increases. The proposed algorithm overcomes this problem by normalizing the distance between minutiae and using local alignment. Experimental results show that the performance of the proposed algorithm is superior to that of using one reference minutiae pair.

UR - http://www.scopus.com/inward/record.url?scp=33751573265&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33751573265&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:33751573265

VL - 16

SP - 803

EP - 806

JO - Proceedings - International Conference on Pattern Recognition

JF - Proceedings - International Conference on Pattern Recognition

SN - 1051-4651

IS - 3

ER -