计算机工程与应用 ›› 2017, Vol. 53 ›› Issue (1): 190-194.DOI: 10.3778/j.issn.1002-8331.1504-0078

• 图形图像处理 • 上一篇    下一篇

基于ORB算子的快速立体匹配算法

贺利乐1，路二伟1，李赵兴1，2，华  瑾1   

  1. 1.西安建筑科技大学 机电工程学院，西安 710055
    2.榆林学院 信息工程学院，陕西 榆林 719000
  • 出版日期:2017-01-01 发布日期:2017-01-10

Fast stereo matching algorithm based on ORB operator

HE Lile1, LU Erwei1, LI Zhaoxing1，2, HUA Jin1   

  1. 1.College of Mechanical and Electrical Engineering, Xi’an University of Architecture and Technology, Xi’an 710055, China
    2.College of Information Engineering, Yulin University, Yulin, Shaanxi 719000, China
  • Online:2017-01-01 Published:2017-01-10

PDF

摘要： 针对利用SURF（Speeded Up Robust Features）进行立体匹配难以满足实时性需求这个问题，提出了一种基于ORB（Oriented fast and Rotated BRIEF）特征的立体匹配算法。在提取ORB特征点时，用一个数组记录该特征点因减小边缘效应而排序后的次序，结合极线约束、唯一性约束和顺序约束，来减少搜索空间，再以KNN（K-Nearest Neighbor）作为匹配策略，计算特征描述子的汉明距离，最后以最近邻匹配作为立体匹配结果。实验结果表明，该方法匹配速度快，准确度高，即使在图像未经校正的情况下，仍有较高的准确率。

关键词: 立体匹配, ORB算子, 极线约束, 唯一性约束, 顺序约束

Abstract: A stereo matching algorithm based on ORB（Oiented fast and Rotated BRIEF）is proposed due to that stereo matching with SURF（Speeded Up Robust Features） cannot meet the demand of real-time application. Extracting features of ORB, an array is used to record sorted order as a result of the features being sorted to decrease edge effect at the same time. Search space is reduced by the epipolar constraint, uniqueness constraint and sequence constraint. KNN（K-Nearest Neighbor）algorithm is taken as matching strategy. The matching result is obtained according to the nearest neighbor matching by computing Hamming distance of ORB descriptors. The experimental results prove that the algorithm is fast, high accuracy. Even if the image is not corrected, the accuracy is still satisfactory.

Key words: stereo matching, ORB operator, epipolar constraint, uniqueness constraint, sequence constraint

京ICP备13024262号-1
Copyright © 《计算机工程与应用》编辑部
技术支持：北京玛格泰克科技发展有限公司
总访问量
今日访问
在线人数