Algorithm of Fast Iris Recognition Based on Hough Transform
A new fast method is proposed in this paper for iris recognition based on Hough transformation in order to achieve iris identification quickly and precisely.Firstly,iris images are preprocessed,including shrinking the original images several times,making use of the Hough transformation to extract iris rings,and restoring the images.Secondly,2D-Gabor filter is utilized to extracte the iris texture information.Finally,the Hamming distance is used to identify iris.Experiments on 30 iris samples for the fast iris recognition algorithm shows that iris images minification should be 22n (n =1,2,3,…) times; when the iris images mignification is 16 times,the calculating speed and recognition performance can achieve the best balance.A new feasible method for iris recognition is provided in this paper.