Iris recognition using Dynamic Programming Matching Pursuit

In this paper, we propose a new method named dynamic programming based matching pursuit algorithm for iris-based personal identification. Based on the matching pursuit algorithm, it selects the most representative path to do iris recognition. Our system consists of identification and verification. Finally, we use the experimental results to demonstrate the efficacy of the proposed method and show that it attains a better ROC curve and faster speed than the conventional matching pursuit based iris recognition system.

[1]  Dexin Zhang,et al.  Efficient iris recognition by characterizing key local variations , 2004, IEEE Transactions on Image Processing.

[2]  John Daugman,et al.  High Confidence Visual Recognition of Persons by a Test of Statistical Independence , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Dexin Zhang,et al.  Personal Identification Based on Iris Texture Analysis , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Avideh Zakhor,et al.  Very low bit-rate video coding based on matching pursuits , 1997, IEEE Trans. Circuits Syst. Video Technol..

[5]  Tieniu Tan,et al.  Improving iris recognition accuracy via cascaded classifiers , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).