Statistical Richness of Visual Phase Information: Update on Recognizing Persons by Iris Patterns
International Journal of Computer Vision
High Confidence Visual Recognition of Persons by a Test of Statistical Independence
IEEE Transactions on Pattern Analysis and Machine Intelligence
A New Iris Segmentation Method for Recognition
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 3 - Volume 03
Image understanding for iris biometrics: A survey
Computer Vision and Image Understanding
A survey of biometric technology based on hand shape
Pattern Recognition
A novel biorthogonal wavelet network system for off-angle iris recognition
Pattern Recognition
Comparison and combination of iris matchers for reliable personal authentication
Pattern Recognition
Iris image segmentation and sub-optimal images
Image and Vision Computing
Efficient and robust segmentation of noisy iris images for non-cooperative iris recognition
Image and Vision Computing
Noisy iris segmentation with boundary regularization and reflections removal
Image and Vision Computing
Iris recognition using fourier-wavelet features
AVBPA'05 Proceedings of the 5th international conference on Audio- and Video-Based Biometric Person Authentication
A human identification technique using images of the iris andwavelet transform
IEEE Transactions on Signal Processing
Efficient iris recognition by characterizing key local variations
IEEE Transactions on Image Processing
IEEE Transactions on Circuits and Systems for Video Technology
Iris recognition using consistent corner optical flow
ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part I
| Hi-index | 0.00 |
In this paper, we present a new method for iris recognition based on elastic graph matching and Gabor wavelets. We have used the circular Hough transform to determine the iris boundaries. Individual segmented irises are represented as labeled graphs. Nodes are labeled with jets; edges are labeled with distance vectors. A similarity function is defined to compare two graphs, taking into account the similarities of individual jets and the relative distortion of the graphs. For matching and recognition, only jets referring to corresponding points are compared. Recognition results are given for galleries of irises from CASIA version 1 and UBIRIS databases. The numerical results show that, the elastic graph matching is a effective technique for iris matching process. We also compare our results with previous results and find out that, the elastic graph matching is an effective matching performance.