基于Starburst模型的瞳孔中心快速定位算法

Yufeng Zhao, Zhiyi Qu, Huiyi Han, Liping Yuan
{"title":"基于Starburst模型的瞳孔中心快速定位算法","authors":"Yufeng Zhao, Zhiyi Qu, Huiyi Han, Liping Yuan","doi":"10.1109/IMCEC.2016.7867358","DOIUrl":null,"url":null,"abstract":"Starburst algorithm that combines feature-based and model-based approaches, can achieve a good tradeoff between run-time performance and accuracy for dark-pupil infrared illumination. On this basis, eye images are preprocessed using AdaBoost classifier to extract region of interest which contains pupil in this paper. Thus, we can ensure that the start point of Starburst model is located within pupil region, reducing the number of iterations of the algorithm. Meanwhile, reflection points are detected and filled effectively, eliminating interference points. At last, high density connected region clustering is used for the non-continuous edge feature points, and the ellipse fitting parameters are optimized to improve the accuracy of the pupil center localization. Finally, the effectiveness and rapidity of the algorithm proposed in this paper is validated through experiments.","PeriodicalId":218222,"journal":{"name":"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"An effective and rapid localization algorithm of pupil center based on Starburst model\",\"authors\":\"Yufeng Zhao, Zhiyi Qu, Huiyi Han, Liping Yuan\",\"doi\":\"10.1109/IMCEC.2016.7867358\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Starburst algorithm that combines feature-based and model-based approaches, can achieve a good tradeoff between run-time performance and accuracy for dark-pupil infrared illumination. On this basis, eye images are preprocessed using AdaBoost classifier to extract region of interest which contains pupil in this paper. Thus, we can ensure that the start point of Starburst model is located within pupil region, reducing the number of iterations of the algorithm. Meanwhile, reflection points are detected and filled effectively, eliminating interference points. At last, high density connected region clustering is used for the non-continuous edge feature points, and the ellipse fitting parameters are optimized to improve the accuracy of the pupil center localization. Finally, the effectiveness and rapidity of the algorithm proposed in this paper is validated through experiments.\",\"PeriodicalId\":218222,\"journal\":{\"name\":\"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IMCEC.2016.7867358\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMCEC.2016.7867358","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

星爆算法结合了基于特征和基于模型的方法,能够很好地平衡暗瞳红外照明的运行时性能和精度。在此基础上,利用AdaBoost分类器对人眼图像进行预处理,提取出包含瞳孔的感兴趣区域。这样可以保证Starburst模型的起始点位于瞳孔区域内,减少了算法的迭代次数。同时,有效地检测和填充反射点,消除了干扰点。最后,对非连续边缘特征点采用高密度连通区域聚类,并对椭圆拟合参数进行优化,提高瞳孔中心定位精度。最后,通过实验验证了本文算法的有效性和快速性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An effective and rapid localization algorithm of pupil center based on Starburst model
Starburst algorithm that combines feature-based and model-based approaches, can achieve a good tradeoff between run-time performance and accuracy for dark-pupil infrared illumination. On this basis, eye images are preprocessed using AdaBoost classifier to extract region of interest which contains pupil in this paper. Thus, we can ensure that the start point of Starburst model is located within pupil region, reducing the number of iterations of the algorithm. Meanwhile, reflection points are detected and filled effectively, eliminating interference points. At last, high density connected region clustering is used for the non-continuous edge feature points, and the ellipse fitting parameters are optimized to improve the accuracy of the pupil center localization. Finally, the effectiveness and rapidity of the algorithm proposed in this paper is validated through experiments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
High performance path following for UAV based on advanced vector field guidance law Design of autonomous underwater vehicle positioning system Temperature field simulation of herringbone grooved bearing based on FLUENT software Docker based overlay network performance evaluation in large scale streaming system Multi-channel automatic calibration system of pressure sensor
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1