mlsanityData to 7 Oct 2026

Efficient Globally-Optimal Correspondence-Less Visual Odometry for Planar Ground Vehicles

arXiv 2203.00291 ↗First posted 1 Mar 2022cs.RO cs.CVcited by 5

Not on the map. Why?

Abstract (arXiv)

The motion of planar ground vehicles is often non-holonomic, and as a result may be modelled by the 2 DoF Ackermann steering model. We analyse the feasibility of estimating such motion with a downward facing camera that exerts fronto-parallel motion with respect to the ground plane. This turns the motion estimation into a simple image registration problem in which we only have to identify a 2-parameter planar homography. However, one difficulty that arises from this setup is that ground-plane features are indistinctive and thus hard to match between successive views. We encountered this difficulty by introducing the first globally-optimal, correspondence-less solution to plane-based Ackermann motion estimation. The solution relies on the branch-and-bound optimisation technique. Through the low-dimensional parametrisation, a derivation of tight bounds, and an efficient implementation, we demonstrate how this technique is eventually amenable to accurate real-time motion estimation. We prove its property of global optimality and analyse the impact of assuming a locally constant centre of rotation. Our results on real data finally demonstrate a significant advantage over the more traditional, correspondence-based hypothesise-and-test schemes.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 3 of its 35 references that are in the map. First posted on arXiv 1 Mar 2022.

Builds on

3 of 35 references.

References · 3

  1. 2016GOGMA: Globally-Optimal Gaussian Mixture Alignmentcited by 22
  2. 2018The Alignment of the Spheres: Globally-Optimal Spherical Mixture Alignment for Camera Pose Estimationcited by 20
  3. 2017Globally-Optimal Inlier Set Maximisation for Simultaneous Camera Pose and Feature Correspondencecited by 11

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 2; 2023: 1; 2024: 1; 2025: 0; 2026: 1.

5 papers.