The Research Of Fast Iris Localization Algorithm

With an increasing emphasis on security,automated personal identification based on biometrics has been receiving extensive attention over the past decade.Iris recognition,as an emerging biometric recognition approach,is becoming a very active topic in both research and practical applications.It is reported that iris recognition is one of the most reliable biometrics.A great deal of progress in iris recognition has been achieved in the past decade,but many efforts remain to be taken to further improve the performance of iris recognition systems.Iris localization occupies a very important status in iris recognition systems.Fast iris localization algorithm can significantly enhance the speed of iris recognition systems.A modified algorithm of iris localization is proposed in this thesis.First,the center coordinates of the pupil are estimated by projecting the image in the vertical and horizontal direction.And the image edge is detected by a modified Canny operator in the multi-resolution space.Then the radius of internal and external circle is roughly estimated based on the statistics geometric characteristics of the iris image.And the edges of these two circles are extracted from the edge detection image.At last,the exact parameters of two circles are calculated by hill-climbing and Hough Transform in a small certain region.