Efficient Map Sparsification Based on 2D and 3D Discretized Grids

• URL: http://arxiv.org/abs/2303.10882v1
• Date: Mon, 20 Mar 2023 05:49:14 GMT
• Title: Efficient Map Sparsification Based on 2D and 3D Discretized Grids
• Authors: Xiaoyu Zhang, Yun-Hui Liu
• Abstract summary: As a map grows larger, more memory is required and localization becomes inefficient. Previous map sparsification methods add a quadratic term in mixed-integer programming to enforce a uniform distribution of selected landmarks. In this paper, we formulate map sparsification in an efficient linear form and select uniformly distributed landmarks based on 2D discretized grids.
• Score: 47.22997560184043
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Localization in a pre-built map is a basic technique for robot autonomous navigation. Existing mapping and localization methods commonly work well in small-scale environments. As a map grows larger, however, more memory is required and localization becomes inefficient. To solve these problems, map sparsification becomes a practical necessity to acquire a subset of the original map for localization. Previous map sparsification methods add a quadratic term in mixed-integer programming to enforce a uniform distribution of selected landmarks, which requires high memory capacity and heavy computation. In this paper, we formulate map sparsification in an efficient linear form and select uniformly distributed landmarks based on 2D discretized grids. Furthermore, to reduce the influence of different spatial distributions between the mapping and query sequences, which is not considered in previous methods, we also introduce a space constraint term based on 3D discretized grids. The exhaustive experiments in different datasets demonstrate the superiority of the proposed methods in both efficiency and localization performance. The relevant codes will be released at https://github.com/fishmarch/SLAM_Map_Compression.

Related papers

• SplatLoc: 3D Gaussian Splatting-based Visual Localization for Augmented Reality [50.179377002092416]
  We propose an efficient visual localization method capable of high-quality rendering with fewer parameters. Our method achieves superior or comparable rendering and localization performance to state-of-the-art implicit-based visual localization approaches.
  arXiv  Detail & Related papers  (2024-09-21T08:46:16Z)
• FUSELOC: Fusing Global and Local Descriptors to Disambiguate 2D-3D Matching in Visual Localization [57.59857784298536]
  Direct 2D-3D matching algorithms require significantly less memory but suffer from lower accuracy due to the larger and more ambiguous search space. We address this ambiguity by fusing local and global descriptors using a weighted average operator within a 2D-3D search framework. We consistently improve the accuracy over local-only systems and achieve performance close to hierarchical methods while halving memory requirements.
  arXiv  Detail & Related papers  (2024-08-21T23:42:16Z)
• Decomposition of Neural Discrete Representations for Large-Scale 3D Mapping [15.085191496726967]
  We introduce Decomposition-based Neural Mapping (DNMap) DNMap is a storage-efficient large-scale 3D mapping method. We learn low-resolution continuous embeddings that require tiny storage space.
  arXiv  Detail & Related papers  (2024-07-22T11:32:33Z)
• Efficient and Distributed Large-Scale 3D Map Registration using Tomographic Features [10.740403545402508]
  A robust, resource-efficient, distributed, and minimally parameterized 3D map matching and merging algorithm is proposed. The suggested algorithm utilizes tomographic features from 2D projections of horizontal cross-sections of gravity-aligned local maps, and matches these projection slices at all possible height differences.
  arXiv  Detail & Related papers  (2024-06-27T18:03:06Z)
• Volumetric Semantically Consistent 3D Panoptic Mapping [77.13446499924977]
  We introduce an online 2D-to-3D semantic instance mapping algorithm aimed at generating semantic 3D maps suitable for autonomous agents in unstructured environments. It introduces novel ways of integrating semantic prediction confidence during mapping, producing semantic and instance-consistent 3D regions. The proposed method achieves accuracy superior to the state of the art on public large-scale datasets, improving on a number of widely used metrics.
  arXiv  Detail & Related papers  (2023-09-26T08:03:10Z)
• Quadric Representations for LiDAR Odometry, Mapping and Localization [93.24140840537912]
  Current LiDAR odometry, mapping and localization methods leverage point-wise representations of 3D scenes. We propose a novel method of describing scenes using quadric surfaces, which are far more compact representations of 3D objects. Our method maintains low latency and memory utility while achieving competitive, and even superior, accuracy.
  arXiv  Detail & Related papers  (2023-04-27T13:52:01Z)
• Semi-supervised Learning of Pushforwards For Domain Translation & Adaptation [3.800498098285222]
  Given two probability densities on related data spaces, we seek a map pushing one density to the other. For maps to have utility in a broad application space, the map must be available to apply on out-of-sample data points. We introduce a novel pushforward map learning algorithm that utilizes normalizing flows to parameterize the map.
  arXiv  Detail & Related papers  (2023-04-18T00:35:32Z)
• SHINE-Mapping: Large-Scale 3D Mapping Using Sparse Hierarchical Implicit Neural Representations [37.733802382489515]
  This paper addresses the problems of achieving large-scale 3D reconstructions with implicit representations using 3D LiDAR measurements. We learn and store implicit features through an octree-based hierarchical structure, which is sparse and sparse. Our experiments show that our 3D reconstructions are more accurate, complete, and memory-efficient than current state-of-the-art 3D mapping methods.
  arXiv  Detail & Related papers  (2022-10-05T14:38:49Z)
• Rethinking Spatial Invariance of Convolutional Networks for Object Counting [119.83017534355842]
  We try to use locally connected Gaussian kernels to replace the original convolution filter to estimate the spatial position in the density map. Inspired by previous work, we propose a low-rank approximation accompanied with translation invariance to favorably implement the approximation of massive Gaussian convolution. Our methods significantly outperform other state-of-the-art methods and achieve promising learning of the spatial position of objects.
  arXiv  Detail & Related papers  (2022-06-10T17:51:25Z)
• Improved Counting and Localization from Density Maps for Object Detection in 2D and 3D Microscopy Imaging [4.746727774540763]
  We propose an alternative method to count and localize objects from the density map. Our results show improved performance in counting and localization of objects in 2D and 3D microscopy data.
  arXiv  Detail & Related papers  (2022-03-29T15:54:19Z)

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.