High-Dimension Multilabel Problems: Convex or Nonconvex Relaxation?

DOI10.1137/120900307zbMath1281.65038OpenAlexW2002233138MaRDI QIDQ2873299

Romain Yildizoğlu, Nicolas Papadakis, Jean-François Aujol, Vincent Caselles

Publication date: 23 January 2014

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

Full work available at URL: https://doi.org/10.1137/120900307

zbMATH Keywords

algorithmimage processingnumerical experimentssegmentationconvex relaxationmultilabel problemsdisparity and optical flow

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (4)

On the application of the spectral projected gradient method in image segmentation ⋮ A variational aggregation framework for patch-based optical flow estimation ⋮ Convex histogram-based joint image segmentation with regularized optimal transport cost ⋮ Energy Minimization Methods

This page was built for publication: High-Dimension Multilabel Problems: Convex or Nonconvex Relaxation?