Robust iris indexing scheme using geometric hashing of SIFT keypoints

Authors:
Hunny Mehrotra;Banshidhar Majhi;Phalguni Gupta
Affiliations:
Department of Computer Science and Engineering, National Institute of Technology Rourkela, Rourkela 769008, India;Department of Computer Science and Engineering, National Institute of Technology Rourkela, Rourkela 769008, India;Department of Computer Science and Engineering, Indian Institute of Technology Kanpur, Kanpur 208016, India
Venue:
Journal of Network and Computer Applications
Year:
2010

Citing 14
Cited 7

Finding circles by an array of accumulators

Communications of the ACM
Geometric Hashing: An Overview

IEEE Computational Science & Engineering
Fingerprint Matching Using Transformation Parameter Clustering

IEEE Computational Science & Engineering
High Confidence Visual Recognition of Persons by a Test of Statistical Independence

IEEE Transactions on Pattern Analysis and Machine Intelligence
Distinctive Image Features from Scale-Invariant Keypoints

International Journal of Computer Vision
On the Use of SIFT Features for Face Authentication

CVPRW '06 Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop
DCT-Based Iris Recognition

IEEE Transactions on Pattern Analysis and Machine Intelligence
Handbook of Biometrics

Handbook of Biometrics
Image understanding for iris biometrics: A survey

Computer Vision and Image Understanding
A highly accurate and computationally efficient approach for unconstrained iris segmentation

Image and Vision Computing
Predicting large population data cumulative match characteristic performance from small population data

AVBPA'03 Proceedings of the 4th international conference on Audio- and video-based biometric person authentication
Indexing biometric databases using pyramid technique

AVBPA'05 Proceedings of the 5th international conference on Audio- and Video-Based Biometric Person Authentication
UBIRIS: a noisy iris image database

ICIAP'05 Proceedings of the 13th international conference on Image Analysis and Processing
A human identification technique using images of the iris andwavelet transform

IEEE Transactions on Signal Processing

Coarse indexing of iris database based on iris colour

International Journal of Biometrics
An efficient color and texture based iris image retrieval technique

Expert Systems with Applications: An International Journal
Creating a virtual slide map from sputum smear images for region-of-interest localisation in automated microscopy

Computer Methods and Programs in Biomedicine
An efficient indexing scheme for iris biometric using k-d-b trees

ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories and Technology
Local feature based retrieval approach for iris biometrics

Frontiers of Computer Science: Selected Publications from Chinese Universities
Parallel geometric hashing for robust iris indexing

Journal of Real-Time Image Processing
Score level fusion of voting strategy of geometric hashing and SURF for an efficient palmprint-based identification

Journal of Real-Time Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes an efficient indexing scheme for searching large iris biometric database that achieves invariance to similarity transformations, illumination and occlusion. The proposed scheme considers local descriptors as well as relative spatial configuration for claiming identity. To overcome the effect of non-uniform illumination and partial occlusion due to eyelids, local features are extracted from noise independent annular iris image using scale invariant feature transform (SIFT). The detected keypoints are used to index iris database by applying geometric hashing scheme that is robust to similarity transformations as well as occlusion. During iris retrieval, geometric hashed location from query iris image is obtained to access the appropriate bin of hash table and for every entry found there, a vote is casted. The iris images that receive more than certain number of votes are considered as possible candidates. In order to find the potential matches, the keypoint descriptor of the list of possible candidates is matched with the query iris. Since only small portion of database is scanned to find a match it reduces the query retrieval time and improves accuracy. This approach is tested on UBIRIS, BATH, CASIA and IITK iris databases and shows a substantial improvement over exhaustive search technique in terms of time and accuracy.