Coupled Optimal Transport with Landmark Constraints
Not on the map. Why?
Abstract (arXiv)
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. To address this limitation, this paper proposes a novel coupled OT framework that leverages a small number of annotated landmarks to guide the recovery of an underlying deformation governing the distribution transformation. The coupled OT framework integrates the optimization of the transport plan and the deformation field into a unified model, where the landmark-guided deformation field and the cost-driven transport plan are coupled through a mutual-consistency constraint. As a result, the deformation is jointly determined by the annotated landmarks and cost-driven distribution matching. The proposed framework provides a principled connection between landmark-based registration and transport-based distribution matching, enabling the recovery of transport maps from sparse geometric supervision. We establish the well-definedness of the proposed model in a general variational setting and develop a finite-element-based numerical algorithm for computation whose convergence properties are systematically analyzed. The practical effectiveness of the proposed approach is verified in shape matching.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 10 of its 27 references that are in the map. First posted on arXiv 20 Aug 2026.
Builds on
10 of 27 references.
References · 10
- 2022Flow Matching for Generative Modelingcited by 5,426
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2015Optimal Transport for Domain Adaptationcited by 457
- 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 219
- 2015Optimal Entropy-Transport problems and a new Hellinger-Kantorovich distance between positive measurescited by 138
- 2020Robust Optimal Transport with Applications in Generative Modeling and Domain Adaptationcited by 86
- 2020Outlier-Robust Optimal Transportcited by 45
- 2015Diffeomorphic density matching by optimal information transportcited by 7
- 2016Generalized Sinkhorn iterations for regularizing inverse problems using optimal mass transportcited by 7
- 2022Supervised Optimal Transportcited by 4
Built on by
Not cited yet.