基于改进ORB特征匹配的盲径障碍物测距研究

Yongquan Xia, Yiqing Li, Jianhua Dong
{"title":"基于改进ORB特征匹配的盲径障碍物测距研究","authors":"Yongquan Xia, Yiqing Li, Jianhua Dong","doi":"10.1109/ICGMRS55602.2022.9849251","DOIUrl":null,"url":null,"abstract":"For the problem of poor real-time and accuracy of distance measurement of obstacles on blind corridors with the traditional ORB (Oriented FAST (Features from Accelerated Segment Test) and Rotated BRIEF (Binary Robust Independent Elementary Features)) matching algorithm, a method of narrowing the search domain is proposed to optimize the ORB algorithm. Firstly, the image is fed into the trained SegNet network model to obtain the segmented blind image, which is converted into a binary image to obtain the position information of the blind in the x-direction of the whole image, and then feature point extraction is performed in the blind area. Secondly, the polar line constraint is added to the feature matching part and the RANSAC algorithm is combined to optimize the matching to obtain the obstacle feature point pairs in the blind area. Finally, the parallax is calculated according to the two-dimensional planar structure of binocular stereo vision to find the precise distance of the obstacle. The experimental results show that the improved ORB algorithm has better real-time performance and accuracy.","PeriodicalId":129909,"journal":{"name":"2022 3rd International Conference on Geology, Mapping and Remote Sensing (ICGMRS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research on Blind path Obstacle ranging based on improved ORB Feature Matching\",\"authors\":\"Yongquan Xia, Yiqing Li, Jianhua Dong\",\"doi\":\"10.1109/ICGMRS55602.2022.9849251\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For the problem of poor real-time and accuracy of distance measurement of obstacles on blind corridors with the traditional ORB (Oriented FAST (Features from Accelerated Segment Test) and Rotated BRIEF (Binary Robust Independent Elementary Features)) matching algorithm, a method of narrowing the search domain is proposed to optimize the ORB algorithm. Firstly, the image is fed into the trained SegNet network model to obtain the segmented blind image, which is converted into a binary image to obtain the position information of the blind in the x-direction of the whole image, and then feature point extraction is performed in the blind area. Secondly, the polar line constraint is added to the feature matching part and the RANSAC algorithm is combined to optimize the matching to obtain the obstacle feature point pairs in the blind area. Finally, the parallax is calculated according to the two-dimensional planar structure of binocular stereo vision to find the precise distance of the obstacle. The experimental results show that the improved ORB algorithm has better real-time performance and accuracy.\",\"PeriodicalId\":129909,\"journal\":{\"name\":\"2022 3rd International Conference on Geology, Mapping and Remote Sensing (ICGMRS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-04-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 3rd International Conference on Geology, Mapping and Remote Sensing (ICGMRS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICGMRS55602.2022.9849251\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 3rd International Conference on Geology, Mapping and Remote Sensing (ICGMRS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICGMRS55602.2022.9849251","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

针对传统ORB(面向加速段测试特征)和旋转BRIEF(二值鲁棒独立基本特征)匹配算法对盲道障碍物距离测量实时性和准确性较差的问题,提出了一种缩小搜索域的方法对ORB算法进行优化。首先将图像输入训练好的SegNet网络模型,得到分割后的盲点图像,将其转换为二值图像,得到盲点在整个图像x方向上的位置信息,然后在盲区进行特征点提取。其次,在特征匹配部分加入极线约束,结合RANSAC算法优化匹配,获得盲区障碍物特征点对;最后,根据双目立体视觉的二维平面结构计算视差,求出障碍物的精确距离。实验结果表明,改进的ORB算法具有更好的实时性和准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Research on Blind path Obstacle ranging based on improved ORB Feature Matching
For the problem of poor real-time and accuracy of distance measurement of obstacles on blind corridors with the traditional ORB (Oriented FAST (Features from Accelerated Segment Test) and Rotated BRIEF (Binary Robust Independent Elementary Features)) matching algorithm, a method of narrowing the search domain is proposed to optimize the ORB algorithm. Firstly, the image is fed into the trained SegNet network model to obtain the segmented blind image, which is converted into a binary image to obtain the position information of the blind in the x-direction of the whole image, and then feature point extraction is performed in the blind area. Secondly, the polar line constraint is added to the feature matching part and the RANSAC algorithm is combined to optimize the matching to obtain the obstacle feature point pairs in the blind area. Finally, the parallax is calculated according to the two-dimensional planar structure of binocular stereo vision to find the precise distance of the obstacle. The experimental results show that the improved ORB algorithm has better real-time performance and accuracy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信