103 search results - page 16 / 21 » Generalized MPU Implicits Using Belief Propagation |
EMMCVPR
2001
Springer
15 years 2 months ago
2001
Springer
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...
ICDCS
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
NIPS
2007
14 years 11 months ago
2007
Variational methods are frequently used to approximate or bound the partition or likelihood function of a Markov random field. Methods based on mean field theory are guaranteed ...
103
click to vote
PAMI
2008
14 years 9 months ago
2008
Conventional photometric stereo recovers one normal direction per pixel of the input image. This fundamentally limits the scale of recovered geometry to the resolution of the input...
CVPR
2009
IEEE
16 years 4 months 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...