Statistical Priors for Efficient Combinatorial Optimization Via Graph Cuts.
Daniel CremersLeo J. GradyPublished in: ECCV (3) (2006)
Keyphrases
- combinatorial optimization
- graph cuts
- traveling salesman problem
- energy function
- energy minimization
- combinatorial optimization problems
- markov random field
- metaheuristic
- labeling problems
- simulated annealing
- belief propagation
- optimization problems
- spatial coherence
- object segmentation
- shape prior
- image segmentation
- interactive segmentation
- multi label
- graph cut optimization
- maximum a posteriori
- segmentation algorithm
- branch and bound
- graphical models
- loopy belief propagation
- cost function
- evolutionary algorithm
- image processing
- graph cut segmentation
- energy minimization problems
- genetic algorithm