Fingerprint matching using dual hilbert scans

Li Tian, Liang Chen, Seiichiro Kamata

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

3 Citations (Scopus)

Abstract

A new fingerprint matching algorithm using dual Hilbert scans is presented in this study. We treat the fingerprint matching as point pattern matching problem and Hilbert scans are used in two aspects of the matching problem: one is applied to the similarity measure and the other is used in search space reduction. The similarity measure named Hilbert Scanning Distance (HSD) can be computed fast by converting the 2-D coordinates of 2-D images into 1-D space information using Hilbert scan. On the other hand, the 3-D search space can be converted to a 1-D search space sequence. The proposed method has been tested on FVC2002 database. The experimental results show that our method can implement fingerprint matching robustly and efficiently. The performance evaluation EER (Equal-Error Rate) generally used is very low by our algorithm.

Original languageEnglish
Title of host publicationProceedings - International Conference on Signal Image Technologies and Internet Based Systems, SITIS 2007
Pages593-600
Number of pages8
DOIs
Publication statusPublished - 2007
Event3rd IEEE International Conference on Signal Image Technologies and Internet Based Systems, SITIS'07 - Jiangong Jinjiang, Shanghai
Duration: 2007 Dec 162007 Dec 18

Other

Other3rd IEEE International Conference on Signal Image Technologies and Internet Based Systems, SITIS'07
CityJiangong Jinjiang, Shanghai
Period07/12/1607/12/18

Fingerprint

Pattern matching
Scanning

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Computer Networks and Communications
  • Signal Processing

Cite this

Tian, L., Chen, L., & Kamata, S. (2007). Fingerprint matching using dual hilbert scans. In Proceedings - International Conference on Signal Image Technologies and Internet Based Systems, SITIS 2007 (pp. 593-600). [4618827] https://doi.org/10.1109/SITIS.2007.75

Fingerprint matching using dual hilbert scans. / Tian, Li; Chen, Liang; Kamata, Seiichiro.

Proceedings - International Conference on Signal Image Technologies and Internet Based Systems, SITIS 2007. 2007. p. 593-600 4618827.

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

Tian, L, Chen, L & Kamata, S 2007, Fingerprint matching using dual hilbert scans. in Proceedings - International Conference on Signal Image Technologies and Internet Based Systems, SITIS 2007., 4618827, pp. 593-600, 3rd IEEE International Conference on Signal Image Technologies and Internet Based Systems, SITIS'07, Jiangong Jinjiang, Shanghai, 07/12/16. https://doi.org/10.1109/SITIS.2007.75
Tian L, Chen L, Kamata S. Fingerprint matching using dual hilbert scans. In Proceedings - International Conference on Signal Image Technologies and Internet Based Systems, SITIS 2007. 2007. p. 593-600. 4618827 https://doi.org/10.1109/SITIS.2007.75
Tian, Li ; Chen, Liang ; Kamata, Seiichiro. / Fingerprint matching using dual hilbert scans. Proceedings - International Conference on Signal Image Technologies and Internet Based Systems, SITIS 2007. 2007. pp. 593-600
@inproceedings{d4164a4fca364406aa894328094f594d,
title = "Fingerprint matching using dual hilbert scans",
abstract = "A new fingerprint matching algorithm using dual Hilbert scans is presented in this study. We treat the fingerprint matching as point pattern matching problem and Hilbert scans are used in two aspects of the matching problem: one is applied to the similarity measure and the other is used in search space reduction. The similarity measure named Hilbert Scanning Distance (HSD) can be computed fast by converting the 2-D coordinates of 2-D images into 1-D space information using Hilbert scan. On the other hand, the 3-D search space can be converted to a 1-D search space sequence. The proposed method has been tested on FVC2002 database. The experimental results show that our method can implement fingerprint matching robustly and efficiently. The performance evaluation EER (Equal-Error Rate) generally used is very low by our algorithm.",
author = "Li Tian and Liang Chen and Seiichiro Kamata",
year = "2007",
doi = "10.1109/SITIS.2007.75",
language = "English",
isbn = "9780769531229",
pages = "593--600",
booktitle = "Proceedings - International Conference on Signal Image Technologies and Internet Based Systems, SITIS 2007",

}

TY - GEN

T1 - Fingerprint matching using dual hilbert scans

AU - Tian, Li

AU - Chen, Liang

AU - Kamata, Seiichiro

PY - 2007

Y1 - 2007

N2 - A new fingerprint matching algorithm using dual Hilbert scans is presented in this study. We treat the fingerprint matching as point pattern matching problem and Hilbert scans are used in two aspects of the matching problem: one is applied to the similarity measure and the other is used in search space reduction. The similarity measure named Hilbert Scanning Distance (HSD) can be computed fast by converting the 2-D coordinates of 2-D images into 1-D space information using Hilbert scan. On the other hand, the 3-D search space can be converted to a 1-D search space sequence. The proposed method has been tested on FVC2002 database. The experimental results show that our method can implement fingerprint matching robustly and efficiently. The performance evaluation EER (Equal-Error Rate) generally used is very low by our algorithm.

AB - A new fingerprint matching algorithm using dual Hilbert scans is presented in this study. We treat the fingerprint matching as point pattern matching problem and Hilbert scans are used in two aspects of the matching problem: one is applied to the similarity measure and the other is used in search space reduction. The similarity measure named Hilbert Scanning Distance (HSD) can be computed fast by converting the 2-D coordinates of 2-D images into 1-D space information using Hilbert scan. On the other hand, the 3-D search space can be converted to a 1-D search space sequence. The proposed method has been tested on FVC2002 database. The experimental results show that our method can implement fingerprint matching robustly and efficiently. The performance evaluation EER (Equal-Error Rate) generally used is very low by our algorithm.

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

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

U2 - 10.1109/SITIS.2007.75

DO - 10.1109/SITIS.2007.75

M3 - Conference contribution

SN - 9780769531229

SP - 593

EP - 600

BT - Proceedings - International Conference on Signal Image Technologies and Internet Based Systems, SITIS 2007

ER -