Tightening MRF Relaxations with Planar Subproblems.
Julian YarkonyRagib MorshedAlexander T. IhlerCharless C. FowlkesPublished in: UAI (2011)
Keyphrases
- markov random field
- np hard
- lower bound
- graph cuts
- higher order
- energy function
- image segmentation
- linear programming
- random fields
- energy minimization
- high order
- lagrangian relaxation
- low level vision
- convex relaxation
- image restoration
- dual decomposition
- potential functions
- reducing the search space
- mrf model
- scene labeling
- parameter estimation
- upper bound
- search space
- object recognition
- maximum a posteriori
- belief propagation
- optimization problems
- prior model
- semidefinite
- planar graphs
- evolutionary algorithm
- parallel manipulator
- pairwise