Minimizing Sparse High-Order Energies by Submodular Vertex-Cover.
Andrew DelongOlga VekslerAnton OsokinYuri BoykovPublished in: NIPS (2012)
Keyphrases
- high order
- vertex cover
- higher order
- approximation algorithms
- markov random field
- pairwise
- planar graphs
- partial order
- low order
- tensor decomposition
- graph cuts
- bayesian logistic regression
- precedence constraints
- energy minimization
- lower order
- polynomial time approximation
- computer vision
- optimality criterion
- image segmentation
- log likelihood
- greedy algorithm
- conditional random fields
- scheduling problem
- high dimensional
- reinforcement learning
- tensor analysis