How Hard Is the LP Relaxation of the Potts Min-Sum Labeling Problem?
Daniel PrusaTomás WernerPublished in: EMMCVPR (2014)
Keyphrases
- min cut
- graph cuts
- min sum
- lp relaxation
- image segmentation
- markov random field
- energy minimization
- linear programming
- message passing
- linear program
- belief propagation
- feasible solution
- integer programming
- energy function
- shape prior
- pairwise
- integer program
- np hard
- optimal solution
- knapsack problem
- information theoretic
- graph partitioning
- maximum a posteriori
- multi label
- global constraints
- interior point
- computer vision
- bayesian networks
- figure ground
- scheduling problem