A Compact Linear Programming Relaxation for Binary Sub-modular MRF.
Junyan WangSai-Kit YeungPublished in: EMMCVPR (2014)
Keyphrases
- linear programming relaxation
- binary variables
- knapsack problem
- linear programming
- lower bound
- markov random field
- integer programming
- column generation
- mixed integer programming
- integer solution
- branch and bound
- feasible solution
- integer program
- graph cuts
- valid inequalities
- upper bound
- linear program
- energy function
- cutting plane
- image segmentation
- energy minimization
- branch and bound algorithm
- belief propagation
- objective function