Tight convex relaxations for vector-valued labeling
From MaRDI portal
Publication:2873255
Recommendations
- Continuous multiclass labeling approaches and algorithms
- High-dimension multilabel problems: convex or nonconvex relaxation?
- Convex relaxation of vectorial problems with coupled regularization
- A narrow band method for the convex formulation of discrete multilabel problems
- scientific article; zbMATH DE number 2040634
Cited in
(15)- Midrange geometric interactions for semantic segmentation. Constraints for continuous multi-label optimization
- Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements: the multivariate case
- Discrete and continuous models for partitioning problems
- Efficient global minimization methods for image segmentation models with four regions
- Global minimization of Markov random fields with applications to optical flow
- High-dimension multilabel problems: convex or nonconvex relaxation?
- An introduction to continuous optimization for imaging
- Continuous multiclass labeling approaches and algorithms
- A narrow band method for the convex formulation of discrete multilabel problems
- Lifting methods for manifold-valued variational problems
- A convex max-flow approach to distribution-based figure-ground separation
- Convex relaxation of vectorial problems with coupled regularization
- scientific article; zbMATH DE number 2040634 (Why is no real title available?)
- A second-order TV-type approach for inpainting and denoising higher dimensional combined cyclic and vector space data
- scientific article; zbMATH DE number 1844608 (Why is no real title available?)
This page was built for publication: Tight convex relaxations for vector-valued labeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2873255)
