Mahalanobis k-NN: A Statistical Lens for Robust Point-Cloud Registrations

Tejas Anvekar, Shivanand Venkanna Sheshappanavar
9/10/2024
cs.CV

No official code found. Best implementation: TejasAnvekar/Mahalanobis-k-NN (1 star, MIT, last commit 2025-02-28).

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.

View on arXivView PDF

Code Implementations(1)

MIT

Official Code for Mahalanobis k-NN: A Statistical Lens for Robust Point-Cloud Registrations

10C++, CudaSep 10, 20241 years agoMIT

Similar Papers

Cite this paper

@article{anvekar2024mahalanobis,
  title  = {Mahalanobis k-NN: A Statistical Lens for Robust Point-Cloud Registrations},
  author = {Tejas Anvekar and Shivanand Venkanna Sheshappanavar},
  year   = {2024},
  eprint = {2409.06267},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2409.06267v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2409.06267.svg)](https://codeofpaper.com/paper/2409.06267)

Discussion