Continuous multiclass labeling approaches and algorithms
We study convex relaxations of the image labeling problem on a continuous domain with regularizers based on metric interaction potentials. The generic framework ensures existence of minimizers and covers a wide range of relaxations of the original combinatorial problem. We focus on two specific rela...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
November 22, 2011
|
| In: |
SIAM journal on imaging sciences
Year: 2011, Volume: 4, Issue: 4, Pages: 1049-1096 |
| ISSN: | 1936-4954 |
| DOI: | 10.1137/100805844 |
| Online Access: | Resolving-System, Volltext: http://dx.doi.org/10.1137/100805844 Verlag, Volltext: https://epubs.siam.org/doi/abs/10.1137/100805844 
|
| Author Notes: | J. Lellmann and C. Schnörr |
| Summary: | We study convex relaxations of the image labeling problem on a continuous domain with regularizers based on metric interaction potentials. The generic framework ensures existence of minimizers and covers a wide range of relaxations of the original combinatorial problem. We focus on two specific relaxations that differ in flexibility and simplicity—one can be used to tightly relax any metric interaction potential, while the other covers only Euclidean metrics but requires less computational effort. For solving the nonsmooth discretized problem, we propose a globally convergent Douglas-Rachford scheme and show that a sequence of dual iterates can be recovered in order to provide a posteriori optimality bounds. In a quantitative comparison to two other first-order methods, the approach shows competitive performance on synthetic and real-world images. By combining the method with an improved rounding technique for nonstandard potentials, we were able to routinely recover integral solutions within 1%-5% of the global optimum for the combinatorial image labeling problem. |
|---|---|
| Item Description: | Gesehen am 29.08.2018 |
| Physical Description: | Online Resource |
| ISSN: | 1936-4954 |
| DOI: | 10.1137/100805844 |