Graph-based simplex method for pairwise energy minimization with binary variables.
Daniel PrusaPublished in: CVPR (2015)
Keyphrases
- energy minimization
- simplex method
- binary variables
- pairwise
- linear program
- energy function
- markov random field
- problems in computer vision
- linear programming
- belief propagation
- semi supervised
- graph cuts
- higher order
- similarity measure
- convergence rate
- linear programming relaxation
- column generation
- image segmentation
- optimal solution
- np hard
- mixed integer
- image restoration
- objective function
- mixed integer programming
- primal dual
- interior point methods
- knapsack problem
- continuous variables
- feasible solution
- random variables
- feature space
- convex functions
- dynamic programming
- markov chain
- metaheuristic