Deep Patch Visual SLAM

Lahav Lipson, Zachary Teed, Jia Deng
8/1/2024

No official code found. Best implementation: princeton-vl/DPVO (1,093 stars, MIT, last commit 2024-10-12).

Abstract

Recent work in visual SLAM has shown the effectiveness of using deep network backbones. Despite excellent accuracy, however, such approaches are often expensive to run or do not generalize well zero-shot. Their runtime can also fluctuate wildly while their frontend and backend fight for access to GPU resources. To address these problems, we introduce Deep Patch Visual (DPV) SLAM, a method for monocular visual SLAM on a single GPU. DPV-SLAM maintains a high minimum framerate and small memory overhead (5-7G) compared to existing deep SLAM systems. On real-world datasets, DPV-SLAM runs at 1x-4x real-time framerates. We achieve comparable accuracy to DROID-SLAM on EuRoC and TartanAir while running 2.5x faster using a fraction of the memory. DPV-SLAM is an extension to the DPVO visual odometry system; its code can be found in the same repository: https://github.com/princeton-vl/DPVO

View on arXivView PDF

Code Implementations(1)

princeton-vl/DPVOCommunity100%
MIT

Deep Patch Visual Odometry/SLAM

1,093165C, C++Aug 8, 20222 years agoMIT

Similar Papers

Cite this paper

@article{lipson2024deep,
  title  = {Deep Patch Visual SLAM},
  author = {Lahav Lipson and Zachary Teed and Jia Deng},
  year   = {2024},
  eprint = {2408.01654},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2408.01654},
  journal = {ECCV 2024 2024}
}

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/2408.01654.svg)](https://codeofpaper.com/paper/2408.01654)

Discussion