A fast iris localization algorithm based on hough transformation

In this paper, we propose a fast and robust iris localization algorithm based Hough transform. We make a contrast with the algorithm proposed by Wildes, which is also based on Hough transform and has representative. The wildes algorithm is proved has high accuracy but it's time consuming, thus it's not has good real-time performance. Our algorithm preserves the high accuracy characteristic and makes a great improve in executing efficiency. Iris localization includes the inner boundary localization (the contour between pupil and iris) and the outer boundary localization (the contour between iris and sclera). Our algorithm use different method to improve the two boundary localization according to different characteristic of the two. Experimental data shows good performance of our algorithm.