A sparse algorithm for dense optimal transport

DOI10.1007/978-3-319-18461-6_50zbMath1450.65058OpenAlexW2277562018MaRDI QIDQ3300344

Bernhard Schmitzer

Publication date: 28 July 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18461-6_50

zbMATH Keywords

optimal transportsparse problemdense problemdual constraint

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Optimal transportation (49Q22)

Related Items (5)

Transport between RGB images motivated by dynamic optimal transport ⋮ A sparse multiscale algorithm for dense optimal transport ⋮ A Global Optimization Approach for Multimarginal Optimal Transport Problems with Coulomb Cost ⋮ A transportation \(L^p\) distance for signal analysis ⋮ Minimal Geodesics Along Volume-Preserving Maps, Through Semidiscrete Optimal Transport

Uses Software

• LEMON
• EMD

Cites Work

• Unnamed Item
• Unnamed Item
• The earth mover's distance as a metric for image retrieval
• Perspectives of Monge properties in optimization
• A linear optimal transportation framework for quantifying and visualizing variations in sets of images
• A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
• Optimal mass transport for registration and warping
• From Knothe's Transport to Brenier's Map and a Continuation Method for Optimal Transport
• Finding Minimum-Cost Circulations by Successive Approximation
• Optimal Transport

This page was built for publication: A sparse algorithm for dense optimal transport