Minimum Spanning Tree (MST) Based Techniques for Generation of Cancelable Fingerprint Templates

The biometric community is faced with the difficult problem of protection of the original biometric template. One way of doing this is using a cancelable biometric method, which transforms original biometric template in a noninvertible way and uses the transformed template to verify a person's identity. In this paper, we propose two novel representation methods for fingerprint minutiae. Proposed methods based on this representation are simple to generate cancelable templates without requiring pre-alignment of the fingerprints. The main idea is to generate a minimal spanning tree (MST) for fingerprint minutiae in a three-dimensional (3D) feature space. The chain code representation for a generated MST in a two-dimensional (2D) feature space is proposed. A bit string is then generated by mapping the chain code into 2D array. The fingerprint minutiae based upon the Cartesian system is dealt with in Method-1, while the boundary representation of the minutiae is dealt with in Method-2. The proposed methods are evaluated using FVC2004 and FVC2002 databases and the performance is better compared to existing methods [C. Lee and J. Kim, J. Netw. Comput. Appl.33(3) (2010) 236–246; S. Wang and J. Hu, Pattern Recogn.45 (2012) 4129–4137; S. Wang and J. Hu, Pattern Recogn.47(3) (2014) 1321–1329; Z. Jin, A. B. J. Teoh, T. S. Ong and C. Tee, Expert Syst. Appl.39 (2012) 6157–6167; P. Das, K. Karthik and B. C. Garai, Pattern Recogn.45(9) (2012) 3373–3388; A. B. J. Teoh, D. C. L. Ngo and A. Goh, Pattern Recogn.37(11) (2004) 2245–2255.]

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

[2]  Andrew Beng Jin Teoh,et al.  Integrated biometrics template protection technique based on fingerprint and palmprint feature-level fusion , 2014, Inf. Fusion.

[3]  Manesh Kokare,et al.  Rotated Wavelet filters-Based Fingerprint Recognition , 2012, Int. J. Pattern Recognit. Artif. Intell..

[4]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

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

[6]  Pauli Kuosmanen,et al.  Fingerprint Matching Using an Orientation-Based Minutia Descriptor , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Chulhan Lee,et al.  Alignment-Free Cancelable Fingerprint Templates Based on Local Minutiae Information , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[8]  Daesung Moon,et al.  Dictionary Attack on Functional Transform‐Based Cancelable Fingerprint Templates , 2009 .

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

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

[11]  Mou Ling Dennis Wong,et al.  Multi-line code: A low complexity revocable fingerprint template for cancelable biometrics , 2013 .

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

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

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

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

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

[17]  Kenta Takahashi,et al.  Generating provably secure cancelable fingerprint templates based on correlation-invariant random filtering , 2009, 2009 IEEE 3rd International Conference on Biometrics: Theory, Applications, and Systems.

[18]  Robert P. W. Duin,et al.  Minimum spanning tree based one-class classifier , 2009, Neurocomputing.

[19]  Raja Lehtihet,et al.  Ridge frequency estimation for Low-Quality Fingerprint Images enhancement using Delaunay Triangulation , 2014, Int. J. Pattern Recognit. Artif. Intell..

[20]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[21]  F. W. Kellaway,et al.  Advanced Engineering Mathematics , 1969, The Mathematical Gazette.

[22]  Chulhan Lee,et al.  Cancelable fingerprint templates using minutiae-based bit-strings , 2010, J. Netw. Comput. Appl..

[23]  Jiankun Hu,et al.  Design of alignment-free cancelable fingerprint templates via curtailed circular convolution , 2014, Pattern Recognit..

[24]  Nalini K. Ratha,et al.  Biometrics break-ins and band-aids , 2003, Pattern Recognit. Lett..

[25]  Andrew Beng Jin Teoh,et al.  Biohashing: two factor authentication featuring fingerprint data and tokenised random number , 2004, Pattern Recognit..

[26]  Nalini K. Ratha,et al.  Biometric perils and patches , 2002, Pattern Recognit..