Factor Graphs and the Sum Product Algorithm

By Timo Koski, J. Noble. 2009

309 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/72c1ce0a90040c8fe2d1a67272dd0fd4b74d1d84

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

Citations in the corpus

Cooperative Localization in Wireless Networks (2009, methodology): “We cover some basic concepts of FGs and the SPA; for a detailed treatment, the reader is referred to [63]–[65], [9 5].”
Information, Divergence and Risk for Binary Experiments (2009, background): “There is a rich literature on graphical modelsJordan (1999), factor graphs (Kschischang et al., 2001) and Markov logic networks (Domingos and Richardson, 2004; Richardson and Domingos, 2006) which have allowed the unification of sets of problems (Worthen and Stark, 2001), with a focus on the modelli”
Joint Entity Recognition and Disambiguation (2015, background): “Based on the preliminaries and notations, Figure 1 shows the factor graph (Kschischang et al., 2001) of JERL.”
QuadricSLAM: Dual Quadrics From Object Detections as Landmarks in Object-Oriented SLAM (2018, background): “Landmark Factors (5) This factored distribution can be conveniently modelled as a factor graph [29].”
Pictorial structures revisited: People detection and articulated pose estimation (2009, methodology): “Moreover, we can compute exact marginal distributions using the sumproduct algorithm [9], which we employ here, because we require marginals for pedestrian detection.”
Channel coding: The road to channel capacity (2006, background): “Connections shortly began to be made to a variety of related w ork in various other fields, notably in [130], [131], [129], [127].”
A Probabilistic Interaction Model for Multipitch Tracking With Factorial Hidden Markov Models (2011, methodology): “For a detaile d discussion, we refer the interested reader to [25], [41], [40].”
OpenGM: A C++ Library for Discrete Graphical Models (2012, methodology): “Figure 1: Algorithms provided by OpenGM: Loopy BP (Pearl, 1988; Kschischang et al., 2001), TRBP (Wainwright and Jordan, 2008), TRW-S (Kolmogorov, 2006), α-expansion, αβ-swap (Boykov et al.”
Dual Decomposition Inference for Graphical Models over Strings (2015, methodology): “To perform inference on a graphical model (directed or undirected), one ﬁrst converts the model to a factor graph representation (Kschischang et al., 2001).”
Graphical Models, Exponential Families, and Variational Inference (2008, background): “The formalism of factor graphs provides an alternative graphical representation, one which emphasizes the factorization of the distribution [140, 154].”
Survey of Stochastic Computing (2013, background): “A simpli.ed version of the SPA algorithm appears in Table IV.”