Learning Point Cloud Geometry as a Statistical Manifold: Theory and Practice

• URL: http://arxiv.org/abs/2605.10456v1
• Date: Mon, 11 May 2026 12:27:25 GMT
• Title: Learning Point Cloud Geometry as a Statistical Manifold: Theory and Practice
• Abstract summary: LiDAR-acquired point clouds are inherently sparse and non-uniform.<n>Existing approaches attempt to compensate for these limitations by estimating local geometry.<n>We introduce Point-to-Ellipsoid (POLI), a deep neural estimator that predicts per-point Gaussian geometry.
• Score: 11.695017334165287
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Point clouds are a fundamental representation for robotic perception tasks such as localization, mapping, and object pose estimation. However, LiDAR-acquired point clouds are inherently sparse and non-uniform, providing incomplete observations of the underlying scene geometry. This makes reliable geometric reasoning challenging and degrades downstream perception performance. Existing approaches attempt to compensate for these limitations by estimating local geometry, but often rely on hand-crafted statistics or end-to-end supervised learning, which can suffer from limited scalability or require large amounts of accurately labeled data. To address these challenges, we explicitly model point cloud geometry under a principled mathematical formulation. We represent local geometry as a statistical manifold induced by a family of Gaussian distributions, where each point is associated with a Gaussian capturing its local geometric structure. Based on this formulation, we introduce Point-to-Ellipsoid (POLI), a deep neural estimator that predicts per-point Gaussian geometry. POLI learns a mapping from point cloud observations to their underlying geometry in a self-supervised manner, removing the need for labeled data while preserving strong geometric inductive biases. The resulting representation integrates seamlessly into existing robotic perception pipelines without architectural modifications. Extensive experiments show that POLI enables accurate and robust geometry estimation and consistently improves performance across diverse robotic perception tasks.

Related papers

• PartialBiGrasp: Inferring Hidden Local Geometry for Bimanual Grasping from Partial Views [6.708853928904307]
  We propose a dual-arm grasp generation framework that operates directly on partial point cloud observations.<n>Our model learns geometric features implicitly through convolutional occupancy networks.<n>We leverage this understanding to generate force-closure compliant grasp pairs.
  arXiv  Detail & Related papers  (2026-08-19T17:56:11Z)
• The Data Manifold under the Microscope [3.9636286063751895]
  Generalization and approximation error bounds are often derived for simplified models or are too loose to be informative.<n>We introduce a benchmarking framework for studying data geometry.<n>The framework is intended as a controlled testbed, useful as a calibration environment for geometric estimators.
  arXiv  Detail & Related papers  (2026-06-14T11:45:58Z)
• Z-FLoc: Zero-Shot Floorplan Localization via Geometric Primitives [72.63181031215858]
  We propose a zero-shot floorplan localization method that generalizes to novel environments without any retraining.<n>Our key insight is that dominant geometric primitives are ubiquitous in human-made environments.<n> Experiments on both simulated and real-world datasets show that our approach outperforms state-of-the-art learning-based methods on unseen environments.
  arXiv  Detail & Related papers  (2026-06-03T12:14:24Z)
• A Mean Curvature Approach to Boundary Detection: Geometric Insights for Unsupervised Learning [52.452902154360565]
  We introduce Mean Curvature Boundary Points (MCBP), a novel geometric framework grounded in Geometric Machine Learning.<n>MCBP explicitly models the intrinsic curvature of the data manifold and computes pointwise mean curvature without requiring principled manifold parametrization.<n>Experiments on synthetic and real-world datasets demonstrate that MCBP consistently improves clustering performance.
  arXiv  Detail & Related papers  (2026-05-05T20:19:09Z)
• A roadmap for curvature-based geometric data analysis and learning [3.5808917363708743]
  We present the first comprehensive review of existing discrete curvature models, covering their mathematical foundations, computational formulations, and practical applications in data analysis and learning.<n>Finally, we review state-of-the-art applications of curvature in both supervised and unsupervised learning.
  arXiv  Detail & Related papers  (2025-10-26T09:31:41Z)
• Adaptive Point-Prompt Tuning: Fine-Tuning Heterogeneous Foundation Models for 3D Point Cloud Analysis [51.37795317716487]
  We propose the Adaptive Point-Prompt Tuning (APPT) method, which fine-tunes pre-trained models with a modest number of parameters.<n>We convert raw point clouds into point embeddings by aggregating local geometry to capture spatial features followed by linear layers.<n>To calibrate self-attention across source domains of any modality to 3D, we introduce a prompt generator that shares weights with the point embedding module.
  arXiv  Detail & Related papers  (2025-08-30T06:02:21Z)
• ParaPoint: Learning Global Free-Boundary Surface Parameterization of 3D Point Clouds [52.03819676074455]
  ParaPoint is an unsupervised neural learning pipeline for achieving global free-boundary surface parameterization. This work makes the first attempt to investigate neural point cloud parameterization that pursues both global mappings and free boundaries.
  arXiv  Detail & Related papers  (2024-03-15T14:35:05Z)
• Adaptive Surface Normal Constraint for Geometric Estimation from Monocular Images [56.86175251327466]
  We introduce a novel approach to learn geometries such as depth and surface normal from images while incorporating geometric context. Our approach extracts geometric context that encodes the geometric variations present in the input image and correlates depth estimation with geometric constraints. Our method unifies depth and surface normal estimations within a cohesive framework, which enables the generation of high-quality 3D geometry from images.
  arXiv  Detail & Related papers  (2024-02-08T17:57:59Z)
• GeoUDF: Surface Reconstruction from 3D Point Clouds via Geometry-guided Distance Representation [73.77505964222632]
  We present a learning-based method, namely GeoUDF, to tackle the problem of reconstructing a discrete surface from a sparse point cloud. To be specific, we propose a geometry-guided learning method for UDF and its gradient estimation. To extract triangle meshes from the predicted UDF, we propose a customized edge-based marching cube module.
  arXiv  Detail & Related papers  (2022-11-30T06:02:01Z)
• Curved Geometric Networks for Visual Anomaly Recognition [39.91252195360767]
  Learning a latent embedding to understand the underlying nature of data distribution is often formulated in Euclidean spaces with zero curvature. In this work, we investigate benefits of the curved space for analyzing anomalies or out-of-distribution objects in data.
  arXiv  Detail & Related papers  (2022-08-02T01:15:39Z)
• Geometry-Aware Self-Training for Unsupervised Domain Adaptationon Object Point Clouds [36.49322708074682]
  This paper proposes a new method of geometry-aware self-training (GAST) for unsupervised domain adaptation of object point cloud classification. Specifically, this paper aims to learn a domain-shared representation of semantic categories, via two novel self-supervised geometric learning tasks as feature regularization. On the other hand, a diverse point distribution across datasets can be normalized with a novel curvature-aware distortion localization.
  arXiv  Detail & Related papers  (2021-08-20T13:29:11Z)
• Geometric Attention for Prediction of Differential Properties in 3D Point Clouds [32.68259334785767]
  In this study, we present a geometric attention mechanism that can provide such properties in a learnable fashion. We establish the usefulness of the proposed technique with several experiments on the prediction of normal vectors and the extraction of feature lines.
  arXiv  Detail & Related papers  (2020-07-06T07:40:26Z)
• Improving Semantic Analysis on Point Clouds via Auxiliary Supervision of Local Geometric Priors [34.4685487625487]
  This paper is the first attempt to propose a unique multi-task geometric learning network to improve semantic analysis by auxiliary geometric learning with local shape properties. The proposed geometric self-supervised and privileged learning algorithms can achieve superior performance to their backbones and other state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-01-14T14:33:31Z)

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.