Graph cuts always find a global optimum (with a catch).
Hunter LangDavid A. SontagAravindan VijayaraghavanPublished in: CoRR (2020)
Keyphrases
- global optimum
- graph cuts
- simulated annealing
- global convergence
- objective function
- markov random field
- energy function
- optimization method
- belief propagation
- energy minimization
- shape prior
- search space
- image segmentation
- optimal solution
- segmentation algorithm
- spatial coherence
- object segmentation
- global solution
- interactive image segmentation
- multi label
- step size
- mean shift
- loopy belief propagation
- graph cut optimization
- interactive segmentation
- labeling problems
- neural network
- graph based image segmentation
- minimum cut
- genetic algorithm
- message passing
- optimization algorithm
- energy minimization framework
- mrf optimization
- computational complexity