Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...
We address visual correspondence problems without assuming that scene points have similar intensities in different views.This situation is common, usually due to non-lambertian sc...
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...