PKSS-Align: Robust Point Cloud Registration on Pre-Kendall Shape Space

• URL: http://arxiv.org/abs/2508.04286v1
• Date: Wed, 06 Aug 2025 10:17:42 GMT
• Title: PKSS-Align: Robust Point Cloud Registration on Pre-Kendall Shape Space
• Authors: Chenlei Lv, Hui Huang,
• Abstract summary: The proposed method measures shape-based similarity between point clouds on the Pre-Kendall shape space (PKSS), textcolorblackwhich is a shape measurement-based scheme and doesn't require point-to-point or point-to-plane metric.<n>Based on a simple parallel acceleration, it can achieve significant improvement for efficiency and feasibility in practice.
• Score: 15.151282762403305
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Point cloud registration is a classical topic in the field of 3D Vision and Computer Graphics. Generally, the implementation of registration is typically sensitive to similarity transformations (translation, scaling, and rotation), noisy points, and incomplete geometric structures. Especially, the non-uniform scales and defective parts of point clouds increase probability of struck local optima in registration task. In this paper, we propose a robust point cloud registration PKSS-Align that can handle various influences, including similarity transformations, non-uniform densities, random noisy points, and defective parts. The proposed method measures shape feature-based similarity between point clouds on the Pre-Kendall shape space (PKSS), \textcolor{black}{which is a shape measurement-based scheme and doesn't require point-to-point or point-to-plane metric.} The employed measurement can be regarded as the manifold metric that is robust to various representations in the Euclidean coordinate system. Benefited from the measurement, the transformation matrix can be directly generated for point clouds with mentioned influences at the same time. The proposed method does not require data training and complex feature encoding. Based on a simple parallel acceleration, it can achieve significant improvement for efficiency and feasibility in practice. Experiments demonstrate that our method outperforms the relevant state-of-the-art methods.

Related papers

• A Moment Matching-Based Method for Sparse and Noisy Point Cloud Registration [8.121132773789652]
  We propose a registration framework based on moment matching.<n>Experiments on synthetic and real-world datasets show that our approach achieves higher accuracy and robustness than existing methods.<n>The proposed method significantly improves the localization performance and achieves results comparable to LiDAR-based systems.
  arXiv  Detail & Related papers  (2025-08-04T08:31:53Z)
• Rectified Point Flow: Generic Point Cloud Pose Estimation [25.666110213663828]
  We introduce Rectified Point Flow, a unified parameterization that formulates pairwise point cloud registration and multi-part shape assembly as a single conditional generative problem.<n>Our method learns a continuous point-wise velocity field that transports noisy points toward their target positions, from which part poses are recovered.
  arXiv  Detail & Related papers  (2025-06-05T17:36:03Z)
• Fully-Geometric Cross-Attention for Point Cloud Registration [51.865371511201765]
  Point cloud registration approaches often fail when the overlap between point clouds is low due to noisy point correspondences.<n>This work introduces a novel cross-attention mechanism tailored for Transformer-based architectures that tackles this problem.<n>We integrate the Gromov-Wasserstein distance into the cross-attention formulation to jointly compute distances between points across different point clouds.<n>At the point level, we also devise a self-attention mechanism that aggregates the local geometric structure information into point features for fine matching.
  arXiv  Detail & Related papers  (2025-02-12T10:44:36Z)
• A Consistency-Aware Spot-Guided Transformer for Versatile and Hierarchical Point Cloud Registration [9.609585217048664]
  We develop a consistency-aware spot-guided Transformer (CAST) CAST incorporates a spot-guided cross-attention module to avoid interfering with irrelevant areas. A lightweight fine matching module for both sparse keypoints and dense features can estimate the transformation accurately.
  arXiv  Detail & Related papers  (2024-10-14T08:48:25Z)
• Unleash the Potential of 3D Point Cloud Modeling with A Calibrated Local Geometry-driven Distance Metric [62.365983810610985]
  We propose a novel distance metric called Calibrated Local Geometry Distance (CLGD) CLGD computes the difference between the underlying 3D surfaces calibrated and induced by a set of reference points. As a generic metric, CLGD has the potential to advance 3D point cloud modeling.
  arXiv  Detail & Related papers  (2023-06-01T11:16:20Z)
• Quadric Representations for LiDAR Odometry, Mapping and Localization [93.24140840537912]
  Current LiDAR odometry, mapping and localization methods leverage point-wise representations of 3D scenes. We propose a novel method of describing scenes using quadric surfaces, which are far more compact representations of 3D objects. Our method maintains low latency and memory utility while achieving competitive, and even superior, accuracy.
  arXiv  Detail & Related papers  (2023-04-27T13:52:01Z)
• IDEA-Net: Dynamic 3D Point Cloud Interpolation via Deep Embedding Alignment [58.8330387551499]
  We formulate the problem as estimation of point-wise trajectories (i.e., smooth curves) We propose IDEA-Net, an end-to-end deep learning framework, which disentangles the problem under the assistance of the explicitly learned temporal consistency. We demonstrate the effectiveness of our method on various point cloud sequences and observe large improvement over state-of-the-art methods both quantitatively and visually.
  arXiv  Detail & Related papers  (2022-03-22T10:14:08Z)
• UPDesc: Unsupervised Point Descriptor Learning for Robust Registration [54.95201961399334]
  UPDesc is an unsupervised method to learn point descriptors for robust point cloud registration. We show that our learned descriptors yield superior performance over existing unsupervised methods.
  arXiv  Detail & Related papers  (2021-08-05T17:11:08Z)
• SCTN: Sparse Convolution-Transformer Network for Scene Flow Estimation [71.2856098776959]
  Estimating 3D motions for point clouds is challenging, since a point cloud is unordered and its density is significantly non-uniform. We propose a novel architecture named Sparse Convolution-Transformer Network (SCTN) that equips the sparse convolution with the transformer. We show that the learned relation-based contextual information is rich and helpful for matching corresponding points, benefiting scene flow estimation.
  arXiv  Detail & Related papers  (2021-05-10T15:16:14Z)
• LSG-CPD: Coherent Point Drift with Local Surface Geometry for Point Cloud Registration [1.8876415010297891]
  We propose a novel method called CPD with Local Surface Geometry (LSG-CPD) for rigid point cloud registration. Our method adaptively adds different levels of point-to-plane penalization on top of the point-to-point penalization based on the flatness of the local surface. It is significantly faster than modern implementations of CPD.
  arXiv  Detail & Related papers  (2021-03-28T03:46:41Z)
• Robust Kernel-based Feature Representation for 3D Point Cloud Analysis via Circular Graph Convolutional Network [2.42919716430661]
  We present a new local feature description method that is robust to rotation, density, and scale variations. To improve representations of the local descriptors, we propose a global aggregation method. Our method shows superior performances when compared to the state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-12-22T18:02: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.