.png){kind=icon}
.png){kind=icon}
Return
Generating Fixed-Length Representation From Minutiae Using Kernel Methods for Fingerprint Authentication
.png){kind=icon}
PRE
AI
DOI：10.1109/TSMC.2015.2499725.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The ISO/IEC 19794-2-compliant fingerprint minutiae template is an unordered and variable-sized point set data. Such a characteristic leads to a restriction for the applications that can only operate on fixed-length binary data, such as cryptographic applications and certain biometric cryptosystems (e.g., fuzzy commitment). In this paper, we propose a generic point-to-string conversion framework for fingerprint minutia based on kernel learning methods to generate discriminative fixed length binary strings, which enables rapid matching. The proposed framework consists of four stages: 1) minutiae descriptor extraction; 2) a kernel transformation method that is composed of kernel principal component analysis or kernelized locality-sensitive hashing for fixed length vector generation; 3) a dynamic feature binarization; and 4) matching. The promising experimental results on six datasets from fingerprint verification competition (FVC)2002 and FVC2004 justify the feasibility of the proposed framework in terms of matching accuracy, efficiency, and template randomness.
Keywords:
Fingerprint
fixed-length representation
kernel methods
randomness of bit-string
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W
Organization
View more organizations