A Study on the Fingerprint Matching Algorithm Based on Radial Structure and Structure-Rewarding Scoring Strategy

Alternative Title
Yu, Kyung Deok
Alternative Author(s)
Na, Sangsin
일반대학원 전자공학과
The Graduate School, Ajou University
Publication Year
fingerprintmatching algorithmradial structure2nd order matchingpreprocessing
본 논문은 지문 정합에 관한 연구이다. 첫번째로 연구된 정합 알고리즘은 보로노이 다이어 그램을 사용하여 구성된 특징점의 집합을 Radial Structure로 구성 하고, 이를 이용하여 참조된 지문과 인증 요청된 지문 사이의 유사도를 판단한다. 두번째로 연구된 정합 알고리즘은 인접 특징점들의 Radial Structure까지 정합의 대상으로 포함한다. 이러한 정합의 인자로써 Radial Structure를 이용하는 이유는 지문 영상의 전처리 과정을 거쳐 추출된 특징점들에는 항상 잡음에 의한 거짓 특징점들이 발생되기 때문에 잡음에 강한 정합 알고리즘이 필수적이기 때문이다. 성능의 검증을 위해 데이터베이스는 FVC2002 DB1을 사용하였고, 경우에 따라 데이터베이스의 작은 부분을 추출해 사용하기도 했다.
Alternative Abstract
This thesis proposes a new fingerprint matching algorithm for locally deformed fingerprints based on a geometric structure of minutiae, called the radial structure, which is a collection of lines from a minutia that connect its Voronoi neighbors. And also, matching algorithm and results based on 2nd order radial structure are introduced. The proposed algorithm consists of local matching followed by global matching, in both of which a new robust scoring strategy is employed. The local matching compares individual radial structures of a query and a template, and the global matching, performed when the local matching fails, utilizes overall radial structures of a query. The algorithm has been tested using the FVC2002 DB1 fingerprint database on a Pentium-4 personal computer with 1.8 GHz clock and 256 Mbyte RAM. The test results show that the average matching time is 0.9 sec and the equal error rate is 9.22%. The 2nd order Radial Structure matching results 5.46% in the equal error rate when the well preprocessed DB which is selected in the FVC2002 DB is used and average matching time is 0.72sec. This is substantial improvement from 15.40% to 9.22% in the equal error rate over the angle-distance based algorithm of Mital and Teoh. This improvement is attributed to the following features of the proposed algorithm: the radial structure is obtained from Voronoi neighboring minutiae, which results in more robustness to false minutiae; and the scoring strategy rewards similarity in the geometric structure rather than feature types as in Mital and Teoh’s paper.

Appears in Collections:
Graduate School of Ajou University > Department of Electronic Engineering > 3. Theses(Master)
Files in This Item:
There are no files associated with this item.
RIS (EndNote)
XLS (Excel)

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.