Mahalanobis k-NN: A Statistical Lens for Robust Point-Cloud Registrations
- URL: http://arxiv.org/abs/2409.06267v2
- Date: Tue, 07 Jan 2025 19:53:41 GMT
- Title: Mahalanobis k-NN: A Statistical Lens for Robust Point-Cloud Registrations
- Authors: Tejas Anvekar, Shivanand Venkanna Sheshappanavar,
- Abstract summary: 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.
- Score: 6.5252909392002785
- License:
- Abstract: In this paper, we discuss Mahalanobis k-NN: A Statistical Lens designed to address the challenges of feature matching in learning-based point cloud registration when confronted with an arbitrary density of point clouds. We tackle this by adopting Mahalanobis k-NN's inherent property to capture the distribution of the local neighborhood and surficial geometry. Our method can be seamlessly integrated into any local-graph-based point cloud analysis method. In this paper, we focus on two distinct methodologies: Deep Closest Point (DCP) and Deep Universal Manifold Embedding (DeepUME). Our extensive benchmarking on the ModelNet40 and FAUST datasets highlights the efficacy of the proposed method in point cloud registration tasks. Moreover, we establish for the first time that the features acquired through point cloud registration inherently can possess discriminative capabilities. This is evident by a substantial improvement of about 20% in the average accuracy observed in the point cloud few-shot classification task, benchmarked on ModelNet40 and ScanObjectNN.
Related papers
- 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) - One-Nearest Neighborhood Guides Inlier Estimation for Unsupervised Point
Cloud Registration [24.275038551236907]
We propose an effective inlier estimation method for unsupervised point cloud registration.
We capture geometric structure consistency between the source point cloud and its corresponding reference point cloud copy.
We train the proposed model in an unsupervised manner, and experiments on synthetic and real-world datasets illustrate the effectiveness of the proposed method.
arXiv Detail & Related papers (2023-07-26T08:04:01Z) - Neural FIM for learning Fisher Information Metrics from point cloud data [71.07939200676199]
We propose neural FIM, a method for computing the Fisher information metric (FIM) from point cloud data.
We demonstrate its utility in selecting parameters for the PHATE visualization method as well as its ability to obtain information pertaining to local volume illuminating branching points and cluster centers embeddings of a toy dataset and two single-cell datasets of IPSC reprogramming and PBMCs (immune cells)
arXiv Detail & Related papers (2023-06-01T17:36:13Z) - Controllable Mesh Generation Through Sparse Latent Point Diffusion
Models [105.83595545314334]
We design a novel sparse latent point diffusion model for mesh generation.
Our key insight is to regard point clouds as an intermediate representation of meshes, and model the distribution of point clouds instead.
Our proposed sparse latent point diffusion model achieves superior performance in terms of generation quality and controllability.
arXiv Detail & Related papers (2023-03-14T14:25:29Z) - PointPatchMix: Point Cloud Mixing with Patch Scoring [58.58535918705736]
We propose PointPatchMix, which mixes point clouds at the patch level and generates content-based targets for mixed point clouds.
Our approach preserves local features at the patch level, while the patch scoring module assigns targets based on the content-based significance score from a pre-trained teacher model.
With Point-MAE as our baseline, our model surpasses previous methods by a significant margin, achieving 86.3% accuracy on ScanObjectNN and 94.1% accuracy on ModelNet40.
arXiv Detail & Related papers (2023-03-12T14:49:42Z) - 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) - PC-RGNN: Point Cloud Completion and Graph Neural Network for 3D Object
Detection [57.49788100647103]
LiDAR-based 3D object detection is an important task for autonomous driving.
Current approaches suffer from sparse and partial point clouds of distant and occluded objects.
In this paper, we propose a novel two-stage approach, namely PC-RGNN, dealing with such challenges by two specific solutions.
arXiv Detail & Related papers (2020-12-18T18:06:43Z) - 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) - PointManifold: Using Manifold Learning for Point Cloud Classification [5.705680763604835]
We propose a point cloud classification method based on graph neural network and manifold learning.
This paper uses manifold learning algorithms to embed point cloud features for better considering continuity on the surface.
Experiments show that the proposed point cloud classification methods obtain the mean class accuracy (mA) of 90.2% and the overall accuracy (oA) of 93.2%.
arXiv Detail & Related papers (2020-10-14T16:28:19Z) - DeepCLR: Correspondence-Less Architecture for Deep End-to-End Point
Cloud Registration [12.471564670462344]
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.
arXiv Detail & Related papers (2020-07-22T08:20:57Z)
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.