mlsanityData to 14 Oct 2026

Robust affine point matching via quadratic assignment on Grassmannians

arXiv 2303.02698 ↗First posted 5 Mar 2023cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

Robust Affine Matching with Grassmannians (RoAM) is a new algorithm to perform affine registration of point clouds. The algorithm is based on minimizing the Frobenius distance between two elements of the Grassmannian. For this purpose, an indefinite relaxation of the Quadratic Assignment Problem (QAP) is used, and several approaches to affine feature matching are studied and compared. Experiments demonstrate that RoAM is more robust to noise and point discrepancy than previous methods.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 20 references that are in the map. First posted on arXiv 5 Mar 2023.

Builds on

4 of 20 references.

References · 4

  1. 2021A comprehensive survey on point cloud registrationcited by 84
  2. 2014Graph Matching: Relax at Your Own Riskcited by 27
  3. 2016A Grassmannian Graph Approach to Affine Invariant Feature Matchingcited by 2
  4. 2022An approach to robust ICP initializationcited by 2

Built on by

Not cited yet.