Convex histogram-based joint image segmentation with regularized optimal transport cost
From MaRDI portal
Publication:1703945
DOI10.1007/s10851-017-0725-5zbMath1391.94094arXiv1610.01400OpenAlexW2528351259MaRDI QIDQ1703945
Julien Rabin, Nicolas Papadakis
Publication date: 8 March 2018
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.01400
Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items (4)
Semi-discrete optimal transport: hardness, regularization and numerical solution ⋮ Template-based CT reconstruction with optimal transport and total generalized variation ⋮ A Variational Model Dedicated to Joint Segmentation, Registration, and Atlas Generation for Shape Analysis ⋮ Discrete Optimal Transport with Independent Marginals is #P-Hard
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Fast projection onto the simplex and the \(l_1\) ball
- On the ergodic convergence rates of a first-order primal-dual algorithm
- A sparse multiscale algorithm for dense optimal transport
- On total variation minimization and surface evolution using parametric maximum flows
- Segmentation of vectorial image features using shape gradients and information measures
- An inertial forward-backward algorithm for monotone inclusions
- Globally optimal joint image segmentation and shape matching based on Wasserstein modes
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
- An algorithm for total variation minimization and applications
- Unbalanced optimal transport: dynamic and Kantorovich formulations
- On the Lambert \(w\) function
- The earth mover's distance as a metric for image retrieval
- A multiphase level set framework for image segmentation using the Mumford and Shah model
- An algorithm for mean curvature motion
- Completely convex formulation of the Chan-Vese image segmentation model
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Transportation distances on the circle
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- Sliced and Radon Wasserstein barycenters of measures
- Modelling convex shape priors and matching based on the Gromov-Wasserstein distance
- Concerning nonnegative matrices and doubly stochastic matrices
- Optimal mass transport for registration and warping
- A Smoothed Dual Approach for Variational Wasserstein Problems
- Convolutional wasserstein distances
- High-Dimension Multilabel Problems: Convex or Nonconvex Relaxation?
- Optimal approximations by piecewise smooth functions and associated variational problems
- Global Solutions of Variational Models with Convex Regularization
- Convex Color Image Segmentation with Optimal Transport Distances
- Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
- Eulerian models and algorithms for unbalanced optimal transport
- Wavelet-based level set evolution for classification of textured images
- Active contours without edges
- Image Segmentation Using Active Contours: Calculus of Variations or Shape Gradients?
- A Convex Max-Flow Approach to Distribution-Based Figure-Ground Separation
- Regularized Discrete Optimal Transport
- Imaging with Kantorovich--Rubinstein Discrepancy
- A Variational Model for Histogram Transfer of Color Images
- Mathematical problems in image processing. Partial differential equations and the calculus of variations. Foreword by Olivier Faugeras
This page was built for publication: Convex histogram-based joint image segmentation with regularized optimal transport cost
