Directly to content
  1. Publishing |
  2. Search |
  3. Browse |
  4. Recent items rss |
  5. Open Access |
  6. Jur. Issues |
  7. DeutschClear Cookie - decide language by browser settings

Convex Multi-Class Image Labeling by Simplex-Constrained Total Variation

Lellmann, Jan ; Kappes, Jörg ; Yuan, Jing ; Becker, Florian ; Schnörr, Christoph

[thumbnail of lellmann08multiclasstv1.pdf]
PDF, German
Download (2MB) | Terms of use

Citation of documents: Please do not cite the URL that is displayed in your browser location input, instead use the DOI, URN or the persistent URL below, as we can guarantee their long-time accessibility.


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.

Document type: Preprint
Series Name: IWR-Preprints
Date Deposited: 06 Nov 2008 14:04
Date: 2008
Faculties / Institutes: Service facilities > Interdisciplinary Center for Scientific Computing
DDC-classification: 510 Mathematics
Controlled Keywords: Bildverarbeitung, Konvexe Optimierung, Diskrete Optimierung, Funktion von beschränkter Variation
About | FAQ | Contact | Imprint |
OA-LogoDINI certificate 2013Logo der Open-Archives-Initiative