Sciweavers

46 search results - page 6 / 10
» Exact Loopy Belief Propagation on Euler Graphs
Sort
View
TIT
2008
129views more  TIT 2008»
13 years 7 months ago
Serial Schedules for Belief-Propagation: Analysis of Convergence Time
Abstract--Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation algorithm over the factor graph of the code. In the traditional messa...
Jacob Goldberger, Haggai Kfir
JAIR
2006
143views more  JAIR 2006»
13 years 7 months ago
Convexity Arguments for Efficient Minimization of the Bethe and Kikuchi Free Energies
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...
Tom Heskes
NIPS
2008
13 years 9 months ago
Bounds on marginal probability distributions
We propose a novel bound on single-variable marginal probability distributions in factor graphs with discrete variables. The bound is obtained by propagating local bounds (convex ...
Joris M. Mooij, Hilbert J. Kappen
NIPS
2003
13 years 8 months ago
Pairwise Clustering and Graphical Models
Significant progress in clustering has been achieved by algorithms that are based on pairwise affinities between the datapoints. In particular, spectral clustering methods have ...
Noam Shental, Assaf Zomet, Tomer Hertz, Yair Weiss
FGR
2008
IEEE
346views Biometrics» more  FGR 2008»
14 years 1 months ago
Markov random field models for hair and face segmentation
This paper presents an algorithm for measuring hair and face appearance in 2D images. Our approach starts by using learned mixture models of color and location information to sugg...
Kuang-chih Lee, Dragomir Anguelov, Baris Sumengen,...