CodedVO: Coded Visual Odometry
Not on the map. Why?
Abstract (arXiv)
Autonomous robots often rely on monocular cameras for odometry estimation and navigation. However, the scale ambiguity problem presents a critical barrier to effective monocular visual odometry. In this paper, we present CodedVO, a novel monocular visual odometry method that overcomes the scale ambiguity problem by employing custom optics to physically encode metric depth information into imagery. By incorporating this information into our odometry pipeline, we achieve state-of-the-art performance in monocular visual odometry with a known scale. We evaluate our method in diverse indoor environments and demonstrate its robustness and adaptability. We achieve a 0.08m average trajectory error in odometry evaluation on the ICL-NUIM indoor odometry dataset.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 14 of its 44 references that are in the map. First posted on arXiv 25 Jul 2024.
Builds on
14 of 44 references.
References · 14
- 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,713
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2015ORB-SLAM: a Versatile and Accurate Monocular SLAM Systemcited by 988
- 2016ORB-SLAM2: an Open-Source SLAM System for Monocular, Stereo and RGB-D Camerascited by 806
- 2021DROID-SLAM: Deep Visual SLAM for Monocular, Stereo, and RGB-D Camerascited by 687
- 2023ZoeDepth: Zero-shot Transfer by Combining Relative and Metric Depthcited by 657
- 2016Direct Sparse Odometrycited by 485
- 2023Metric3D: Towards Zero-shot Metric 3D Prediction from A Single Imagecited by 365
- 2022Deep Patch Visual Odometrycited by 190
- 2023MiDaS v3.1 -- A Model Zoo for Robust Monocular Relative Depth Estimationcited by 174
- 2018Evaluation of CNN-based Single-Image Depth Estimation Methodscited by 138
- 2019Deep Optics for Monocular Depth Estimation and 3D Object Detectioncited by 65
2 more
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.