Alignment-Free Cancellable Template with Clustered-Minutiae Local Structure

Cancellable fingerprint template has increasingly received interest in research thanks to not only the security for the user's original features but also the stable performance for the system. In this paper, we propose a new method to design cancellable fingerprint template with local structure by clustering the minutiae using the k Nearest Neighbor (kNN) algorithm. In other words, $k$ minutiae in a fingerprint that are closest to a reference minutia form a local structure. Pairwise features from the reference minutia and each of the member in the cluster are extracted and used for local structure matching. The partial Discrete Fourier Transformation was applied as the non-invertible transformation. This method has been evaluated with four public databases FVC2002 DB1-DB3, and FVC2004 DB2. The Equal Error Rate achieved for each database is 0.2%, 0.04%, 4.78%, and 7.64%, respectively.

[1]  Zhe Jin,et al.  Fingerprint template protection with minutiae-based bit-string for security and privacy preserving , 2012, Expert Syst. Appl..

[2]  Jiankun Hu,et al.  Alignment-free cancelable fingerprint template design: A densely infinite-to-one mapping (DITOM) approach , 2012, Pattern Recognit..

[3]  Christoph Busch,et al.  Dynamic random projection for biometric template protection , 2010, 2010 Fourth IEEE International Conference on Biometrics: Theory, Applications and Systems (BTAS).

[4]  Nalini K. Ratha,et al.  Generating Cancelable Fingerprint Templates , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Jiankun Hu,et al.  Design of Alignment-Free Cancelable Fingerprint Templates with Zoned Minutia Pairs , 2017, Pattern Recognit..

[6]  Munaga V. N. K. Prasad,et al.  k-Nearest Neighborhood Structure (k-NNS) based alignment-free method for fingerprint template protection , 2015, 2015 International Conference on Biometrics (ICB).

[7]  Venu Govindaraju,et al.  Combination of Symmetric Hash Functions for Secure Fingerprint Matching , 2010, 2010 20th International Conference on Pattern Recognition.

[8]  Nalini K. Ratha,et al.  Enhancing security and privacy in biometrics-based authentication systems , 2001, IBM Syst. J..

[9]  Jiankun Hu,et al.  A blind system identification approach to cancelable fingerprint templates , 2016, Pattern Recognit..

[10]  N.K. Ratha,et al.  Generating Registration-free Cancelable Fingerprint Templates , 2008, 2008 IEEE Second International Conference on Biometrics: Theory, Applications and Systems.

[11]  Jiankun Hu,et al.  Attacks via record multiplicity on cancelable biometrics templates , 2014, Concurr. Comput. Pract. Exp..

[12]  Jiankun Hu,et al.  A partial Hadamard transform approach to the design of cancelable fingerprint templates containing binary biometric representations , 2017, Pattern Recognit..

[13]  Jiankun Hu,et al.  Pair-polar coordinate-based cancelable fingerprint templates , 2011, Pattern Recognit..

[14]  Jiankun Hu,et al.  Cancelable Fingerprint Templates with Delaunay Triangle-Based Local Structures , 2013, CSS.

[15]  Zhe Jin,et al.  A non-invertible Randomized Graph-based Hamming Embedding for generating cancelable fingerprint template , 2014, Pattern Recognit. Lett..

[16]  Kannan Karthik,et al.  A robust alignment-free fingerprint hashing algorithm based on minimum distance graphs , 2012, Pattern Recognit..

[17]  Venu Govindaraju,et al.  Symmetric hash functions for secure fingerprint biometric systems , 2007, Pattern Recognit. Lett..

[18]  Andrew Beng Jin Teoh,et al.  Enhanced multi-line code for minutiae-based fingerprint template protection , 2013, Pattern Recognit. Lett..