An Improved ORB Algorithm of Extracting Features Based on Local Region Adaptive Threshold

Kun Yang, Dan Yin, Jian Zhang, Hua Xiao, Kaiqing Luo
{"title":"An Improved ORB Algorithm of Extracting Features Based on Local Region Adaptive Threshold","authors":"Kun Yang, Dan Yin, Jian Zhang, Hua Xiao, Kaiqing Luo","doi":"10.1109/ICSAI48974.2019.9010209","DOIUrl":null,"url":null,"abstract":"For the features extraction of image, an improved Oriented FAST and Rotated BRIEF (ORB) algorithm of extracting features based on local region adaptive threshold is proposed, which not only can it solve the problem that the traditional ORB feature extraction algorithm cannot adapt to the local brightness change of the image, but also solve the phenomenon that the extracted feature points exist clusters. Firstly, extracting local region adaptive threshold features on each pyramid image based on constructed an image pyramid. Then, the feature points are divided by the quad-tree algorithm and the direction and the descriptor of the feature points are calculated. After that, the Fast Library for Approximate Nearest Neighbors (FLANN) is used to the match feature points, the mismatch points are eliminated by Lowe's algorithm and rotation consistency. Finally, using the Random sample consensus (RANSAC) to get the fine matching image. The method proposed in this paper is carried out on the Oxford images. Experiments show that the proposed method can extract more stable feature points under different fuzzy, illumination and compression conditions, which improve the matching accuracy of feature points.","PeriodicalId":270809,"journal":{"name":"2019 6th International Conference on Systems and Informatics (ICSAI)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 6th International Conference on Systems and Informatics (ICSAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSAI48974.2019.9010209","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

For the features extraction of image, an improved Oriented FAST and Rotated BRIEF (ORB) algorithm of extracting features based on local region adaptive threshold is proposed, which not only can it solve the problem that the traditional ORB feature extraction algorithm cannot adapt to the local brightness change of the image, but also solve the phenomenon that the extracted feature points exist clusters. Firstly, extracting local region adaptive threshold features on each pyramid image based on constructed an image pyramid. Then, the feature points are divided by the quad-tree algorithm and the direction and the descriptor of the feature points are calculated. After that, the Fast Library for Approximate Nearest Neighbors (FLANN) is used to the match feature points, the mismatch points are eliminated by Lowe's algorithm and rotation consistency. Finally, using the Random sample consensus (RANSAC) to get the fine matching image. The method proposed in this paper is carried out on the Oxford images. Experiments show that the proposed method can extract more stable feature points under different fuzzy, illumination and compression conditions, which improve the matching accuracy of feature points.
基于局部自适应阈值的改进ORB特征提取算法
针对图像的特征提取,提出了一种基于局部区域自适应阈值的改进的Oriented FAST and rotating BRIEF (ORB)特征提取算法,既解决了传统ORB特征提取算法不能适应图像局部亮度变化的问题,又解决了提取的特征点存在聚类的现象。首先,在构造图像金字塔的基础上,对每张金字塔图像提取局部自适应阈值特征;然后,用四叉树算法对特征点进行分割,计算特征点的方向和描述子;然后,使用快速近似近邻库(FLANN)对特征点进行匹配,通过Lowe's算法和旋转一致性去除不匹配点。最后,利用随机样本一致性(RANSAC)得到精细匹配图像。本文提出的方法在牛津图像上进行了验证。实验表明,该方法在不同的模糊、光照和压缩条件下都能提取出更稳定的特征点,提高了特征点的匹配精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信