Results 1  10
of
169,865
I. Naïve Belief Propagation Algorithm
"... One of the greatest abilities of the human eye is its capacity to perceive depth, an essential skill that allows us to perform fundamental tasks, such as avoiding obstacles and retrieving objects, as well as complicated tasks, such as driving a car. As advancements in the field of robotics allow rob ..."
Abstract
 Add to MetaCart
, introduced by Pedro Felzenszwalb of the University of Chicago, were applied to a naïve belief propagation algorithm to achieve more efficient belief propagation in depth finding. This paper provides an overview of the naïve belief propagation algorithm, the algorithm optimizations, and experimental results
Constructing Free Energy Approximations and Generalized Belief Propagation Algorithms
 IEEE Transactions on Information Theory
, 2005
"... Important inference problems in statistical physics, computer vision, errorcorrecting coding theory, and artificial intelligence can all be reformulated as the computation of marginal probabilities on factor graphs. The belief propagation (BP) algorithm is an efficient way to solve these problems t ..."
Abstract

Cited by 585 (13 self)
 Add to MetaCart
Important inference problems in statistical physics, computer vision, errorcorrecting coding theory, and artificial intelligence can all be reformulated as the computation of marginal probabilities on factor graphs. The belief propagation (BP) algorithm is an efficient way to solve these problems
Turbo decoding as an instance of Pearl’s belief propagation algorithm
 IEEE Journal on Selected Areas in Communications
, 1998
"... Abstract—In this paper, we will describe the close connection between the now celebrated iterative turbo decoding algorithm of Berrou et al. and an algorithm that has been well known in the artificial intelligence community for a decade, but which is relatively unknown to information theorists: Pear ..."
Abstract

Cited by 404 (16 self)
 Add to MetaCart
: Pearl’s belief propagation algorithm. We shall see that if Pearl’s algorithm is applied to the “belief network ” of a parallel concatenation of two or more codes, the turbo decoding algorithm immediately results. Unfortunately, however, this belief diagram has loops, and Pearl only proved that his
Implementing the Belief Propagation Algorithm in MATLAB
, 2008
"... We provide some example Matlab code as a supplement to the paper [6]. This technical report is not intended as a standalone introduction to the belief propagation algorithm, but instead only aims to provide some technical material, which didn’t fit into the paper. 1 ..."
Abstract
 Add to MetaCart
We provide some example Matlab code as a supplement to the paper [6]. This technical report is not intended as a standalone introduction to the belief propagation algorithm, but instead only aims to provide some technical material, which didn’t fit into the paper. 1
The serial and parallel belief propagation algorithms
 in Proc. IEEE Intern. Symp. on Inform. Theory
"... Abstract — It has been shown that the stable fixed points of belief propagation (BP) algorithms correspond to extrema of the Bethe free energy. In this paper, we describe the dual problem for the minimization of the Bethe free energy and solve it using simple nonlinear block GaussSeidel and Jacobi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract — It has been shown that the stable fixed points of belief propagation (BP) algorithms correspond to extrema of the Bethe free energy. In this paper, we describe the dual problem for the minimization of the Bethe free energy and solve it using simple nonlinear block GaussSeidel and Jacobi
On Robust Stability of the Belief Propagation Algorithm for LDPC Decoding
"... Abstract — The exact nonlinear loop gain of the belief propagation algorithm (BPA) in its loglikelihood ratio (LLR) formulation is computed. The nonlinear gains for regular lowdensity paritycheck (LDPC) error correcting codes can be computed exactly using a simple formula. It is shown that in some ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract — The exact nonlinear loop gain of the belief propagation algorithm (BPA) in its loglikelihood ratio (LLR) formulation is computed. The nonlinear gains for regular lowdensity paritycheck (LDPC) error correcting codes can be computed exactly using a simple formula. It is shown
On the Optimality of Solutions of the MaxProduct Belief Propagation Algorithm in Arbitrary Graphs
, 2001
"... Graphical models, suchasBayesian networks and Markov random fields, represent statistical dependencies of variables by a graph. The maxproduct "belief propagation" algorithm is a localmessage passing algorithm on this graph that is known to converge to a unique fixed point when the gra ..."
Abstract

Cited by 241 (13 self)
 Add to MetaCart
Graphical models, suchasBayesian networks and Markov random fields, represent statistical dependencies of variables by a graph. The maxproduct "belief propagation" algorithm is a localmessage passing algorithm on this graph that is known to converge to a unique fixed point when
On the Convergence of Belief Propagation Algorithm for Stochastic Networks With Loops
, 2004
"... The belief propagation (BP) algorithm is a tool with which one can calculate beliefs, marginal probabilities, of stochastic networks without loops (e.g., Bayesian networks) in a time proportional to the number of nodes. For networks with loops, it may not converge and, even if it converges, beliefs ..."
Abstract
 Add to MetaCart
The belief propagation (BP) algorithm is a tool with which one can calculate beliefs, marginal probabilities, of stochastic networks without loops (e.g., Bayesian networks) in a time proportional to the number of nodes. For networks with loops, it may not converge and, even if it converges, beliefs
Results 1  10
of
169,865