Construct a new fixed-length binary fingerprint representation using Kernelized Locality-Sensitive Hashing

Zhe Jin; Andrew Beng Jin Teoh

doi:10.1109/ICIEA.2015.7334128

Construct a new fixed-length binary fingerprint representation using Kernelized Locality-Sensitive Hashing

Zhe Jin, Andrew Beng Jin Teoh

Department of Electrical and Electronic Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

Abstract

ISO/IEC 19794-2 compliant fingerprint minutiae template is an unordered and variable-size point set data. Such characteristic leads to restriction to the applications that can only operate on the ordered fixed-length bit-string, such as cryptographic protocols and biometric cryptosystem scheme like fuzzy commitment and fuzzy extractor operating in hamming domain. In this paper, we propose a discriminative fixed-length binary representation converted from fingerprint minutia based on Kernelized Locality-Sensitive Hashing (KLSH), which enables speedy matching. The proposed method includes four steps: minutiae descriptor extraction; Kernelized Locality-Sensitive Hashing for fixed length vector generation; dynamic feature binarization and matching. Experimental results on FVC2002 databases justify the feasibility of the proposed template in terms of matching accuracy and template randomness.

Original language	English
Title of host publication	Proceedings of the 2015 10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	296-301
Number of pages	6
ISBN (Electronic)	9781467373173
DOIs	https://doi.org/10.1109/ICIEA.2015.7334128
Publication status	Published - 2015 Nov 20
Event	10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015 - Auckland, New Zealand Duration: 2015 Jun 15 → 2015 Jun 17

Publication series

Name	Proceedings of the 2015 10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015

Other

Other	10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015
Country	New Zealand
City	Auckland
Period	15/6/15 → 15/6/17

Bibliographical note

Publisher Copyright:
© 2015 IEEE.

All Science Journal Classification (ASJC) codes

Industrial and Manufacturing Engineering
Electrical and Electronic Engineering

Access to Document

10.1109/ICIEA.2015.7334128

Fingerprint Dive into the research topics of 'Construct a new fixed-length binary fingerprint representation using Kernelized Locality-Sensitive Hashing'. Together they form a unique fingerprint.

Cite this

Jin, Z., & Teoh, A. B. J. (2015). Construct a new fixed-length binary fingerprint representation using Kernelized Locality-Sensitive Hashing. In Proceedings of the 2015 10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015 (pp. 296-301). [7334128] (Proceedings of the 2015 10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICIEA.2015.7334128

Jin, Zhe ; Teoh, Andrew Beng Jin. / Construct a new fixed-length binary fingerprint representation using Kernelized Locality-Sensitive Hashing. Proceedings of the 2015 10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 296-301 (Proceedings of the 2015 10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015).

@inproceedings{6464aec6dc4a4ca99c204b2348e12172,

title = "Construct a new fixed-length binary fingerprint representation using Kernelized Locality-Sensitive Hashing",

abstract = "ISO/IEC 19794-2 compliant fingerprint minutiae template is an unordered and variable-size point set data. Such characteristic leads to restriction to the applications that can only operate on the ordered fixed-length bit-string, such as cryptographic protocols and biometric cryptosystem scheme like fuzzy commitment and fuzzy extractor operating in hamming domain. In this paper, we propose a discriminative fixed-length binary representation converted from fingerprint minutia based on Kernelized Locality-Sensitive Hashing (KLSH), which enables speedy matching. The proposed method includes four steps: minutiae descriptor extraction; Kernelized Locality-Sensitive Hashing for fixed length vector generation; dynamic feature binarization and matching. Experimental results on FVC2002 databases justify the feasibility of the proposed template in terms of matching accuracy and template randomness.",

author = "Zhe Jin and Teoh, {Andrew Beng Jin}",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; 10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015 ; Conference date: 15-06-2015 Through 17-06-2015",

year = "2015",

month = nov,

day = "20",

doi = "10.1109/ICIEA.2015.7334128",

language = "English",

series = "Proceedings of the 2015 10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "296--301",

booktitle = "Proceedings of the 2015 10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015",

address = "United States",

}

Jin, Z & Teoh, ABJ 2015, Construct a new fixed-length binary fingerprint representation using Kernelized Locality-Sensitive Hashing. in Proceedings of the 2015 10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015., 7334128, Proceedings of the 2015 10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015, Institute of Electrical and Electronics Engineers Inc., pp. 296-301, 10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015, Auckland, New Zealand, 15/6/15. https://doi.org/10.1109/ICIEA.2015.7334128

Construct a new fixed-length binary fingerprint representation using Kernelized Locality-Sensitive Hashing. / Jin, Zhe; Teoh, Andrew Beng Jin.

Proceedings of the 2015 10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 296-301 7334128 (Proceedings of the 2015 10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Construct a new fixed-length binary fingerprint representation using Kernelized Locality-Sensitive Hashing

AU - Jin, Zhe

AU - Teoh, Andrew Beng Jin

PY - 2015/11/20

Y1 - 2015/11/20

N2 - ISO/IEC 19794-2 compliant fingerprint minutiae template is an unordered and variable-size point set data. Such characteristic leads to restriction to the applications that can only operate on the ordered fixed-length bit-string, such as cryptographic protocols and biometric cryptosystem scheme like fuzzy commitment and fuzzy extractor operating in hamming domain. In this paper, we propose a discriminative fixed-length binary representation converted from fingerprint minutia based on Kernelized Locality-Sensitive Hashing (KLSH), which enables speedy matching. The proposed method includes four steps: minutiae descriptor extraction; Kernelized Locality-Sensitive Hashing for fixed length vector generation; dynamic feature binarization and matching. Experimental results on FVC2002 databases justify the feasibility of the proposed template in terms of matching accuracy and template randomness.

AB - ISO/IEC 19794-2 compliant fingerprint minutiae template is an unordered and variable-size point set data. Such characteristic leads to restriction to the applications that can only operate on the ordered fixed-length bit-string, such as cryptographic protocols and biometric cryptosystem scheme like fuzzy commitment and fuzzy extractor operating in hamming domain. In this paper, we propose a discriminative fixed-length binary representation converted from fingerprint minutia based on Kernelized Locality-Sensitive Hashing (KLSH), which enables speedy matching. The proposed method includes four steps: minutiae descriptor extraction; Kernelized Locality-Sensitive Hashing for fixed length vector generation; dynamic feature binarization and matching. Experimental results on FVC2002 databases justify the feasibility of the proposed template in terms of matching accuracy and template randomness.

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

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

U2 - 10.1109/ICIEA.2015.7334128

DO - 10.1109/ICIEA.2015.7334128

M3 - Conference contribution

AN - SCOPUS:84960918867

T3 - Proceedings of the 2015 10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015

SP - 296

EP - 301

BT - Proceedings of the 2015 10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015

Y2 - 15 June 2015 through 17 June 2015

ER -

Jin Z, Teoh ABJ. Construct a new fixed-length binary fingerprint representation using Kernelized Locality-Sensitive Hashing. In Proceedings of the 2015 10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015. Institute of Electrical and Electronics Engineers Inc. 2015. p. 296-301. 7334128. (Proceedings of the 2015 10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015). https://doi.org/10.1109/ICIEA.2015.7334128

Construct a new fixed-length binary fingerprint representation using Kernelized Locality-Sensitive Hashing

Abstract

Publication series

Other

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this