Improvement to libor masek algorithm of template matching method for iris recognition

S. B. Kulkarni, R. Hegadi, U. Kulkarni
{"title":"Improvement to libor masek algorithm of template matching method for iris recognition","authors":"S. B. Kulkarni, R. Hegadi, U. Kulkarni","doi":"10.1145/1980022.1980303","DOIUrl":null,"url":null,"abstract":"Iris recognition has become a popular research in recent years due to its reliability and nearly perfect recognition rates. Iris recognition system has three main stages: Image preprocessing, Feature extraction and Template matching. In the preprocessing stage, iris segmentation is critical to the success of subsequent feature extraction and template matching stages. Most recent algorithm on template matching proposed by Libor Masek shows an improvement of 3.6 % over existing algorithm like Hamming Distance. This paper addresses for improvement to Libor Masek algorithm of Template matching method for Iris Recognition. The method evaluates on iris images taken from the CASIA iris image database version 1.0 and version 3. Experimental results show that the proposed approach has more efficient than to Libor Masek in terms of Template matching Time of about 99%, Creation of template is of about 10 % and False Rejection Ratio (FRR) is of about 10 %.","PeriodicalId":197580,"journal":{"name":"International Conference & Workshop on Emerging Trends in Technology","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference & Workshop on Emerging Trends in Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1980022.1980303","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Iris recognition has become a popular research in recent years due to its reliability and nearly perfect recognition rates. Iris recognition system has three main stages: Image preprocessing, Feature extraction and Template matching. In the preprocessing stage, iris segmentation is critical to the success of subsequent feature extraction and template matching stages. Most recent algorithm on template matching proposed by Libor Masek shows an improvement of 3.6 % over existing algorithm like Hamming Distance. This paper addresses for improvement to Libor Masek algorithm of Template matching method for Iris Recognition. The method evaluates on iris images taken from the CASIA iris image database version 1.0 and version 3. Experimental results show that the proposed approach has more efficient than to Libor Masek in terms of Template matching Time of about 99%, Creation of template is of about 10 % and False Rejection Ratio (FRR) is of about 10 %.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
虹膜识别模板匹配方法中libor mask算法的改进
虹膜识别以其可靠性和近乎完美的识别率成为近年来研究的热点。虹膜识别系统主要分为三个阶段:图像预处理、特征提取和模板匹配。在预处理阶段,虹膜分割对后续特征提取和模板匹配阶段的成功与否至关重要。Libor Masek最近提出的模板匹配算法比现有的算法(如Hamming Distance)提高了3.6%。本文对虹膜识别模板匹配方法中的Libor Masek算法进行了改进。该方法对从CASIA虹膜图像数据库版本1.0和版本3中获取的虹膜图像进行评估。实验结果表明,该方法的模板匹配时间约为99%,模板生成率约为10%,误拒率(FRR)约为10%,优于Libor Masek方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Receiver based capacity enhancement with cross-layer design approach for IEEE 802.11 ad-hoc networks Heuristics based automatic text summarization of unstructured text Mobi browser with remote video streaming Deblurring of grayscale images using inverse and Wiener filter An optimized approach to voice translation on mobile phones
×
引用
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