How to calculate partition functions using convex programming hierarchies: provable bounds for variational methods.
Andrej RisteskiPublished in: COLT (2016)
Keyphrases
- convex programming
- variational methods
- convex functions
- optic flow
- linear programming
- interior point methods
- convex optimization
- approximate inference
- level set
- upper bound
- worst case
- curve evolution
- lower bound
- optical flow estimation
- image sequences
- graphical models
- computer vision
- primal dual
- semidefinite programming
- multiscale
- image processing