A Fast Iris Localization Algorithm B ased 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.lris Iocalization includes the inner boundary localization (the contour between pupil and iris)and the outer boundary Iocalization fthe contour between iris and sclera).Our algorithm use difierent method to improve the two boundary localization according to different characteristic of the two.Experimental data shows good performance of our algorithm.
hough transform iris localization morphologic opening
Qin Huang Xiaofeng Gu Jianping Li Jianming Liao Huamin Liu
国际会议
The International Conference Information Computing and Automation(2007国际信息计算与自动化会议)
成都
英文
256-258
2007-12-19（万方平台首次上网日期，不代表论文的发表时间）