Image segmentation via L₁ Monge-Kantorovich problem

DOI10.3934/IPI.2019037MaRDI QIDQ2316360zbMATH OpenOpenAlexFDO

Authors Yupeng Li, Wuchen Li, Guo Cao

Publication date 26 July 2019

Published in Inverse Problems and Imaging (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3934/ipi.2019037

zbMATH Keywords

\(L_1\) Monge-Kantorovich problemimage segmentationoptimal transportprimal-dual algorithm

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• A parallel method for earth mover's distance
• Convex color image segmentation with optimal transport distances
• Multilevel optimal transport: a fast approximation of Wasserstein-1 distances
• A review of optimal transport in image processing
• Metric-preserving reduction of earth mover's distance

Cited in

(9)

• Computing the Kantorovich distance for images
• Convex histogram-based joint image segmentation with regularized optimal transport cost
• A transportation \(L^p\) distance for signal analysis
• A parallel method for earth mover's distance
• Existence and uniqueness of optimal transport maps obtained by the secondary variational method
• Convex color image segmentation with optimal transport distances
• A review of optimal transport in image processing
• On the computation of Kantorovich-Wasserstein distances between two-dimensional histograms by uncapacitated minimum cost flows
• Imaging with Kantorovich-Rubinstein discrepancy

This page was built for publication: Image segmentation via \(L_1\) Monge-Kantorovich problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2316360)