195 search results - page 27 / 39 » Fusion Moves for Markov Random Field Optimization |
137
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
We introduce a novel data-driven mean-shift belief propagation
(DDMSBP) method for non-Gaussian MRFs, which
often arise in computer vision applications. With the aid
of scale sp...
NIPS
2007
15 years 1 months ago
2007
We give a new class of outer bounds on the marginal polytope, and propose a cutting-plane algorithm for efficiently optimizing over these constraints. When combined with a concav...
MICCAI
2010
Springer
14 years 10 months ago
2010
Springer
In this paper, we introduce a novel approach to bridge the gap between the landmark-based and the iconic-based voxel-wise registration methods. The registration problem is formulat...
193
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
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...
110
click to vote
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
In recent years the Markov Random Field (MRF) has
become the de facto probabilistic model for low-level vision
applications. However, in a maximum a posteriori
(MAP) framework, ...