Incremental Multimodal Surface Mapping via Self-Organizing Gaussian
Mixture Models
- URL: http://arxiv.org/abs/2309.10900v2
- Date: Thu, 26 Oct 2023 21:38:08 GMT
- Title: Incremental Multimodal Surface Mapping via Self-Organizing Gaussian
Mixture Models
- Authors: Kshitij Goel, Wennie Tabib
- Abstract summary: This letter describes an incremental multimodal surface mapping methodology, which represents the environment as a continuous probabilistic model.
The strategy employed in this work utilizes Gaussian mixture models (GMMs) to represent the environment.
To bridge this gap, this letter introduces a spatial hash map for rapid GMM submap extraction combined with an approach to determine relevant and redundant data in a point cloud.
- Score: 1.0878040851638
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: This letter describes an incremental multimodal surface mapping methodology,
which represents the environment as a continuous probabilistic model. This
model enables high-resolution reconstruction while simultaneously compressing
spatial and intensity point cloud data. The strategy employed in this work
utilizes Gaussian mixture models (GMMs) to represent the environment. While
prior GMM-based mapping works have developed methodologies to determine the
number of mixture components using information-theoretic techniques, these
approaches either operate on individual sensor observations, making them
unsuitable for incremental mapping, or are not real-time viable, especially for
applications where high-fidelity modeling is required. To bridge this gap, this
letter introduces a spatial hash map for rapid GMM submap extraction combined
with an approach to determine relevant and redundant data in a point cloud.
These contributions increase computational speed by an order of magnitude
compared to state-of-the-art incremental GMM-based mapping. In addition, the
proposed approach yields a superior tradeoff in map accuracy and size when
compared to state-of-the-art mapping methodologies (both GMM- and not
GMM-based). Evaluations are conducted using both simulated and real-world data.
The software is released open-source to benefit the robotics community.
Related papers
- FRAME: A Modular Framework for Autonomous Map Merging: Advancements in the Field [12.247977717070773]
This article presents a novel approach for merging 3D point cloud maps in the context of egocentric multi-robot exploration.
The proposed approach leverages state-of-the-art place recognition and learned descriptors to efficiently detect overlap between maps.
The effectiveness of the proposed framework is successfully demonstrated through multiple field missions of robot exploration.
arXiv Detail & Related papers (2024-04-27T20:54:15Z) - RGM: A Robust Generalizable Matching Model [49.60975442871967]
We propose a deep model for sparse and dense matching, termed RGM (Robust Generalist Matching)
To narrow the gap between synthetic training samples and real-world scenarios, we build a new, large-scale dataset with sparse correspondence ground truth.
We are able to mix up various dense and sparse matching datasets, significantly improving the training diversity.
arXiv Detail & Related papers (2023-10-18T07:30:08Z) - Sampling From Autoencoders' Latent Space via Quantization And
Probability Mass Function Concepts [1.534667887016089]
We introduce a novel post-training sampling algorithm rooted in the concept of probability mass functions, coupled with a quantization process.
Our proposed algorithm establishes a vicinity around each latent vector from the input data and then proceeds to draw samples from these defined neighborhoods.
This strategic approach ensures that the sampled latent vectors predominantly inhabit high-probability regions, which, in turn, can be effectively transformed into authentic real-world images.
arXiv Detail & Related papers (2023-08-21T13:18:12Z) - Probabilistic Point Cloud Modeling via Self-Organizing Gaussian Mixture
Models [19.10047652180224]
We present a continuous probabilistic modeling methodology for spatial point cloud data using finite Gaussian Mixture Models (GMMs)
We use a self-organizing principle from information-theoretic learning to automatically adapt the complexity of the GMM model based on the relevant information in the sensor data.
The approach is evaluated against existing point cloud modeling techniques on real-world data with varying degrees of scene complexity.
arXiv Detail & Related papers (2023-01-31T19:28:00Z) - A robust estimator of mutual information for deep learning
interpretability [2.574652392763709]
We present GMM-MI, an algorithm that can be applied to both discrete and continuous settings.
We extensively validate GMM-MI on toy data for which the ground truth MI is known.
We then demonstrate the use of our MI estimator in the context of representation learning.
arXiv Detail & Related papers (2022-10-31T18:00:02Z) - Overlap-guided Gaussian Mixture Models for Point Cloud Registration [61.250516170418784]
Probabilistic 3D point cloud registration methods have shown competitive performance in overcoming noise, outliers, and density variations.
This paper proposes a novel overlap-guided probabilistic registration approach that computes the optimal transformation from matched Gaussian Mixture Model (GMM) parameters.
arXiv Detail & Related papers (2022-10-17T08:02:33Z) - Image Modeling with Deep Convolutional Gaussian Mixture Models [79.0660895390689]
We present a new formulation of deep hierarchical Gaussian Mixture Models (GMMs) that is suitable for describing and generating images.
DCGMMs avoid this by a stacked architecture of multiple GMM layers, linked by convolution and pooling operations.
For generating sharp images with DCGMMs, we introduce a new gradient-based technique for sampling through non-invertible operations like convolution and pooling.
Based on the MNIST and FashionMNIST datasets, we validate the DCGMMs model by demonstrating its superiority over flat GMMs for clustering, sampling and outlier detection.
arXiv Detail & Related papers (2021-04-19T12:08:53Z) - Coded Stochastic ADMM for Decentralized Consensus Optimization with Edge
Computing [113.52575069030192]
Big data, including applications with high security requirements, are often collected and stored on multiple heterogeneous devices, such as mobile devices, drones and vehicles.
Due to the limitations of communication costs and security requirements, it is of paramount importance to extract information in a decentralized manner instead of aggregating data to a fusion center.
We consider the problem of learning model parameters in a multi-agent system with data locally processed via distributed edge nodes.
A class of mini-batch alternating direction method of multipliers (ADMM) algorithms is explored to develop the distributed learning model.
arXiv Detail & Related papers (2020-10-02T10:41:59Z) - A Rigorous Link Between Self-Organizing Maps and Gaussian Mixture Models [78.6363825307044]
This work presents a mathematical treatment of the relation between Self-Organizing Maps (SOMs) and Gaussian Mixture Models (GMMs)
We show that energy-based SOM models can be interpreted as performing gradient descent.
This link allows to treat SOMs as generative probabilistic models, giving a formal justification for using SOMs to detect outliers, or for sampling.
arXiv Detail & Related papers (2020-09-24T14:09:04Z) - DeepGMR: Learning Latent Gaussian Mixture Models for Registration [113.74060941036664]
Point cloud registration is a fundamental problem in 3D computer vision, graphics and robotics.
In this paper, we introduce Deep Gaussian Mixture Registration (DeepGMR), the first learning-based registration method.
Our proposed method shows favorable performance when compared with state-of-the-art geometry-based and learning-based registration methods.
arXiv Detail & Related papers (2020-08-20T17:25:16Z)
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.