PointNetKL: Deep Inference for GICP Covariance Estimation in Bathymetric
SLAM
- URL: http://arxiv.org/abs/2003.10931v1
- Date: Tue, 24 Mar 2020 15:44:07 GMT
- Title: PointNetKL: Deep Inference for GICP Covariance Estimation in Bathymetric
SLAM
- Authors: Ignacio Torroba, Christopher Iliffe Sprague, Nils Bore, John Folkesson
- Abstract summary: We propose a new approach to estimate the uncertainty of point cloud registration using PointNet.
We train this network using the KL divergence between the learned uncertainty distribution and one computed by the Monte Carlo method as the loss.
We test the performance of the general model presented applying it to our target use-case of SLAM with an autonomous underwater vehicle.
- Score: 2.064612766965483
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Registration methods for point clouds have become a key component of many
SLAM systems on autonomous vehicles. However, an accurate estimate of the
uncertainty of such registration is a key requirement to a consistent fusion of
this kind of measurements in a SLAM filter. This estimate, which is normally
given as a covariance in the transformation computed between point cloud
reference frames, has been modelled following different approaches, among which
the most accurate is considered to be the Monte Carlo method. However, a Monte
Carlo approximation is cumbersome to use inside a time-critical application
such as online SLAM. Efforts have been made to estimate this covariance via
machine learning using carefully designed features to abstract the raw point
clouds. However, the performance of this approach is sensitive to the features
chosen. We argue that it is possible to learn the features along with the
covariance by working with the raw data and thus we propose a new approach
based on PointNet. In this work, we train this network using the KL divergence
between the learned uncertainty distribution and one computed by the Monte
Carlo method as the loss. We test the performance of the general model
presented applying it to our target use-case of SLAM with an autonomous
underwater vehicle (AUV) restricted to the 2-dimensional registration of 3D
bathymetric point clouds.
Related papers
- Online Variational Sequential Monte Carlo [49.97673761305336]
We build upon the variational sequential Monte Carlo (VSMC) method, which provides computationally efficient and accurate model parameter estimation and Bayesian latent-state inference.
Online VSMC is capable of performing efficiently, entirely on-the-fly, both parameter estimation and particle proposal adaptation.
arXiv Detail & Related papers (2023-12-19T21:45:38Z) - CMG-Net: Robust Normal Estimation for Point Clouds via Chamfer Normal
Distance and Multi-scale Geometry [23.86650228464599]
This work presents an accurate and robust method for estimating normals from point clouds.
We first propose a new metric termed Chamfer Normal Distance to address this issue.
We devise an innovative architecture that encompasses Multi-scale Local Feature Aggregation and Hierarchical Geometric Information Fusion.
arXiv Detail & Related papers (2023-12-14T17:23:16Z) - Split-KalmanNet: A Robust Model-Based Deep Learning Approach for SLAM [101.32324781612172]
Simultaneous localization and mapping (SLAM) is a method that constructs a map of an unknown environment and localizes the position of a moving agent on the map simultaneously.
Extended Kalman filter (EKF) has been widely adopted as a low complexity solution for online SLAM.
We present a robust EKF algorithm using the power of deep learning for online SLAM, referred to as Split-KalmanNet.
arXiv Detail & Related papers (2022-10-18T07:10:38Z) - 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) - Content Popularity Prediction Based on Quantized Federated Bayesian
Learning in Fog Radio Access Networks [76.16527095195893]
We investigate the content popularity prediction problem in cache-enabled fog radio access networks (F-RANs)
In order to predict the content popularity with high accuracy and low complexity, we propose a Gaussian process based regressor to model the content request pattern.
We utilize Bayesian learning to train the model parameters, which is robust to overfitting.
arXiv Detail & Related papers (2022-06-23T03:05:12Z) - SIXO: Smoothing Inference with Twisted Objectives [8.049531918823758]
We introduce SIXO, a method that learns targets that approximate the smoothing distributions.
We then use SMC with these learned targets to define a variational objective for model and proposal learning.
arXiv Detail & Related papers (2022-06-13T07:46:35Z) - A Model for Multi-View Residual Covariances based on Perspective
Deformation [88.21738020902411]
We derive a model for the covariance of the visual residuals in multi-view SfM, odometry and SLAM setups.
We validate our model with synthetic and real data and integrate it into photometric and feature-based Bundle Adjustment.
arXiv Detail & Related papers (2022-02-01T21:21:56Z) - LSG-CPD: Coherent Point Drift with Local Surface Geometry for Point
Cloud Registration [1.8876415010297891]
We propose a novel method called CPD with Local Surface Geometry (LSG-CPD) for rigid point cloud registration.
Our method adaptively adds different levels of point-to-plane penalization on top of the point-to-point penalization based on the flatness of the local surface.
It is significantly faster than modern implementations of CPD.
arXiv Detail & Related papers (2021-03-28T03:46:41Z) - 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)
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.