Results 1 - 10 of 6,060

Factor Graphs and the Sum-Product Algorithm

by Frank R. Kschischang, Brendan J. Frey, Hans-Andrea Loeliger - IEEE TRANSACTIONS ON INFORMATION THEORY , 1998
"... A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple c ..."
Abstract - Cited by 1791 (69 self) - Add to MetaCart
A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple

An Introduction to Factor Graphs

by Hans-Andrea Loeliger - IEEE SIGNAL PROCESSING MAG., JAN. 2004 , 2004
"... A large variety of algorithms in coding, signal processing, and artificial intelligence may be viewed as instances of the summary-product algorithm (or belief/probability ..."
Abstract - Cited by 197 (34 self) - Add to MetaCart
A large variety of algorithms in coding, signal processing, and artificial intelligence may be viewed as instances of the summary-product algorithm (or belief/probability

Constructing Free Energy Approximations and Generalized Belief Propagation Algorithms

by Jonathan S. Yedidia, William T. Freeman, Yair Weiss - IEEE Transactions on Information Theory , 2005
"... Important inference problems in statistical physics, computer vision, error-correcting 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, error-correcting 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

Kalman filters, factor graphs, and . . .

by Pascal O. Vontobel , 2002
"... This post-diploma project highlights connections between Kalman filters, factor graphs, and ..."
Abstract - Add to MetaCart
This post-diploma project highlights connections between Kalman filters, factor graphs, and

On factor graphs and the Fourier transform

by Yongyi Mao, Frank R. Kschischang - IN IEEE TRANS. INFORM. THEORY , 2005
"... We introduce the concept of convolutional factor graphs, which represent convolutional factorizations of multivariate functions, just as conventional (multiplicative) factor graphs represent multiplicative factorizations. Convolutional and multiplicative factor graphs arise as natural Fourier trans ..."
Abstract - Cited by 17 (4 self) - Add to MetaCart
We introduce the concept of convolutional factor graphs, which represent convolutional factorizations of multivariate functions, just as conventional (multiplicative) factor graphs represent multiplicative factorizations. Convolutional and multiplicative factor graphs arise as natural Fourier

Some Remarks on Factor Graphs

by Hans-andrea Loeliger - Proc. 3rd Int. Symp. on Turbo Codes and Related Topics , 2003
"... The paper is a collection of remarks, some rather plain, on various issues with factor graphs. In particular, it is pointed out that powerful signal processing techniques such as gradient methods, Kalman filtering, and the particle filter can be used and combined in factor graphs. ..."
Abstract - Cited by 15 (6 self) - Add to MetaCart
The paper is a collection of remarks, some rather plain, on various issues with factor graphs. In particular, it is pointed out that powerful signal processing techniques such as gradient methods, Kalman filtering, and the particle filter can be used and combined in factor graphs.

Factor graphs and algorithms

by Brendan J. Frey, Frank R. Kschischang, Hans-Andrea Loeliger, Niclas Wiberg - IN PROC. 35TH ALLERTON CONF. COMMUNICATIONS, CONTROL, AND COMPUTING
"... A factor graph is a bipartite graph that expresses how a global function of several variables factors into a product of local functions. Factor graphs subsume many other graphical models, including Bayesian networks, Markov random fields, and Tanner graphs. We describe a general algorithm for comput ..."
Abstract - Cited by 36 (7 self) - Add to MetaCart
A factor graph is a bipartite graph that expresses how a global function of several variables factors into a product of local functions. Factor graphs subsume many other graphical models, including Bayesian networks, Markov random fields, and Tanner graphs. We describe a general algorithm

Normal Factor Graphs

by Ali Al-bashabsheh , 2014
"... This thesis introduces normal factor graphs under a new semantics, namely, the exterior function semantics. Initially, this work was motivated by two distinct lines of re-search. One line is “holographic algorithms,” a powerful approach introduced by Valiant for solving various counting problems in ..."
Abstract - Add to MetaCart
This thesis introduces normal factor graphs under a new semantics, namely, the exterior function semantics. Initially, this work was motivated by two distinct lines of re-search. One line is “holographic algorithms,” a powerful approach introduced by Valiant for solving various counting problems

On Factor Graphs And Electrical Networks

by Pascal O . Vontobel, Hans-andrea Loeliger - in Mathematical Systems Theory in Biology, Communication, Computation, and Finance, IMA Volumes in Math , 2002
"... Factor graphs are graphical models with origins in coding theory. The sum-product and the max-product algorithms, which operate by message passing in a factor graph, subsume a great variety of algorithms in coding, signal processing, and artificial intelligence. In this paper, factor graphs are used ..."
Abstract - Cited by 13 (7 self) - Add to MetaCart
Factor graphs are graphical models with origins in coding theory. The sum-product and the max-product algorithms, which operate by message passing in a factor graph, subsume a great variety of algorithms in coding, signal processing, and artificial intelligence. In this paper, factor graphs

Factor-Graph Algorithms for Equalization

by Robert J. Drost, Andrew C. Singer , 2007
"... In this paper, we use the factor-graph framework to describe the statistical relationships that arise in the equalization of data transmitted over an intersymbol interference channel, and use it to develop several new algorithms for linear and decision feedback approaches. Specifically, we examine b ..."
Abstract - Cited by 9 (1 self) - Add to MetaCart
In this paper, we use the factor-graph framework to describe the statistical relationships that arise in the equalization of data transmitted over an intersymbol interference channel, and use it to develop several new algorithms for linear and decision feedback approaches. Specifically, we examine
Results 1 - 10 of 6,060