Mahalanobis k-NN: A Statistical Lens for Robust Point-Cloud Registrations
Tejas Anvekar, Shivanand Venkanna Sheshappanavar
TL;DR
This work tackles robust point-cloud registration under variable densities by introducing Mahalanobis k-NN as a statistical lens that builds surface-aware, covariance-informed neighborhoods. The method plugs into local-graph based registration pipelines, yielding two variants: MDCP and MDeepUME, and demonstrates state-of-the-art performance on ModelNet40, FAUST, and related benchmarks. It also shows that features learned for registration can be discriminative for few-shot classification, broadening the impact of registration-derived representations. The approach emphasizes surface structure and resilience to outliers and density imbalance, offering a practical, plug-and-play enhancement for learning-based 3D alignment.
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.
