Structured Analytic Mappings for Point Set Registration
About
We present an analytic approximation model for non-rigid point set registration, grounded in the multivariate Taylor expansion of vector-valued functions. By exploiting the algebraic structure of Taylor expansions, we construct a structured function space spanned by truncated basis terms, allowing smooth deformations to be represented with low complexity and explicit form. To estimate mappings within this space, we develop a quasi-Newton optimization algorithm that progressively lifts the identity map into higher-order analytic forms. This structured framework unifies rigid, affine, and nonlinear deformations under a single closed-form formulation, without relying on kernel functions or high-dimensional parameterizations. The proposed model is embedded into a standard ICP loop -- using (by default) nearest-neighbor correspondences -- resulting in Analytic-ICP, an efficient registration algorithm with quasi-linear time complexity. Experiments on 2D and 3D datasets demonstrate that Analytic-ICP achieves higher accuracy and faster convergence than classical methods such as CPD and TPS-RPM, particularly for small and smooth deformations.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| 2D Point Set Registration | Fish | Registration Time (s)4.00e-7 | 3 | |
| 2D Point Set Registration | Fish+Noise | Registration Time (s)1.20e-6 | 3 | |
| 2D Point Set Registration | Trash Can | Registration Time (s)5.70e-7 | 3 | |
| Point Set Registration | Fish 2D 91 points | Registration Residual0.048 | 3 | |
| Point Set Registration | Fish+Noise 2D 127 points | Registration Residual0.063 | 3 | |
| Point Set Registration | Trash Can 2D 359 points | Registration Residual0.129 | 3 | |
| 3D Point Cloud Registration | Cow head 2036 pts | Time31.86 | 2 | |
| 3D Point Cloud Registration | Body 4706 pts | Time (ms)69.57 | 2 |