نسخة أولية وصول مفتوح
Rubix: Global Correspondence-Free Point Set Alignment through Assignment Geometry
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 c …