This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Improved Iris Recognition through Fusion of Hamming Distance and Fragile Bit Distance
December 2011 (vol. 33 no. 12)
pp. 2465-2476
P. J. Flynn, Comput. Sci. & Eng. Dept., Univ. of Notre Dame, Notre Dame, IN, USA
K. W. Bowyer, Comput. Sci. & Eng. Dept., Univ. of Notre Dame, Notre Dame, IN, USA
K. P. Hollingsworth, Comput. Sci. & Eng. Dept., Univ. of Notre Dame, Notre Dame, IN, USA
The most common iris biometric algorithm represents the texture of an iris using a binary iris code. Not all bits in an iris code are equally consistent. A bit is deemed fragile if its value changes across iris codes created from different images of the same iris. Previous research has shown that iris recognition performance can be improved by masking these fragile bits. Rather than ignoring fragile bits completely, we consider what beneficial information can be obtained from the fragile bits. We find that the locations of fragile bits tend to be consistent across different iris codes of the same eye. We present a metric, called the fragile bit distance, which quantitatively measures the coincidence of the fragile bit patterns in two iris codes. We find that score fusion of fragile bit distance and Hamming distance works better for recognition than Hamming distance alone. To our knowledge, this is the first and only work to use the coincidence of fragile bit locations to improve the accuracy of matches.

[1] K.P. Hollingsworth, K.W. Bowyer, and P.J. Flynn, "Using Fragile Bit Coincidence to Improve Iris Recognition," Proc. IEEE Third Int'l Conf. Biometrics: Theory, Applications, and Systems, pp. 1-6, Sept. 2009.
[2] J. Daugman, "How Iris Recognition Works," IEEE Trans. Circuits and Systems for Video Technology, vol. 14, no. 1, pp. 21-30, Jan. 2004.
[3] J. Daugman, "Probing the Uniqueness and Randomness of Iriscodes: Results from 200 Billion Iris Pair Comparisons," Proc. IEEE, vol. 94, no. 11, pp. 1927-1935, Nov. 2006.
[4] K.W. Bowyer, K.P. Hollingsworth, and P.J. Flynn, "Image Understanding for Iris Biometrics: A Survey," Computer Vision and Image Understanding, vol. 110, no. 2, pp. 281-307, 2008.
[5] R.M. Bolle, S. Pankanti, J.H. Connell, and N. Ratha, "Iris Individuality: A Partial Iris Model," Proc. Int'l Conf. Pattern Recognition, pp. 927-930, 2004.
[6] K.P. Hollingsworth, K.W. Bowyer, and P.J. Flynn, "All Iris Code Bits Are Not Created Equal," Proc. IEEE Int'l Conf. Biometrics: Theory, Applications, and Systems, pp. 1-6, Sept. 2007.
[7] K.P. Hollingsworth, K.W. Bowyer, and P.J. Flynn, "The Best Bits in an Iris Code," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 31, no. 6, pp. 964-973, June 2009.
[8] N. Barzegar and M.S. Moin, "A New User Dependent Iris Recognition System Based on an Area Preserving Pointwise Level Set Segmentation Approach," EURASIP J. Advances in Signal Processing, vol. 2009, pp. 1-13, 2009.
[9] G. Dozier, D. Bell, L. Barnes, and K. Bryant, "Refining Iris Templates via Weighted Bit Consistency," Proc. Midwest Artificial Intelligence and Cognitive Science Conf., pp. 1-5, Apr. 2009.
[10] G. Dozier, K. Frederiksen, R. Meeks, M. Savvides, K. Bryant, D. Hopes, and T. Munemoto, "Minimizing the Number of Bits Needed for Iris Recognition via Bit Inconsistency and Grit," Proc. IEEE Workshop Computational Intelligence in Biometrics: Theory, Algorithms, and Applications, pp. 30-37, Apr. 2009.
[11] J. Daugman, personal comm.
[12] T. Boult, "Robust Distance Measures for Face-Recognition Supporting Revocable Biometric Tokens," Proc. IEEE Conf. Automatic Face and Gesture Recognition, pp. 560-566, Apr. 2006.
[13] A. Ross and R. Govindarajan, "Feature Level Fusion Using Hand and Face Biometrics," Proc. SPIE Conf. Biometric Technology for Human Identification II, pp. 196-204, Mar. 2005.
[14] F. Hao, J. Daugman, and P. Zielinski, "A Fast Search Algorithm for a Large Fuzzy Database," IEEE Trans. Information Forensics and Security, vol. 3, no. 2, pp. 203-212, June 2008.
[15] R. Mukherjee and A. Ross, "Indexing Iris Images," Proc. Int'l Conf. Pattern Recognition, pp. 1-4, Dec. 2008.
[16] J. Gentile, N. Ratha, and J. Connell, "SLIC: Short-Length Iris Codes," Proc. IEEE Third Int'l Conf. Biometrics: Theory, Applications, and Systems, pp. 1-5, Sept. 2009.
[17] Z. Sun, T. Tan, and X. Qiu, "Graph Matching Iris Image Blocks with Local Binary Pattern," Proc. Int'l Conf. Biometrics, pp. 366-372, Jan. 2006.
[18] M. Vatsa, R. Singh, and A. Noore, "Reducing the False Rejection Rate of Iris Recognition Using Textural and Topological Features," Int'l J. Signal Processing, vol. 2, no. 2, pp. 66-72, 2005.
[19] P.-F. Zhang, D.-S. Li, and Q. Wang, "A Novel Iris Recognition Method Based on Feature Fusion," Proc. Int'l Conf. Machine Learning and Cybernetics, pp. 3661-3665, 2004.
[20] C.-H. Park and J.-J. Lee, "Extracting and Combining Multimodal Directional Iris Features," Proc. Int'l Conf. Biometrics, pp. 389-396, Jan. 2006.
[21] A.W.K. Kong, D. Zhang, and M.S. Kamel, "An Analysis of Iriscode," IEEE Trans. Image Processing, vol. 19, no. 2, pp. 522-532, Feb. 2010.
[22] LG IrisAccess 4000, http://www.lgiris.com/ps/products irisaccess4000.htm , accessed, Apr. 2009.
[23] P.J. Phillips, K.W. Bowyer, P.J. Flynn, X. Liu, and W.T. Scruggs, "The Iris Challenge Evaluation 2005," Proc. IEEE Int'l Conf. Biometrics: Theory, Applications, and Systems, Sept. 2008.
[24] L. Masek, "Recognition of Human Iris Patterns for Biometric Identification," master's thesis, Univ. of Western Australia, http://www.csse.uwa.edu.au/~pk/studentprojects libor/, 2003.
[25] T. Peters, "Effects of Segmentation Routine and Acquisition Environment on Iris Recognition," master's thesis, Univ. of Notre Dame, 2009.

Index Terms:
Iris recognition,Hamming distance,Biometrics,Cameras,score fusion.,Iris biometrics,fragile bits
Citation:
P. J. Flynn, K. W. Bowyer, K. P. Hollingsworth, "Improved Iris Recognition through Fusion of Hamming Distance and Fragile Bit Distance," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33, no. 12, pp. 2465-2476, Dec. 2011, doi:10.1109/TPAMI.2011.89
Usage of this product signifies your acceptance of the Terms of Use.