首页 | 本学科首页   官方微博 | 高级检索  
     

改进的快速虹膜定位算法
引用本文:骆名猛,吴锡生.改进的快速虹膜定位算法[J].计算机工程与应用,2010,46(17):200-203.
作者姓名:骆名猛  吴锡生
作者单位:江南大学 信息工程学院,江苏 无锡 214122
摘    要:针对虹膜的灰度分布特点,提出了一种粗定位和精定位相结合的虹膜定位算法。首先,通过k-mans聚类算法对图像进行动态阈值分割,分离出瞳孔区域,利用圆的几何特性进行粗定位;然后运用Gauss滤波降低噪声干扰和Canny算子进行边缘检测,结合粗定位的结果,应用Hough变换进行精定位,以快速提取虹膜内外边缘。实验表明,该方法能准确快速地定位虹膜的边界以满足实时性要求。

关 键 词:虹膜定位  Hough变换  灰度投影  k-means聚类  
收稿时间:2008-11-26
修稿时间:2009-2-23  

Improved fast iris localization algorithm
LUO Ming-meng,WU Xi-sheng.Improved fast iris localization algorithm[J].Computer Engineering and Applications,2010,46(17):200-203.
Authors:LUO Ming-meng  WU Xi-sheng
Affiliation:School of Information Technology,Jiangnan University,Wuxi,Jiangsu 214122,China
Abstract:A two-step iris localization approach from coarse to fine is presented according to the distribution of the iris's gray scale.After the iris image is segmented through the k-means clustering algorithm for threshold,the pupil region is isolated and the border of the pupil is located coarsely by using the geometric properties of the circle.Then Gauss filtering is used to reduce noise and Canny operator is used to detect inside and outside border.The result of rough localization is combined to reduce the blindness of search process,so both pupil border and iris border are extracted fast through Hough transform.Experiments show that this method can extract the boundary precisely and quickly,to meet the requirements of real-time.
Keywords:iris localization  Hough transform  gray projection  k-means clustering
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号