arXiv Computer Vision By Xiang Gu, Jian Sun, Zongben Xu

Coupled Optimal Transport with Landmark Constraints

Read the original on arXiv Computer Vision →

arXiv:2608. 19783v1 Announce Type: new Abstract: Existing optimal transport (OT) models primarily seek an OT map or plan between distributions by minimizing a prescribed transport cost or distortion.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computer Vision.

Hugging Face Trending Papers
Aug 20

Coupled Optimal Transport with Landmark Constraints

Existing optimal transport (OT) models primarily seek an OT map or plan between distributions by minimizing a prescribed transport cost or distortion. However, minimizing transport cost or distortion alone may fail to identify a geometrically meaningful transformation between the two distributions.

arXiv Computer Vision
Sep 11

BridgeMatch: Conditional Transport Bridges in Matching Matrix Space for 3D Deformable Registration

BridgeMatch is a two‑stage generative solver that preserves the full soft matching matrix for 3D deformable registration. Stage I uses denoising diffusion to estimate a global matching matrix at a coarse resolution, then lifts it to high resolution while maintaining hierarchy and rank constraints. Stage II refines this lifted matrix via a conditional transport bridge, implemented with either a deterministic Flow Matching ODE or a stochastic Brownian‑bridge SDE, and demonstrates improved correspondence accuracy and registration performance on 4DMatch, 4DLoMatch, CAPE, and DeepDeform datasets, especially in low‑overlap scenarios.

By Qianliang Wu, Haobo Jiang, Guangwei Gao, Shuo Chen, Jin Xie, Jian Yang, Yaqing Ding
arXiv Machine Learning
Aug 4

Beckmann Transport Models: From Autonomous Flows to One-Step Maps

arXiv:2608. 01692v1 Announce Type: new Abstract: We propose an instantiation of flow matching that relies on a time-independent velocity field (an \emph{autonomous flow}) to exactly map between two distributions, so long as the target is singular, i.

By Lee Cheuk-Kit, Florentin Coeurdoux, Peter Potaptchik, Yilun Du, Michael Samuel Albergo, Eric Vanden-Eijnden