Factor Graphs and Algorithms

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 elds and Tanner graphs We describe a general algorithm for computing marginals of the global function by distributed message passing in the corresponding factor graph A wide variety of algorithms developed in the arti cial intelligence statistics signal processing and digital communications communities can be derived as speci c instances of this general algorithm including Pearl s belief propagation and belief revision algorithms the fast Fourier transform the Viterbi algorithm the forward backward algorithm and the iterative turbo decoding algorithm

[1]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[2]  Umberto Bertelè,et al.  Nonserial Dynamic Programming , 1972 .

[3]  C. Preston.  Gibbs States on Countable Sets , 1974 .

[4]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[5]  J. Laurie Snell,et al.  Markov Random Fields and Their Applications , 1980 .

[6]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[7]  V. Isham.  An Introduction to Spatial Point Processes and Markov Random Fields , 1981 .

[8]  Geoffrey E. Hinton,et al.  Learning and relearning in Boltzmann machines , 1986 .

[9]  S. Verdú,et al.  Abstract dynamic programming models under commutativity conditions , 1987 .

[10]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[11]  Richard E. Neapolitan,et al.  Probabilistic reasoning in expert systems - theory and algorithms , 2012 .

[12]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[13]  Hans-Andrea Loeliger,et al.  Codes and iterative decoding on general graphs , 1995, Eur. Trans. Telecommun..

[14]  David J. C. MacKay,et al.  Good Codes Based on Very Sparse Matrices , 1995, IMACC.

[15]  Niclas Wiberg,et al.  Codes and Decoding on General Graphs , 1996 .

[16]  Robert J. McEliece,et al.  A general algorithm for distributing information in a graph , 1997, Proceedings of IEEE International Symposium on Information Theory.

[17]  Brendan J. Frey,et al.  Bayesian networks for pattern classification, data compression, and channel coding , 1997 .

[18]  Jung-Fu Cheng,et al.  Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm , 1998, IEEE J. Sel. Areas Commun..

[19]  Brendan J. Frey,et al.  Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models , 1998, IEEE J. Sel. Areas Commun..

[20]  Lakhmi C. Jain,et al.  Introduction to Bayesian Networks , 2008 .

[21]  Michael Collins,et al.  Forward-Backward Algorithm , 2009, Encyclopedia of Biometrics.