A Compact Linear Programming Relaxation for Binary Sub-modular MRF.
Junyan WangSai-Kit YeungPublished in: CoRR (2014)
Keyphrases
- linear programming relaxation
- binary variables
- knapsack problem
- lower bound
- linear programming
- markov random field
- mixed integer programming
- integer solution
- branch and bound
- column generation
- feasible solution
- energy function
- integer programming
- integer program
- valid inequalities
- graph cuts
- higher order
- cutting plane
- optimal solution
- dynamic programming
- optimization problems
- parameter estimation
- energy minimization
- constraint satisfaction
- linear program
- random variables
- image restoration
- simulated annealing
- np hard
- search algorithm