Keeping Less is More: Point Sparsification for Visual SLAM

• URL: http://arxiv.org/abs/2207.00225v1
• Date: Fri, 1 Jul 2022 06:39:38 GMT
• Title: Keeping Less is More: Point Sparsification for Visual SLAM
• Authors: Yeonsoo Park and Soohyun Bae
• Abstract summary: This study proposes an efficient graph optimization for sparsifying map points in SLAM systems. Specifically, we formulate a maximum pose-visibility and maximum spatial diversity problem as a minimum-cost maximum-flow graph optimization problem. The proposed method works as an additional step in existing SLAM systems, so it can be used in both conventional or learning based SLAM systems.
• Score: 1.370633147306388
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: When adapting Simultaneous Mapping and Localization (SLAM) to real-world applications, such as autonomous vehicles, drones, and augmented reality devices, its memory footprint and computing cost are the two main factors limiting the performance and the range of applications. In sparse feature based SLAM algorithms, one efficient way for this problem is to limit the map point size by selecting the points potentially useful for local and global bundle adjustment (BA). This study proposes an efficient graph optimization for sparsifying map points in SLAM systems. Specifically, we formulate a maximum pose-visibility and maximum spatial diversity problem as a minimum-cost maximum-flow graph optimization problem. The proposed method works as an additional step in existing SLAM systems, so it can be used in both conventional or learning based SLAM systems. By extensive experimental evaluations we demonstrate the proposed method achieves even more accurate camera poses with approximately 1/3 of the map points and 1/2 of the computation.

Related papers

• Splat-SLAM: Globally Optimized RGB-only SLAM with 3D Gaussians [87.48403838439391]
  3D Splatting has emerged as a powerful representation of geometry and appearance for RGB-only dense Simultaneous SLAM. We propose the first RGB-only SLAM system with a dense 3D Gaussian map representation. Our experiments on the Replica, TUM-RGBD, and ScanNet datasets indicate the effectiveness of globally optimized 3D Gaussians.
  arXiv  Detail & Related papers  (2024-05-26T12:26:54Z)
• GS-SLAM: Dense Visual SLAM with 3D Gaussian Splatting [51.96353586773191]
  We introduce textbfGS-SLAM that first utilizes 3D Gaussian representation in the Simultaneous Localization and Mapping system. Our method utilizes a real-time differentiable splatting rendering pipeline that offers significant speedup to map optimization and RGB-D rendering. Our method achieves competitive performance compared with existing state-of-the-art real-time methods on the Replica, TUM-RGBD datasets.
  arXiv  Detail & Related papers  (2023-11-20T12:08:23Z)
• FMapping: Factorized Efficient Neural Field Mapping for Real-Time Dense RGB SLAM [3.6985351289638957]
  We introduce FMapping, an efficient neural field mapping framework that facilitates the continuous estimation of a colorized point cloud map in real-time dense RGB SLAM. We propose an effective factorization scheme for scene representation and introduce a sliding window strategy to reduce the uncertainty for scene reconstruction.
  arXiv  Detail & Related papers  (2023-06-01T11:51:46Z)
• Maximize to Explore: One Objective Function Fusing Estimation, Planning, and Exploration [87.53543137162488]
  We propose an easy-to-implement online reinforcement learning (online RL) framework called textttMEX. textttMEX integrates estimation and planning components while balancing exploration exploitation automatically. It can outperform baselines by a stable margin in various MuJoCo environments with sparse rewards.
  arXiv  Detail & Related papers  (2023-05-29T17:25:26Z)
• VP-SLAM: A Monocular Real-time Visual SLAM with Points, Lines and Vanishing Points [31.55798962786664]
  We present a real-time monocular Visual SLAM system that incorporates real-time methods for line and VP extraction. We also present two strategies that exploit vanishing points to estimate the robot's translation and improve its rotation. The proposed system achieves state-of-the-art results and runs in real time, and its performance remains close to the original ORB-SLAM2 system.
  arXiv  Detail & Related papers  (2022-10-23T15:54:26Z)
• VIP-SLAM: An Efficient Tightly-Coupled RGB-D Visual Inertial Planar SLAM [25.681256050571058]
  We propose a tightly-coupled SLAM system fused with RGB, Depth, IMU and structured plane information. We use homography constraints to eliminate the parameters of numerous plane points in the optimization. The global bundle adjustment is nearly 2 times faster than the sparse points based SLAM algorithm.
  arXiv  Detail & Related papers  (2022-07-04T01:45:24Z)
• Greedy-Based Feature Selection for Efficient LiDAR SLAM [12.257338124961622]
  This paper demonstrates that actively selecting a subset of features significantly improves both the accuracy and efficiency of an L-SLAM system. We show that our approach exhibits low localization error and speedup compared to the state-of-the-art L-SLAM systems.
  arXiv  Detail & Related papers  (2021-03-24T11:03:16Z)
• OV$^{2}$SLAM : A Fully Online and Versatile Visual SLAM for Real-Time Applications [59.013743002557646]
  We describe OV$2$SLAM, a fully online algorithm, handling both monocular and stereo camera setups, various map scales and frame-rates ranging from a few Hertz up to several hundreds. For the benefit of the community, we release the source code: urlhttps://github.com/ov2slam/ov2slam.
  arXiv  Detail & Related papers  (2021-02-08T08:39:23Z)
• Pushing the Envelope of Rotation Averaging for Visual SLAM [69.7375052440794]
  We propose a novel optimization backbone for visual SLAM systems. We leverage averaging to improve the accuracy, efficiency and robustness of conventional monocular SLAM systems. Our approach can exhibit up to 10x faster with comparable accuracy against the state-art on public benchmarks.
  arXiv  Detail & Related papers  (2020-11-02T18:02:26Z)
• Making Affine Correspondences Work in Camera Geometry Computation [62.7633180470428]
  Local features provide region-to-region rather than point-to-point correspondences. We propose guidelines for effective use of region-to-region matches in the course of a full model estimation pipeline. Experiments show that affine solvers can achieve accuracy comparable to point-based solvers at faster run-times.
  arXiv  Detail & Related papers  (2020-07-20T12:07:48Z)
• CPL-SLAM: Efficient and Certifiably Correct Planar Graph-Based SLAM Using the Complex Number Representation [10.690106104510168]
  We present CPL-SLAM, an efficient and certifiably correct method to solve simultaneous graph-based SLAM. We show that CPL-SLAM is more efficient in numerical and more robust to measurement noise than existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-06-25T21:17:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.