Signals 4 · free daily AI digest

Rubix: Global Correspondence-Free Point Set Alignment through Assignment Geometry

Paper recorded by Signals 4 on 2026-10-07 in cs.CV. Abstract reproduced from arXiv; link to the original below.

Published 2026-10-07 on arXiv · recorded by Signals 4 on 2026-10-08

Category: cs.CV · 计算机视觉 · first seen 2026-10-08

Abstract

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 $σ$ of two centered $n$-point sets defines a complex correlation $z_σ=\sum_i\bar x_i y_{σ(i)}$. Their convex hull is the permu

Read on arXiv →

#330 most recent of 756 cs.CV papers we have recorded · ↑ newer: GraphRectify: Graph-Based Transfer of Adversarial Example Detectors Ac · ↓ older: Self-correction Optimization for Interleaved Multimodal Generation
Cite this page: Rubix: Global Correspondence-Free Point Set Alignment through Assignment Geometry: the #330 most recent of 756 cs.CV papers we have recorded (as of 2026-10-07). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/rubix-global-correspondence-free-point-set-alignment-through-assignment-geometry.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable: papers.json
Related: More cs.CV papers · arXiv signals · All papers · Today in AI
Get 4 AI signals a day by email — free.
Subscribe free → See all plans →
Get 4 AI signals a day by email — free
All models · All repos · By company · Daily editions