Visual Odometry Revisited: What Should Be Learnt?

Huangying Zhan, Chamara Saroj Weerasekera, Jiawang Bian, Ian Reid
9/21/2019
cs.CV

Official code: Huangying-Zhan/DF-VO (615 stars, MIT, last commit 2023-11-28).

Abstract

In this work we present a monocular visual odometry (VO) algorithm which leverages geometry-based methods and deep learning. Most existing VO/SLAM systems with superior performance are based on geometry and have to be carefully designed for different application scenarios. Moreover, most monocular systems suffer from scale-drift issue.Some recent deep learning works learn VO in an end-to-end manner but the performance of these deep systems is still not comparable to geometry-based methods. In this work, we revisit the basics of VO and explore the right way for integrating deep learning with epipolar geometry and Perspective-n-Point (PnP) method. Specifically, we train two convolutional neural networks (CNNs) for estimating single-view depths and two-view optical flows as intermediate outputs. With the deep predictions, we design a simple but robust frame-to-frame VO algorithm (DF-VO) which outperforms pure deep learning-based and geometry-based methods. More importantly, our system does not suffer from the scale-drift issue being aided by a scale consistent single-view depth CNN. Extensive experiments on KITTI dataset shows the robustness of our system and a detailed ablation study shows the effect of different factors in our system.

View on arXivView PDF

Code Implementations(1)

MIT

Depth and Flow for Visual Odometry

615122Shell, PythonOct 3, 20192 years agoMIT
depth-estimationicra2020optical-flowself-supervised-learningvisual-odometry

Similar Papers

Cite this paper

@article{zhan2019visual,
  title  = {Visual Odometry Revisited: What Should Be Learnt?},
  author = {Huangying Zhan and Chamara Saroj Weerasekera and Jiawang Bian and Ian Reid},
  year   = {2019},
  eprint = {1909.09803},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1909.09803}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1909.09803.svg)](https://codeofpaper.com/paper/1909.09803)

Discussion