Abstract
This paper proposes an efficient retrieval approach for iris using local features. The features are extracted from segmented iris image using scale invariant feature transform (SIFT). The keypoint descriptors extracted from SIFT are clustered into m groups using k-means. The idea is to perform indexing of keypoints based on descriptor property. During database indexing phase, k-d tree k-dimensional tree is constructed for each cluster center taken from N iris images. Thus for m clusters, m such k-d trees are generated denoted as t i , where 1 ⩽ i ⩽ m. During the retrieval phase, the keypoint descriptors from probe iris image are clustered into m groups and ith cluster center is used to traverse corresponding t i for searching. k nearest neighbor approach is used, which finds p neighbors from each tree (t i ) that falls within certain radius r centered on the probe point in k-dimensional space. Finally, p neighbors from m trees are combined using union operation and top S matches (S ⊆ (m× p)) corresponding to query iris image are retrieved. The proposed approach has been tested on publicly available databases and outperforms the existing approaches in terms of speed and accuracy.
Similar content being viewed by others
References
Daugman J. The importance of being random: statistical principles of iris recognition. Pattern Recognition, 2003, 36(2): 279–291
Daugman J. How iris recognition works. IEEE Transactions on Circuits and Systems for Video Technology, 2004, 14(1): 21–30
Li S Z, Jain A K, eds. Encyclopedia of Biometrics. Springer US, 2009
Unique Identification Authority of India. http://uidai.gov.in/
Iris Recognition Immigration System (IRIS). http://www.ukba.homeof-fice.gov.uk/travellingtotheuk/Enteringtheuk/usingiris/
Mhatre A, Chikkerur S, Govindaraju V. Indexing biometric databases using pyramid technique. In: Proceedings of the 5th International Conference on Audio-and Video-Based Biometric Person Authentication. 2005, 841–849
Yu L, Zhang D, Wang K, Yang W. Coarse iris classification using boxcounting to estimate fractal dimensions. Pattern Recognition, 2005, 38(11): 1791–1798
Qiu X, Sun Z, Tan T. Global texture analysis of iris images for ethnic classification. In: Advances in Biometrics. 2005, 411–418
Qiu X, Sun Z, Tan T. Coarse iris classification by learned visual dictionary. In: Proceedings of the 2007 International Conference on Advances in Biometrics. 2007, 770–779
Gyaourova A, Ross A. Index codes for multibiometric pattern retrieval. IEEE Transactions on Information Forensics and Security, 2012, 7(2): 518–529
Mhatre A, Palla S, Chikkerur S, Govindaraju V. Efficient search and retrieval in biometric databases. In: Proceedings of Society of Photo-Optical Instrumentation Engineers (SPIE) Conference Series. 2005, 265–273
Jayaraman U, Prakash S, Gupta P. Indexing multimodal biometric databases using Kd-tree with feature level fusion. In: Proceedings of the 4th International Conference on Information Systems Security. 2008, 221–234
Jayaraman U, Prakash S, Gupta P. Use of geometric features of princi pal components for indexing a biometric database. Mathematical and Computer Modelling, 2012 (in press)
Munoz-Briseno A, Gago-Alonso A, Hernandez-Palancar J. Fingerprint indexing with bad quality areas. Expert Systems with Applications, 2013, 40(5): 1839–1846
Feng H, Daugman J, Zielinski P. A fast search algorithm for a large fuzzy database. IEEE Transactions on Information Forensics and Security, 2008, 3(2): 203–212
Mukherjee R, Ross A. Indexing iris images. In: Proceedings of the 19th International Conference on Pattern Recognition. 2008, 1–4
Puhan N, Sudha N. A novel iris database indexing method using the iris color. In: Proceedings of the 3rd IEEE Conference on Industrial Electronics and Applications. 2008, 1886–1891
Mehrotra H, Srinivas B, Majhi B, Gupta P. Indexing iris biometric database using energy histogram of DCT subbands. In: Proceedings of the 2009 International Conference on Contemporary Computing. 2009, 194–204
Gadde R, Adjeroh D, Ross A. Indexing iris images using the Burrows-Wheeler Transform. In: Proceedings of the 2010 IEEE International Workshop on Information Forensics and Security. 2010, 1–6
Rathgeb C, Uhl A. Iris-biometric hash generation for biometric database indexing. In: Proceedings of the 2010 International Conference on Pattern Recognition. 2010, 2848–2851
Dey S, Samanta D. Iris data indexing method using gabor energy features. IEEE Transactions on Information Forensics and Security, 2012, 7(4): 1192–1203
Mehrotra H, Majhi B, Gupta P. Robust iris indexing scheme using geometric hashing of SIFT keypoints. Journal of Network and Computer Applications, 2010, 33(3): 300–313
Wolfson H, Rigoutsos I. Geometric hashing: an overview. IEEE Computational Science Engineering, 1997, 4(4): 10–21
Lowe D. Distinctive image features from scale-invariant keypoints. International Journal of Computer Vision, 2004, 60(2): 91–110
Jayaraman U, Prakash S, Gupta P. An efficient color and texture based iris image retrieval technique. Expert Systems with Applications, 2012, 39(5): 4915–4926
Bay H, Ess A, Tuytelaars T, Van Gool L. Speeded-up robust features (SURF). Computer Vision and Image Understanding, 2008, 110(3): 346–359
Bowyer K, Hollingsworth K, Flynn P. Image understanding for iris biometrics: A survey. Computer Vision and Image Understanding, 2008, 110: 281–307
Proenca H, Alexandre L. Iris recognition: An analysis of the aliasing problem in the iris normalization stage. In: Proceedings of the 2006 International Conference on Computational Intelligence and Security. 2006, 1771–1774
Panda A, Mehrotra H, Majhi B. Parallel geometric hashing for robust iris indexing. Journal of Real-Time Image Processing, 2011, 1-9
Bakshi S, Mehrotra H, Majhi B. Real-time iris segmentation based on image morphology. In: Proceedings of the 2011 International Conference on Communication, Computing & Security. 2011, 335–338
Bentley J. Multidimensional binary search trees used for associative searching. Communications of the ACM, 1975, 18(9): 509–517
Friedman J H, Bentley J L, Finkel R A. An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software, 1977, 3: 209–226
Blum M, Floyd R, Pratt V, Rivest R, Tarjan R. Time bounds for selection. Journal of Computer and System Sciences, 1973, 7(4): 448–461
BATH University Database. http://www.bath.ac.uk/elec-eng/research/sipg/irisweb
CASIA Database. http://www.cbsr.ia.ac.cn/english/Databases.asp
Jain A, Flynn P, Ross A A. Handbook of Biometrics. Springer-Verlag New York, Inc., 2007
Wayman J L. Error rate equations for the general biometric system. IEEE Robotics and Automation Magazine, 1999, 6(1): 35–48
Author information
Authors and Affiliations
Corresponding author
Additional information
Hunny Mehrotra is presently pursuing PhD from Department of Computer Science and Engineering, National Institute of Technology Rourkela, India. She has published more then 30 papers in refereed international conferences and journals. Her area of research includes biometrics, image processing, and computer vision. She has been conferred with various prestigious awards like Google India women in engineering award in 2010, innovative student project award in 2010 by INAE, and fellowship from DST under women scientist scheme in 2012.
Banshidhar Majhi is a professor in Department of Computer Science and Engineering, National Institute of Technology Rourkela, India since 2006. He has 20 years of teaching and research experience. He has published several articles in refereed journals and international conferences. He has worked on several government funded projects. His area of interest includes data structures, image processing, cryptography, biometrics, parallel processing, and soft computing.
Rights and permissions
About this article
Cite this article
Mehrotra, H., Majhi, B. Local feature based retrieval approach for iris biometrics. Front. Comput. Sci. 7, 767–781 (2013). https://doi.org/10.1007/s11704-013-3073-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11704-013-3073-7