Convex multi-class image labeling by simplex-constrained total variation

  • Lellmann J
  • Kappes J
  • Yuan J
 et al. 
  • 34

    Readers

    Mendeley users who have this article in their library.
  • 69

    Citations

    Citations of this article.

Abstract

Multi-class labeling is one of the core problems in image analysis. We show how this combinatorial problem can be approximately solved using tools from convex optimization. We suggest a novel functional based on a multidimensional total variation formulation, allowing for a broad range of data terms. Optimization is carried out in the operator splitting framework using Douglas-Rachford Splitting. In this connection, we compare two methods to solve the Rudin-Osher-Fatemi type subproblems and demonstrate the performance of our approach on single- and multichannel images.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Jan Lellmann

  • Jörg Kappes

  • Jing Yuan

  • Florian Becker

  • Christoph Schnörr

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free