计算机与现代化

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

 基于改进BRISK算法的单目视觉里程计

  

  1. (河海大学计算机与信息学院,江苏南京211100)
  • 收稿日期:2018-03-07 出版日期:2018-09-29 发布日期:2018-09-30
  • 作者简介:冯钧(1969-),女,江苏常州人,河海大学计算机与信息学院教授,博士,研究方向:时空数据管理,水利信息化,人工智能; 黄多辉(1993-),男,安徽六安人,硕士研究生,研究方向:计算机视觉,机器人导航,人工智能。
  • 基金资助:
    国家重点研发计划项目(2017YFC0405806); 江苏省重点研发计划(社会发展)项目(BE2015707)

Monocular Visual Odometry Based on Improved BRISK Algorithm

  1. (College of Computer and Information, Hohai University, Nanjing 211100, China) 
  • Received:2018-03-07 Online:2018-09-29 Published:2018-09-30

摘要: 在传统的BRISK算法中使用自定义的抽样模式来描述检测到的特征点,使用基于汉明距离的方法进行特征点匹配。BRISK的这种特征点描述与匹配的方法使得其匹配准确率不高。因此本文提出将匹配准确率较高的SURF算法与BRISK算法相结合,在BRISK特征点描述与匹配阶段使用SURF描述符和基于欧氏距离的匹配方法。实验结果表明,该算法在时间消耗下降不大的情况下,特征点匹配准确率有很大提高,且该算法具有较好的鲁棒性。

关键词: BRISK, SURF, 视觉里程计, 特征检测, 特征匹配

Abstract:  In the traditional BRISK algorithm, a custom sampling pattern is used to describe the detected feature points, and a method based on the Hamming distance is used for feature matching. This feature point description and matching method of BRISK makes the low matching accuracy. Therefore, this paper proposes to combine SURF algorithm with high accuracy of matching and BRISK algorithm, and to use SURF descriptor and Euclidean distance-based matching method in BRISK feature point description and matching stage. The experimental results show that the accuracy of feature point matching is greatly improved when the time consumption of the algorithm is not greatly reduced. At the same time, the experiment also shows that the algorithm has good robustness.

Key words:  BRISK, SURF, visual odometry, feature detection, feature matching

中图分类号: