Convex Color Image Segmentation with Optimal Transport Distances
From MaRDI portal
Publication:3300305
DOI10.1007/978-3-319-18461-6_21zbMath1444.94023arXiv1503.01986OpenAlexW1923899686MaRDI QIDQ3300305
Julien Rabin, Nicolas Papadakis
Publication date: 28 July 2020
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.01986
Applications of mathematical programming (90C90) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Optimal transportation (49Q22)
Related Items (14)
Graph-Based Equilibrium Metrics for Dynamic Supply–Demand Systems With Applications to Ride-sourcing Platforms ⋮ Scaling algorithms for unbalanced optimal transport problems ⋮ Stochastic approximation versus sample average approximation for Wasserstein barycenters ⋮ Template-based CT reconstruction with optimal transport and total generalized variation ⋮ A fast proximal gradient method and convergence analysis for dynamic mean field planning ⋮ Convex histogram-based joint image segmentation with regularized optimal transport cost ⋮ A stochastic multi-layer algorithm for semi-discrete optimal transport with applications to texture synthesis and style transfer ⋮ Sequential Convex Programming for Computing Information-Theoretic Minimal Partitions: Nonconvex Nonsmooth Optimization ⋮ Central limit theorems for entropy-regularized optimal transport on finite spaces and statistical applications ⋮ Asymptotic distribution and convergence rates of stochastic algorithms for entropic optimal transportation between probability measures ⋮ Coupling matrix manifolds assisted optimization for optimal transport problems ⋮ Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems ⋮ Surrogate parametric metamodel based on optimal transport ⋮ Geometric prior of multi-resolution yielding manifolds and the local closest point projection for nearly non-smooth plasticity
Cites Work
- Unnamed Item
- An inertial forward-backward algorithm for monotone inclusions
- Non-convex Relaxation of Optimal Transport for Color Transfer Between Images
- Optimal Transport with Proximal Splitting
- A Smoothed Dual Approach for Variational Wasserstein Problems
- A Variational Model for Histogram Transfer of Color Images
This page was built for publication: Convex Color Image Segmentation with Optimal Transport Distances
