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

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

1 Citation (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 languageEnglish
Title of host publicationProceedings of the 2015 10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages296-301
Number of pages6
ISBN (Electronic)9781467373173
DOIs
Publication statusPublished - 2015 Nov 20
Event10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015 - Auckland, New Zealand
Duration: 2015 Jun 152015 Jun 17

Other

Other10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015
CountryNew Zealand
CityAuckland
Period15/6/1515/6/17

Fingerprint

Biometrics
Cryptography

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering
  • Electrical and Electronic Engineering

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] 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
@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}",
year = "2015",
month = "11",
day = "20",
doi = "10.1109/ICIEA.2015.7334128",
language = "English",
pages = "296--301",
booktitle = "Proceedings of the 2015 10th IEEE Conference on Industrial Electronics and Applications, ICIEA 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
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, 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.

Research output: Chapter in Book/Report/Conference proceedingConference 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

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.

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 https://doi.org/10.1109/ICIEA.2015.7334128