DeepCLR: Correspondence-Less Architecture for Deep End-to-End Point
Cloud Registration
- URL: http://arxiv.org/abs/2007.11255v2
- Date: Wed, 13 Jan 2021 10:04:51 GMT
- Title: DeepCLR: Correspondence-Less Architecture for Deep End-to-End Point
Cloud Registration
- Authors: Markus Horn, Nico Engel, Vasileios Belagiannis, Michael Buchholz and
Klaus Dietmayer
- Abstract summary: This work addresses the problem of point cloud registration using deep neural networks.
We propose an approach to predict the alignment between two point clouds with overlapping data content, but displaced origins.
Our approach achieves state-of-the-art accuracy and the lowest run-time of the compared methods.
- Score: 12.471564670462344
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: This work addresses the problem of point cloud registration using deep neural
networks. We propose an approach to predict the alignment between two point
clouds with overlapping data content, but displaced origins. Such point clouds
originate, for example, from consecutive measurements of a LiDAR mounted on a
moving platform. The main difficulty in deep registration of raw point clouds
is the fusion of template and source point cloud. Our proposed architecture
applies flow embedding to tackle this problem, which generates features that
describe the motion of each template point. These features are then used to
predict the alignment in an end-to-end fashion without extracting explicit
point correspondences between both input clouds. We rely on the KITTI odometry
and ModelNet40 datasets for evaluating our method on various point
distributions. Our approach achieves state-of-the-art accuracy and the lowest
run-time of the compared methods.
Related papers
- Mahalanobis k-NN: A Statistical Lens for Robust Point-Cloud Registrations [6.5252909392002785]
We discuss Mahalanobis k-NN: a statistical lens designed to address the challenges of feature matching in learning-based point cloud registration.
Our method can be seamlessly integrated into any local-graph-based point cloud analysis method.
We establish for the first time that the features acquired through point cloud registration inherently can possess discriminative capabilities.
arXiv Detail & Related papers (2024-09-10T07:12:18Z) - P2P-Bridge: Diffusion Bridges for 3D Point Cloud Denoising [81.92854168911704]
We tackle the task of point cloud denoising through a novel framework that adapts Diffusion Schr"odinger bridges to points clouds.
Experiments on object datasets show that P2P-Bridge achieves significant improvements over existing methods.
arXiv Detail & Related papers (2024-08-29T08:00:07Z) - PointRegGPT: Boosting 3D Point Cloud Registration using Generative Point-Cloud Pairs for Training [90.06520673092702]
We present PointRegGPT, boosting 3D point cloud registration using generative point-cloud pairs for training.
To our knowledge, this is the first generative approach that explores realistic data generation for indoor point cloud registration.
arXiv Detail & Related papers (2024-07-19T06:29:57Z) - Point Cloud Pre-training with Diffusion Models [62.12279263217138]
We propose a novel pre-training method called Point cloud Diffusion pre-training (PointDif)
PointDif achieves substantial improvement across various real-world datasets for diverse downstream tasks such as classification, segmentation and detection.
arXiv Detail & Related papers (2023-11-25T08:10:05Z) - HybridFusion: LiDAR and Vision Cross-Source Point Cloud Fusion [15.94976936555104]
We propose a cross-source point cloud fusion algorithm called HybridFusion.
It can register cross-source dense point clouds from different viewing angle in outdoor large scenes.
The proposed approach is evaluated comprehensively through qualitative and quantitative experiments.
arXiv Detail & Related papers (2023-04-10T10:54:54Z) - PointCaM: Cut-and-Mix for Open-Set Point Cloud Learning [72.07350827773442]
We propose to solve open-set point cloud learning using a novel Point Cut-and-Mix mechanism.
We use the Unknown-Point Simulator to simulate out-of-distribution data in the training stage.
The Unknown-Point Estimator module learns to exploit the point cloud's feature context for discriminating the known and unknown data.
arXiv Detail & Related papers (2022-12-05T03:53:51Z) - PointAttN: You Only Need Attention for Point Cloud Completion [89.88766317412052]
Point cloud completion refers to completing 3D shapes from partial 3D point clouds.
We propose a novel neural network for processing point cloud in a per-point manner to eliminate kNNs.
The proposed framework, namely PointAttN, is simple, neat and effective, which can precisely capture the structural information of 3D shapes.
arXiv Detail & Related papers (2022-03-16T09:20:01Z) - Point Cloud based Hierarchical Deep Odometry Estimation [3.058685580689605]
We propose a deep model that learns to estimate odometry in driving scenarios using point cloud data.
The proposed model consumes raw point clouds in order to extract frame-to-frame odometry estimation.
arXiv Detail & Related papers (2021-03-05T00:17:58Z) - End-to-End 3D Point Cloud Learning for Registration Task Using Virtual
Correspondences [17.70819292121181]
3D Point cloud registration is still a very challenging topic due to the difficulty in finding the rigid transformation between two point clouds.
In this paper, we present an end-to-end deep-learning based approach to resolve the point cloud registration problem.
arXiv Detail & Related papers (2020-11-30T06:55:05Z) - Refinement of Predicted Missing Parts Enhance Point Cloud Completion [62.997667081978825]
Point cloud completion is the task of predicting complete geometry from partial observations using a point set representation for a 3D shape.
Previous approaches propose neural networks to directly estimate the whole point cloud through encoder-decoder models fed by the incomplete point set.
This paper proposes an end-to-end neural network architecture that focuses on computing the missing geometry and merging the known input and the predicted point cloud.
arXiv Detail & Related papers (2020-10-08T22:01:23Z)
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.