Sciweavers

21 search results - page 1 / 5
» Globally Optimal Solutions for Energy Minimization in Stereo...
Sort
View
ICCV
2005
IEEE
14 years 6 months ago
Globally Optimal Solutions for Energy Minimization in Stereo Vision Using Reweighted Belief Propagation
A wide range of low level vision problems have been formulated in terms of finding the most probable assignment of a Markov Random Field (or equivalently the lowest energy configu...
Talya Meltzer, Chen Yanover, Yair Weiss
ECCV
2008
Springer
14 years 3 months ago
Toward Global Minimum through Combined Local Minima
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
CVPR
2012
IEEE
11 years 7 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
CVPR
2005
IEEE
13 years 10 months ago
Symmetric Stereo Matching for Occlusion Handling
In this paper, we propose a symmetric stereo model to handle occlusion in dense two-frame stereo. Our occlusion reasoning is directly based on the visibility constraint that is mo...
Jian Sun, Yin Li, Sing Bing Kang
ECCV
2006
Springer
14 years 6 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...