MINIMUM SPANNING TREE (MST) BASED TECHNIQUES FOR GENERATION OF CANCELABLE FINGERPRINT TEMPLATES
作者： MUNAGA V. N. K. PRASAD , P. SWATHI , C. R. RAO , B. L. DEEKSHATULU
DOI: 10.1142/S0218001414560138
关键词:
摘要: The biometric community is faced with the difficult problem of protection original template. One way doing this using a cancelable method, which transforms template in noninvertible and uses transformed to verify person's identity. In paper, we propose two novel representation methods for fingerprint minutiae. Proposed based on are simple generate templates without requiring pre-alignment fingerprints. main idea minimal spanning tree (MST) minutiae three-dimensional (3D) feature space. chain code generated MST two-dimensional (2D) space proposed. A bit string then by mapping into 2D array. upon Cartesian system dealt Method-1, while boundary Method-2. proposed evaluated FVC2004 FVC2002 databases performance better compared existing [C. Lee J. Kim, Netw. Comput. Appl.33(3) (2010) 236–246; S. Wang Hu, Pattern Recogn.45 (2012) 4129–4137; Recogn.47(3) (2014) 1321–1329; Z. Jin, A. B. Teoh, T. Ong C. Tee, Expert Syst. Appl.39 6157–6167; P. Das, K. Karthik Garai, Recogn.45(9) 3373–3388; D. L. Ngo Goh, Recogn.37(11) (2004) 2245–2255.]
sci-hub.se 参考文章(26)
Joseph B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem Proceedings of the American Mathematical Society. ,vol. 7, pp. 48- 50 ,(1956) , 10.1090/S0002-9939-1956-0078686-7
Kenta Takahashi, Shinji Hirata Hitachi, Generating provably secure cancelable fingerprint templates based on correlation-invariant random filtering international conference on biometrics theory applications and systems. pp. 327- 332 ,(2009) , 10.1109/BTAS.2009.5339047
Chulhan Lee, Jaihie Kim, Cancelable fingerprint templates using minutiae-based bit-strings Journal of Network and Computer Applications. ,vol. 33, pp. 236- 246 ,(2010) , 10.1016/J.JNCA.2009.12.011
Wei Jing Wong, Andrew B.J. Teoh, M.L. Dennis Wong, Yau Hee Kho, Enhanced multi-line code for minutiae-based fingerprint template protection Pattern Recognition Letters. ,vol. 34, pp. 1221- 1229 ,(2013) , 10.1016/J.PATREC.2013.03.039
Piotr Juszczak, David M.J. Tax, Elżbieta Pe¸kalska, Robert P.W. Duin, Minimum spanning tree based one-class classifier Neurocomputing. ,vol. 72, pp. 1859- 1869 ,(2009) , 10.1016/J.NEUCOM.2008.05.003
Sang Wook Shin, Mun-Kyu Lee, Daesung Moon, Kiyoung Moon, Dictionary Attack on Functional Transform-Based Cancelable Fingerprint Templates Etri Journal. ,vol. 31, pp. 628- 630 ,(2009) , 10.4218/ETRIJ.09.0209.0137
Ruud M. Bolle, Jonathan H. Connell, Nalini K. Ratha, Biometric perils and patches Pattern Recognition. ,vol. 35, pp. 2727- 2738 ,(2002) , 10.1016/S0031-3203(01)00247-3
R. C. Prim, Shortest Connection Networks And Some Generalizations Bell System Technical Journal. ,vol. 36, pp. 1389- 1401 ,(1957) , 10.1002/J.1538-7305.1957.TB01515.X
SANGITA D. BHARKAD, MANESH KOKARE, ROTATED WAVELET FILTERS-BASED FINGERPRINT RECOGNITION International Journal of Pattern Recognition and Artificial Intelligence. ,vol. 26, pp. 1256008- ,(2012) , 10.1142/S0218001412560083
Song Wang, Jiankun Hu, Alignment-free cancelable fingerprint template design: A densely infinite-to-one mapping (DITOM) approach Pattern Recognition. ,vol. 45, pp. 4129- 4137 ,(2012) , 10.1016/J.PATCOG.2012.05.004