Metraipolis › archive › dc_65e80104cd19
Rubix: Global Correspondence-Free Point Set Alignment through Assignment Geometry — arXiv:2610.10408
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.10408
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T12:37:36.153Z
- SHA-256 of the archived text
8fd760fd59ecae4d28a8924a7e346ed9d6e76797372ceb547e3f2e9f7120176e- Stable URL of this page
https://metraipolis.com/documento/dc_65e80104cd19
How to cite
Rubix: Global Correspondence-Free Point Set Alignment through Assignment Geometry — arXiv:2610.10408 — arXiv (en), https://arxiv.org/abs/2610.10408 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_65e80104cd19 (Metraipolis archive dc_65e80104cd19, sha256 8fd760fd59ecae4d28a8924a7e346ed9d6e76797372ceb547e3f2e9f7120176e)
BibTeX
@misc{dc65e80104cd19,
title = {Rubix: Global Correspondence-Free Point Set Alignment through Assignment Geometry — arXiv:2610.10408},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.10408},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_65e80104cd19; sha256 8fd760fd59ecae4d28a8924a7e346ed9d6e76797372ceb547e3f2e9f7120176e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.10408. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Procrustes-Wasserstein alignment jointly estimates a matching and rotation without supplied correspondences, but alternating minimization can stop at suboptimal solutions. Rubix solves the equally weighted planar problem globally under squared Euclidean loss. Each matching $\sigma$ of two centered $n$-point sets defines a complex correlation $z_\sigma=\sum_i\bar x_i y_{\sigma(i)}$. Their convex hull is the permutation polygon: supporting vertices give optimal matchings at fixed rotations, and the farthest vertex gives the global alignment. We prove the sharp bound of $n(n-1)$ vertices for $n\ge2$, answering Rote's rotation-assignment open problem. In exact arithmetic, assignment queries recover the polygon in $\mathcal O(n^5)$ operations. Assignment-based bounds extend the approach to three-dimensional rotations and partial matching at a supplied translation through branch-and-bound. On timed MPEG-7 shape pairs, Rubix attains every numerical reference value in 12 ms on average, 50 times faster than a rotation grid at the same accuracy. Its distances improve gravity-aligned matching of real 3D scans, shape retrieval and noisy crystal classification over alternating minimization.
Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Computer Vision and Pattern Recognition (cs.CV) ; Computational Geometry (cs.CG); Machine Learning (cs.LG); Robotics (cs.RO); Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.10408 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T12:14:15.470Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).