E-OrbF:鲁棒图像特征匹配算法

Chang Liu, Huan Li
{"title":"E-OrbF:鲁棒图像特征匹配算法","authors":"Chang Liu, Huan Li","doi":"10.1117/12.2671148","DOIUrl":null,"url":null,"abstract":"To improve the real-time performance and robustness of traditional feature matching algorithms, an improved image feature matching algorithm E-OrbF based on ORB and FREAK is proposed. In E-OrbF, the original FAST feature points in ORB algorithm are distributed unevenly and redundant. The strategy of subregion and local threshold is adopted to improve the uniform distribution and stability of feature points. Then simplify the sampling mode of FREAK algorithm and design a new feature descriptor. While improving the matching speed, the sampling point pairs are further filtered to improve the matching accuracy. Finally, combine RANSAC matching algorithm to eliminate mismatches and reduce the rate of mismatches. The experimental results show that the algorithm has good real-time performance, while under the conditions of perspective transformation, rotation scale, complex illumination and blur. Both of them can well complete feature detection and feature matching and improve the robustness of existing methods. The algorithm can be applied to the fusion of virtual and real scenes on mobile terminals, and the average visual frame rate reaches 30 FPS, meeting the real-time requirements.","PeriodicalId":227528,"journal":{"name":"International Conference on Artificial Intelligence and Computer Engineering (ICAICE 2022)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"E-OrbF: a robust image feature matching algorithm\",\"authors\":\"Chang Liu, Huan Li\",\"doi\":\"10.1117/12.2671148\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To improve the real-time performance and robustness of traditional feature matching algorithms, an improved image feature matching algorithm E-OrbF based on ORB and FREAK is proposed. In E-OrbF, the original FAST feature points in ORB algorithm are distributed unevenly and redundant. The strategy of subregion and local threshold is adopted to improve the uniform distribution and stability of feature points. Then simplify the sampling mode of FREAK algorithm and design a new feature descriptor. While improving the matching speed, the sampling point pairs are further filtered to improve the matching accuracy. Finally, combine RANSAC matching algorithm to eliminate mismatches and reduce the rate of mismatches. The experimental results show that the algorithm has good real-time performance, while under the conditions of perspective transformation, rotation scale, complex illumination and blur. Both of them can well complete feature detection and feature matching and improve the robustness of existing methods. The algorithm can be applied to the fusion of virtual and real scenes on mobile terminals, and the average visual frame rate reaches 30 FPS, meeting the real-time requirements.\",\"PeriodicalId\":227528,\"journal\":{\"name\":\"International Conference on Artificial Intelligence and Computer Engineering (ICAICE 2022)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-04-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Artificial Intelligence and Computer Engineering (ICAICE 2022)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.2671148\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Artificial Intelligence and Computer Engineering (ICAICE 2022)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2671148","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了提高传统特征匹配算法的实时性和鲁棒性,提出了一种基于ORB和FREAK的改进图像特征匹配算法E-OrbF。在E-OrbF中,ORB算法中原有的FAST特征点分布不均匀且冗余。采用子区域和局部阈值策略,提高特征点分布的均匀性和稳定性。然后简化了FREAK算法的采样方式,设计了新的特征描述符。在提高匹配速度的同时,进一步对采样点对进行滤波,提高匹配精度。最后结合RANSAC匹配算法消除错配,降低错配率。实验结果表明,该算法在透视变换、旋转尺度、复杂光照和模糊等条件下具有良好的实时性。两者都能很好地完成特征检测和特征匹配,提高了现有方法的鲁棒性。该算法可应用于移动端虚实场景融合,平均视觉帧率达到30 FPS,满足实时性要求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
E-OrbF: a robust image feature matching algorithm
To improve the real-time performance and robustness of traditional feature matching algorithms, an improved image feature matching algorithm E-OrbF based on ORB and FREAK is proposed. In E-OrbF, the original FAST feature points in ORB algorithm are distributed unevenly and redundant. The strategy of subregion and local threshold is adopted to improve the uniform distribution and stability of feature points. Then simplify the sampling mode of FREAK algorithm and design a new feature descriptor. While improving the matching speed, the sampling point pairs are further filtered to improve the matching accuracy. Finally, combine RANSAC matching algorithm to eliminate mismatches and reduce the rate of mismatches. The experimental results show that the algorithm has good real-time performance, while under the conditions of perspective transformation, rotation scale, complex illumination and blur. Both of them can well complete feature detection and feature matching and improve the robustness of existing methods. The algorithm can be applied to the fusion of virtual and real scenes on mobile terminals, and the average visual frame rate reaches 30 FPS, meeting the real-time requirements.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信