An Improved Least Trimmed Square Hausdorff Distance Finger Vein Recognition

Guanghua Chen, Qinghua Dai, Xiao Tang, Zihao Xu
{"title":"An Improved Least Trimmed Square Hausdorff Distance Finger Vein Recognition","authors":"Guanghua Chen, Qinghua Dai, Xiao Tang, Zihao Xu","doi":"10.1109/ICSAI.2018.8599439","DOIUrl":null,"url":null,"abstract":"In order to solve the problem of poor accuracy and matching speed in finger vein recognition, an improved Least Trimmed Square Hausdorff Distance (LTS-HD) finger vein recognition based on weighted matching point algorithm is proposed in this paper. The incremental neighborhood search method is used to achieve matching acceleration for Least Trimmed Square Hausdorff Distance algorithm firstly, and the optimal matching weights for different types of matching points is searched by Particle Swarm Optimization, at the same time, the particle box exclusion mechanism is applied to avoid premature convergence so as to achieve global particle optimization. On this basis, the directional matching points which can effectively characterize the vein pattern information are extracted, and the optimal weights of vein matching point is calculated after introducing the weights and model optimization. At last, the improved Least Trimmed Square Hausdorff Distance algorithm is used to achieve finger vein recognition by introducing the optimal weights. Compared with other algorithms, the results show that the proposed algorithm has a significant improvement in the objective indicators such as matching speed and accuracy.","PeriodicalId":375852,"journal":{"name":"2018 5th International Conference on Systems and Informatics (ICSAI)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 5th International Conference on Systems and Informatics (ICSAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSAI.2018.8599439","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In order to solve the problem of poor accuracy and matching speed in finger vein recognition, an improved Least Trimmed Square Hausdorff Distance (LTS-HD) finger vein recognition based on weighted matching point algorithm is proposed in this paper. The incremental neighborhood search method is used to achieve matching acceleration for Least Trimmed Square Hausdorff Distance algorithm firstly, and the optimal matching weights for different types of matching points is searched by Particle Swarm Optimization, at the same time, the particle box exclusion mechanism is applied to avoid premature convergence so as to achieve global particle optimization. On this basis, the directional matching points which can effectively characterize the vein pattern information are extracted, and the optimal weights of vein matching point is calculated after introducing the weights and model optimization. At last, the improved Least Trimmed Square Hausdorff Distance algorithm is used to achieve finger vein recognition by introducing the optimal weights. Compared with other algorithms, the results show that the proposed algorithm has a significant improvement in the objective indicators such as matching speed and accuracy.
改进的最小裁剪正方形Hausdorff距离手指静脉识别
针对手指静脉识别精度差、匹配速度慢的问题,提出了一种改进的基于加权匹配点算法的最小裁剪平方豪斯多夫距离(LTS-HD)手指静脉识别方法。首先采用增量邻域搜索法实现最小二乘Hausdorff距离算法的匹配加速,然后采用粒子群算法搜索不同类型匹配点的最优匹配权值,同时采用粒子盒排斥机制避免过早收敛,实现全局粒子优化。在此基础上,提取出能够有效表征脉网信息的方向匹配点,并引入权值和模型优化,计算出脉网匹配点的最优权值。最后,通过引入最优权值,采用改进的最小裁剪平方豪斯多夫距离算法实现手指静脉识别。结果表明,与其他算法相比,本文算法在匹配速度和匹配精度等客观指标上有显著提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信