14 search results - page 2 / 3 » Energy Efficient Routing for Statistical Inference of Markov... |
JAIR
2006
13 years 5 months ago
2006
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms have been...
ICIG
2009
IEEE
13 years 3 months ago
2009
IEEE
Optical flow estimation is one of the main subjects in computer vision. Many methods developed to compute the motion fields are built using standard heuristic formulation. In this...
CVPR
2007
IEEE
14 years 7 months ago
2007
IEEE
Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems....
CVPR
2009
IEEE
15 years 18 days ago
2009
IEEE
We introduce a new technique that can reduce any
higher-order Markov random field with binary labels into
a first-order one that has the same minima as the original.
Moreover, w...
CVPR
2009
IEEE
15 years 18 days ago
2009
IEEE
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...