Map Point Selection for Visual SLAM
Christiaan J. M\"uller, Corn\'e E. van Daalen

TL;DR
This paper introduces novel information-theoretic utility functions and greedy algorithms for selecting map points in sparse visual SLAM, reducing map size while maintaining trajectory accuracy, and considers front-end performance in the selection process.
Contribution
It proposes new scalable utility functions for map point selection in visual SLAM and integrates front-end performance modeling to improve selection effectiveness.
Findings
Achieves trajectory accuracy comparable to offline baselines.
Enables online map reduction with competitive accuracy.
Shows front-end performance significantly influences point selection effectiveness.
Abstract
Simultaneous localisation and mapping (SLAM) play a vital role in autonomous robotics. Robotic platforms are often resource-constrained, and this limitation motivates resource-efficient SLAM implementations. While sparse visual SLAM algorithms offer good accuracy for modest hardware requirements, even these more scalable sparse approaches face limitations when applied to large-scale and long-term scenarios. A contributing factor is that the point clouds resulting from SLAM are inefficient to use and contain significant redundancy. This paper proposes the use of subset selection algorithms to reduce the map produced by sparse visual SLAM algorithms. Information-theoretic techniques have been applied to simpler related problems before, but they do not scale if applied to the full visual SLAM problem. This paper proposes a number of novel information\hyp{}theoretic utility functions for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotics and Sensor-Based Localization · Robotic Path Planning Algorithms · Optimization and Search Problems
