Introduction
Point cloud registration—the process of aligning two sets of spatial data—is a fundamental task in computer vision, robotics, and medical imaging. While the Iterative Closest Point (ICP) algorithm has long been the standard, its reliance on point-to-point correspondences makes it fragile when faced with noise, varying sampling densities, or partial overlaps. This paper introduces a paradigm shift: treating point clouds not as discrete sets, but as samples from underlying algebraic varieties (sets defined by polynomial equations).
The Correspondence Problem
Traditional registration methods attempt to find an optimal transformation by matching specific points in a source scan to their nearest neighbors in a target scan. This approach breaks down when the scans represent different parts of the same object or contain significant noise.
By moving from "matching points" to "matching geometry," the authors propose aligning the polynomial equations that describe the surfaces. If two scans represent different segments of the same underlying variety, they can be registered even with zero physical overlap between the point sets.
Methods: Riemannian Optimization
The proposed pipeline consists of two primary stages, both leveraging optimization on smooth geometric manifolds.
1. Algebraic Variety Identification (Denoising)
The first step involves approximating the noisy point cloud with a smooth algebraic variety. Points are mapped into a higher-dimensional space of polynomial features. The algorithm then searches the Grassmann manifold—the space of all $q$-dimensional subspaces—to find the set of equations that best "vanish" on the data.
This process effectively "snaps" noisy points to a smooth underlying surface, providing a denoised representation that is easier to align. To ensure accuracy without ground truth, the paper utilizes Stein’s Unbiased Risk Estimate (SURE) to estimate denoising error.
2. Registration
Once the varieties are identified, the algorithm seeks the rigid transformation (rotation $Q$ and translation $a$) that minimizes the distance between the source points and the target variety. This optimization is performed on the orthogonal group $O(n)$ using second-order Riemannian trust-region methods, which provide fast convergence and theoretical guarantees for finding critical points.
Key Results and Discussion
The method was evaluated on synthetic 2D/3D shapes and real-world dental tomography scans:
- Robustness to Noise: The algorithm maintained high accuracy in synthetic tests even under significant Gaussian noise ($\sigma = 0.1$).
- Handling Non-Overlap: Unlike ICP, this method successfully registered point clouds with zero overlap, provided they shared the same underlying algebraic structure.
- Real-World Application: On complex 3D dental surfaces, the algorithm achieved residual errors of approximately $10^{-1}$, demonstrating its viability for biological data.
Conclusion and Future Work
By utilizing the geometric properties of manifolds and algebraic varieties, this approach offers a robust alternative to correspondence-based registration. However, challenges remain regarding the "curse of dimensionality" as polynomial degrees increase, which can lead to exponential growth in computational cost. Future research will focus on using orthogonal polynomial bases to improve numerical stability and stochastic Riemannian methods to scale the algorithm for massive datasets.
Summary updated