{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T03:58:43Z","timestamp":1776916723819,"version":"3.51.2"},"reference-count":30,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[2014,9]]},"abstract":"<jats:p> 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\u2013246; S. Wang and J. Hu, Pattern Recogn.45 (2012) 4129\u20134137; S. Wang and J. Hu, Pattern Recogn.47(3) (2014) 1321\u20131329; Z. Jin, A. B. J. Teoh, T. S. Ong and C. Tee, Expert Syst. Appl.39 (2012) 6157\u20136167; P. Das, K. Karthik and B. C. Garai, Pattern Recogn.45(9) (2012) 3373\u20133388; A. B. J. Teoh, D. C. L. Ngo and A. Goh, Pattern Recogn.37(11) (2004) 2245\u20132255.] <\/jats:p>","DOI":"10.1142\/s0218001414560138","type":"journal-article","created":{"date-parts":[[2014,7,4]],"date-time":"2014-07-04T00:06:34Z","timestamp":1404432394000},"page":"1456013","source":"Crossref","is-referenced-by-count":8,"title":["MINIMUM SPANNING TREE (MST) BASED TECHNIQUES FOR GENERATION OF CANCELABLE FINGERPRINT TEMPLATES"],"prefix":"10.1142","volume":"28","author":[{"given":"MUNAGA V. N. K.","family":"PRASAD","sequence":"first","affiliation":[{"name":"IDRBT, Hyderabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"SWATHI","sequence":"additional","affiliation":[{"name":"IDRBT, Hyderabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. R.","family":"RAO","sequence":"additional","affiliation":[{"name":"School of Computer and Information Sciences, University of Hyderabad, Hyderabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. L.","family":"DEEKSHATULU","sequence":"additional","affiliation":[{"name":"IDRBT, Hyderabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2014,9,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2011.03.015"},{"key":"rf3","doi-asserted-by":"crossref","first-page":"1256008-1","DOI":"10.1142\/S0218001412560083","volume":"26","author":"Bharkad S. D.","year":"2012","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(01)00247-3"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2013.09.001"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2012.02.022"},{"key":"rf10","volume-title":"Matrix Computations","author":"Golub G. H.","year":"1996"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.11.091"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2008.05.003"},{"key":"rf13","volume-title":"Advanced Engineering Mathematics","author":"Kreyszig E.","year":"2006"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2007.896999"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2009.12.011"},{"key":"rf18","doi-asserted-by":"crossref","first-page":"1456002-1","DOI":"10.1142\/S0218001414560023","volume":"28","author":"Lehtihet R.","year":"2014","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"rf19","first-page":"1256001-1","volume":"26","author":"Lei J.","year":"2012","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"rf20","first-page":"1256012-1","volume":"26","author":"Li C. R.","year":"2012","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.3042"},{"key":"rf22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-254-2"},{"key":"rf23","author":"Moon D.","year":"2013","journal-title":"Secur. Commun. Netw."},{"key":"rf25","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"rf26","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1004"},{"key":"rf27","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(03)00080-1"},{"key":"rf28","doi-asserted-by":"publisher","DOI":"10.1147\/sj.403.0614"},{"key":"rf29","doi-asserted-by":"publisher","DOI":"10.4218\/etrij.09.0209.0137"},{"key":"rf31","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2004.04.011"},{"key":"rf32","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1217604"},{"key":"rf34","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2007.08.008"},{"key":"rf35","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2012.05.004"},{"key":"rf36","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2013.10.003"},{"key":"rf37","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2013.03.039"},{"key":"rf38","doi-asserted-by":"publisher","DOI":"10.1007\/s11771-013-1614-8"}],"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218001414560138","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T21:32:04Z","timestamp":1565127124000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218001414560138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":30,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2014,9,21]]},"published-print":{"date-parts":[[2014,9]]}},"alternative-id":["10.1142\/S0218001414560138"],"URL":"https:\/\/doi.org\/10.1142\/s0218001414560138","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"value":"0218-0014","type":"print"},{"value":"1793-6381","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9]]}}}