Continuous Multiclass Labeling Approaches and Algorithms

DOI10.1137/100805844zbMath1231.90311arXiv1102.5448OpenAlexW2140843581MaRDI QIDQ3113848

Jan Lellmann, Christoph Schnörr

Publication date: 25 January 2012

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.5448

zbMATH Keywords

total variationnonsmooth optimizationvariational methodssplitting methodssegmentationconvex relaxationsaddle point problemcontinuous cut

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Combinatorial optimization (90C27) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical methods of relaxation type (49M20)

Related Items (30)

Inverse scale space iterations for non-convex variational problems using functional lifting ⋮ Image segmentation based on the hybrid total variation model and the \(K\)-means clustering strategy ⋮ Convex Regularization of Discrete-Valued Inverse Problems ⋮ Multicuts and perturb \& MAP for probabilistic graph clustering ⋮ Coupling image restoration and segmentation: a generalized linear model/Bregman perspective ⋮ Recent advances of variational models in medical imaging and applications to computer aided surgery ⋮ Completely convex formulation of the Chan-Vese image segmentation model ⋮ Globally optimal joint image segmentation and shape matching based on Wasserstein modes ⋮ Iterative multiplicative filters for data labeling ⋮ Inverse scale space iterations for non-convex variational problems: the continuous and discrete case ⋮ Image labeling by assignment ⋮ Variational image segmentation models involving non-smooth data-fidelity terms ⋮ Probabilistic Correlation Clustering and Image Partitioning Using Perturbed Multicuts ⋮ Lifting Methods for Manifold-Valued Variational Problems ⋮ Assignment Flows ⋮ Optimality bounds for a variational relaxation of the image partitioning problem ⋮ Convex relaxation of a class of vertex penalizing functionals ⋮ Multi-class transductive learning based on \(\ell^1\) relaxations of Cheeger cut and Mumford-Shah-Potts model ⋮ Discrete and continuous models for partitioning problems ⋮ An introduction to continuous optimization for imaging ⋮ Effective two-stage image segmentation: a new non-Lipschitz decomposition approach with convergent algorithm ⋮ Sequential Convex Programming for Computing Information-Theoretic Minimal Partitions: Nonconvex Nonsmooth Optimization ⋮ Linkage Between Piecewise Constant Mumford--Shah Model and Rudin--Osher--Fatemi Model and Its Virtue in Image Segmentation ⋮ On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex ⋮ Modelling convex shape priors and matching based on the Gromov-Wasserstein distance ⋮ Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements: the multivariate case ⋮ Shearlets: Theory and Applications ⋮ Continuous-domain assignment flows ⋮ Convex multiclass segmentation with shearlet regularization ⋮ Piecewise-smooth image segmentation models with \(L^1\) data-fidelity terms

Uses Software

• NESTA

This page was built for publication: Continuous Multiclass Labeling Approaches and Algorithms