mlsanityData to 7 Oct 2026

Registration of algebraic varieties using Riemannian optimization

arXiv 2401.08562 ↗First posted 16 Jan 2024math.OC cs.CVcited by 1

Not on the map. Why?

Abstract (arXiv)

We consider the point cloud registration problem, the task of finding a transformation between two point clouds that represent the same object but are expressed in different coordinate systems. Our approach is not based on a point-to-point correspondence, matching every point in the source point cloud to a point in the target point cloud. Instead, we assume and leverage a low-dimensional nonlinear geometric structure of the data. Firstly, we approximate each point cloud by an algebraic variety (a set defined by finitely many polynomial equations). This is done by solving an optimization problem on the Grassmann manifold, using a connection between algebraic varieties and polynomial bases. Secondly, we solve an optimization problem on the orthogonal group to find the transformation (rotation + translation) which makes the two algebraic varieties overlap. We use second-order Riemannian optimization methods for the solution of both steps. Numerical experiments on real and synthetic data are provided, with encouraging results. Our approach is particularly useful when the two point clouds describe different parts of an objects (which may not even be overlapping), on the condition that the surface of the object may be well approximated by a set of polynomial equations. The first procedure -- the approximation -- is of independent interest, as it can be used for denoising data that belongs to an algebraic variety. We provide statistical guarantees for the estimation error of the denoising using Stein's unbiased estimator.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 9 of its 34 references that are in the map. First posted on arXiv 16 Jan 2024.

Builds on

9 of 34 references.

References · 9

  1. 2013Manopt, a Matlab toolbox for optimization on manifoldscited by 112
  2. 2016Pymanopt: A Python Toolbox for Optimization on Manifolds using Automatic Differentiationcited by 93
  3. 2017Sub-sampled Cubic Regularization for Non-convex Optimizationcited by 63
  4. 2016Global rates of convergence for nonconvex optimization on manifoldscited by 61
  5. 2017Newton-Type Methods for Non-Convex Optimization Under Inexact Hessian Informationcited by 41
  6. 2019The Theory Behind Overfitting, Cross Validation, Regularization, Bagging, and Boosting: Tutorialcited by 22
  7. 2013Global registration of multiple point clouds using semidefinite programmingcited by 17
  8. 2017Algebraic Variety Models for High-Rank Matrix Completioncited by 11
  9. 2021Nonlinear matrix recovery using optimization on the Grassmann manifoldcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.