2013
DOI: 10.1007/s11263-013-0619-y
|View full text |Cite
|
Sign up to set email alerts
|

A Survey and Comparison of Discrete and Continuous Multi-label Optimization Approaches for the Potts Model

Abstract: We present a survey and a comparison of a variety of algorithms that have been proposed over the years to minimize multi-label optimization problems based on the Potts model. Discrete approaches based on Markov Random Fields as well as continuous optimization approaches based on partial differential equations can be applied to the task. In contrast to the case of binary labeling, the multi-label problem is known to be NP hard and thus one can only expect near-optimal solutions. In this paper, we carry out a th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
52
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 53 publications
(52 citation statements)
references
References 49 publications
0
52
0
Order By: Relevance
“…Typically the projected solution deviates less than 1% from the optimal energy, i.e. the results are very close to global optimality [20].…”
Section: Methodsmentioning
confidence: 70%
See 3 more Smart Citations
“…Typically the projected solution deviates less than 1% from the optimal energy, i.e. the results are very close to global optimality [20].…”
Section: Methodsmentioning
confidence: 70%
“…However, a computationally tractable convex relaxation of this functional has been proposed in [3,4,12,22,34]. For more information and implementation details see [20]. Due to the convexity of the problem the resulting solutions have the following properties: Firstly, the segmentation is independent of the initialization.…”
Section: Minimization Via Convex Relaxationmentioning
confidence: 99%
See 2 more Smart Citations
“…Furthermore, the primal dual algorithm [4] used for solving the continuous saddle-point problem is defined point-wise and can thus be parallelized in a straight-forward manner and run in parallel using modern GPU's or other parallel architectures. For a detailed discussion see [19,11].…”
Section: Input Imagementioning
confidence: 99%