mlsanityData to 14 Oct 2026

An approach to robust ICP initialization

arXiv 2212.05332 ↗First posted 10 Dec 2022cs.CV cs.CG math.OCcited by 2

Not on the map. Why?

Abstract (arXiv)

In this note, we propose an approach to initialize the Iterative Closest Point (ICP) algorithm to match unlabelled point clouds related by rigid transformations. The method is based on matching the ellipsoids defined by the points' covariance matrices and then testing the various principal half-axes matchings that differ by elements of a finite reflection group. We derive bounds on the robustness of our approach to noise and numerical experiments confirm our theoretical findings.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 3 of its 21 references that are in the map. First posted on arXiv 10 Dec 2022.

Builds on

3 of 21 references.

References · 3

  1. 2018Open3D: A Modern Library for 3D Data Processingcited by 721
  2. 2016Go-ICP: A Globally Optimal Solution to 3D ICP Point-Set Registrationcited by 159
  3. 2021A comprehensive survey on point cloud registrationcited by 84

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 0; 2025: 1.

2 papers.