mlsanityData to 14 Oct 2026

Structured Analytic Coherent Point Drift for Non-Rigid Point Set Registration

arXiv 2605.00934 ↗First posted 1 May 2026cs.LG cs.CV stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Coherent Point Drift (CPD) is a representative probabilistic framework for unsupervised non-rigid point set registration. Its standard non-rigid M-step, however, relies on a point-indexed Gaussian-kernel system whose size grows with the number of moving points, making deformation estimation computationally heavy for large point sets and difficult to control in complexity during registration. To address these limitations, we propose Analytic-CPD, a new unsupervised non-rigid registration framework that gives CPD a structured analytic reformulation. Analytic-CPD preserves the CPD posterior correspondence layer, but lifts the M-step from point-indexed kernel displacement estimation to structured analytic mapping estimation. By coupling the Gaussian-mixture posterior mechanism of CPD with Structured Analytic Mappings (SAM), the method obtains a deformation model whose coefficient dimension is governed by the ambient dimension and analytic order rather than by the number of moving points. More importantly, deformation estimation is organized over an interpretable hierarchy of analytic function spaces, so the analytic order can be increased progressively as posterior correspondences become more reliable. We implement this idea through an increasing-degree continuation strategy with decreasing stage lengths: low-order analytic maps first stabilize the posterior correspondence structure, while higher-order modes later refine nonlinear residual deformation. Experiments on controlled model-matched, smooth model-mismatch, and registered human-shape data demonstrate the effectiveness and favorable accuracy--efficiency performance of Analytic-CPD.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 10 of its 41 references that are in the map. First posted on arXiv 1 May 2026.

Builds on

10 of 41 references.

References · 10

  1. 2016Go-ICP: A Globally Optimal Solution to 3D ICP Point-Set Registrationcited by 159
  2. 2022KISS-ICP: In Defense of Point-to-Point ICP -- Simple, Accurate, and Robust Registration If Done the Right Waycited by 132
  3. 2020Fast and Robust Iterative Closest Pointcited by 67
  4. 2018FilterReg: Robust and Efficient Probabilistic Point-Set Registration using Gaussian Filter and Twist Parameterizationcited by 43
  5. 2023MedShapeNet -- A Large-Scale Dataset of 3D Medical Shapes for Computer Visioncited by 32
  6. 2016Joint Alignment of Multiple Point Sets with Batch and Incremental Expectation-Maximizationcited by 19
  7. 2020Rigid and Articulated Point Registration with Expectation Conditional Maximizationcited by 11
  8. 2022KSS-ICP: Point Cloud Registration based on Kendall Shape Spacecited by 10
  9. 2024Correspondence-Free Non-Rigid Point Set Registration Using Unsupervised Clustering Analysiscited by 10
  10. 2026Structured Analytic Mappings for Point Set Registrationcited by 1

Built on by

Not cited yet.