The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
The Factor Graph Approach to Model-Based Signal Processing
Abstract
The message-passing approach to model-based signal processing is developed with a focus on Gaussian message passing in linear state-space models, which includes recursive least squares, linear minimum-mean-squared-error estimation, and Kalman filtering algorithms. Tabulated message computation rules for the building blocks of linear models allow us to compose a variety of such algorithms without additional derivations or computations. Beyond the Gaussian case, it is emphasized that the message-passing approach encourages us to mix and match different algorithmic techniques, which is exemplified by two different approaches—steepest descent and expectation maximization—to message passing through a multiplier node.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
Advances in Neural Information Processing Systems 19
(2007) · The MIT Press eBooks · doi:10.52202/085713 · Cited by 15,539
Haykin, S. (1986) · Cited by 12,603
Rogers, S. (1996) · Control Engineering Practice · doi:10.1016/0967-0661(96)82838-3 · Cited by 9,278
Pattern Recognition and Machine Learning
(2007) · Kybernetes · doi:10.1108/03684920710743466 · Cited by 8,265
Sequential Monte Carlo Methods in Practice
(2001) · Springer eBooks · doi:10.1007/978-1-4757-3437-9 · Cited by 7,366
Clustering by Passing Messages Between Data Points
Frey, B. J., & Dueck, D. (2007) · Science · doi:10.1126/science.1136800 · Cited by 6,758
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486 · cited 7×
“The message-passing approach to signal processing was suggested in [ 2 ], [22] and has been used, e.g., in [23]–[39] for tasks like equalization, multi-user detection, multipleinput multiple-output (MIMO) detection, channel estimation, etc.”
BackgroundMethodInfluentialSelf-citationProbabilistic Reasoning in Intelligent Systems
(1988) · Elsevier eBooks · doi:10.1016/c2009-0-27609-4 · Cited by 3,321
Adaptive filter theory (2nd ed.)
Haykin, S. (1991) · Prentice-Hall, Inc eBooks · Cited by 1,892
Probabilistic Networks and Expert Systems
(1999) · Information Science and Statistics · doi:10.1007/b97670 · Cited by 1,727
Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.850085 · Cited by 1,617
Expectation Propagation for approximate Bayesian inference
Minka, T. P. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.2294 · Cited by 1,392
Markov Random Fields and Their Applications
Kindermann, R., & Snell, J. L. (1980) · Contemporary Mathematics · doi:10.1090/conm/001 · Cited by 1,290
Djuric, P. M., Kotecha, J. H., Zhang, J., Huang, Y., Ghirmai, T., Bugallo, M. F., & Miguez, J. (2003) · IEEE Signal Processing Magazine · doi:10.1109/msp.2003.1236770 · Cited by 965
Generalized Belief Propagation
Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2000) · Cited by 918
An Introduction to factor graphs
Loeliger, H. (2004) · IEEE Signal Processing Magazine · doi:10.1109/msp.2004.1267047 · Cited by 905
Self-citationA family of algorithms for approximate bayesian inference
Minka, T. P., & Picard, R. W. (2001) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 882
Codes and Decoding on General Graphs
Wiberg, N. (1996) · Cited by 869
A Unifying Review of Linear Gaussian Models
Roweis, S., & Ghahramani, Z. (1999) · Neural Computation · doi:10.1162/089976699300016674 · Cited by 869
The EM algorithm for graphical association models with missing data
Lauritzen, S. L. (1995) · Computational Statistics & Data Analysis · doi:10.1016/0167-9473(93)e0056-a · Cited by 760
The generalized distributive law
Aji, S. M., & McEliece, R. J. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825794 · Cited by 735
Djurić, P. M., Kotecha, J. H., Zhang, J., Huang, Y., Ghirmai, T., Bugallo, M. F., & Mı́guez, J. (2003) · IEEE Signal Processing Magazine · Cited by 670
(2005) · Edinburgh Research Explorer (University of Edinburgh) · doi:10.5555/1046920.1088695 · Cited by 650
Codes on graphs: normal realizations
Forney, G. D. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910573 · Cited by 642
On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
Weiss, Y., & Freeman, W. T. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910585 · Cited by 581
Jordan, M. I. (2004) · Statistical Science · doi:10.1214/088342304000000026 · Cited by 420
Codes and iterative decoding on general graphs
Wiberg, N., Loeliger, H., & Kotter, R. (1995) · European Transactions on Telecommunications · doi:10.1002/ett.4460060507 · Cited by 314
Self-citationIterative multiuser joint decoding: unified framework and asymptotic analysis
Boutros, J., & Caire, G. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1013125 · Cited by 314
Algorithms for iterative decoding in the presence of strong phase noise
Colavolpe, G., Barbieri, A., & Caire, G. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.853813 · Cited by 272
Unified design of iterative receivers using factor graphs
Worthen, A. P., & Stark, W. E. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910595 · Cited by 232
Loop series for discrete statistical models on graphs
Chertkov, M., & Chernyak, V. (2006) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2006/06/p06009 · Cited by 155
On the Application of Factor Graphs and the Sum–Product Algorithm to ISI Channels
Colavolpe, G., & Germi, G. (2005) · IEEE Transactions on Communications · doi:10.1109/tcomm.2005.847129 · Cited by 145
On the optimality of tree-reweighted max-product message-passingPreprint
Kolmogorov, V., & Wainwright, M. J. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.1395 · Cited by 98
A factor graph approach to link loss monitoring in wireless sensor networks
Yongyi, Kschischang, F. R., Li, B., & Pasupathy, S. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.843557 · Cited by 97
Self-citationPhase estimation by message passing
Dauwels, J., & Loeliger, H. (2004) · International Conference on Communications · doi:10.1109/icc.2004.1312544 · Cited by 96
Self-citationAn analysis of belief propagation on the turbo decoding graph with Gaussian densities
Rusmevichientong, P., & Roy, B. V. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910586 · Cited by 82
LMMSE turbo equalization based on factor graphs
Guo, Q., & Ping, L. (2008) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2008.080208 · Cited by 82
Self-citationFrey, B. J., Kschischang, F. R., & Loeliger, H. (2008) · Cited by 71
Self-citationExpectation maximization as message passing
Dauwels, J., Korl, S., & Loeliger, H. (2005) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2005.1523402 · Cited by 60
Self-citationLeast Squares and Kalman Filtering on Forney Graphs
Loeliger, H.-A. (2002) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-1-4615-0895-3_7 · Cited by 52
Self-citationGenome-wide analysis of mouse transcripts using exon microarrays and factor graphs
Frey, B. J., Mohammad, N., Morris, Q., Zhang, W., Robinson, M. D., Mnaimneh, S., Chang, R., Pan, Q., Sat, E. W. Y., Rossant, J., et al. (2005) · Nature Genetics · doi:10.1038/ng1630 · Cited by 47
On Factor Graphs and the Fourier Transform
Mao, Y., & Kschischang, F. R. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.846404 · Cited by 44
Self-citationFactor-Graph Algorithms for Equalization
Drost, R., & Singer, A. C. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.893200 · Cited by 34
On Factor Graphs and Electrical Networks
Vontobel, P. O., & Loeliger, H. (2003) · The IMA volumes in mathematics and its applications · doi:10.1007/978-0-387-21696-6_16 · Cited by 26
Self-citationLoeliger, H. (n.d.) · Cited by 25
Self-citationSignal processing with factor graphs: examples
Loeliger, H., Dauwels, J., Koch, V. M., & Korl, S. (2004) · International Symposium on Communications, Control and Signal Processing · doi:10.1109/isccsp.2004.1296450 · Cited by 12
Self-citationAR model parameter estimation: from factor graphs to algorithms
Korl, S., Loeliger, H., & Lindgren, A. G. (2004) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2004.1327159 · Cited by 9
Self-citation
Cited by
Dauwels, J., Vialatte, F., Musha, T., & Cichocki, A. (2010) · NeuroImage · doi:10.1016/j.neuroimage.2009.06.056 · Cited by 394
Self-citationMessage Passing Algorithms for Scalable Multitarget Tracking
Meyer, F., Kropfreiter, T., Williams, J. L., Lau, R., Hlawatsch, F., Braca, P., & Win, M. Z. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2789427 · Cited by 355
Neuronal message passing using mean-field, bethe, and marginal approximations
Parr, T., Markovic, D., Kiebel, S. J., & Friston, K. J. (2019) · Scientific Reports · doi:10.1038/s41598-018-38246-3 · Cited by 128
Generative models for active vision
Parr, T., Sajid, N., Da Costa, L., Mirza, M. B., & Friston, K. J. (2021) · Frontiers in Neurorobotics · doi:10.3389/fnbot.2021.651432 · Cited by 46
Active Inference, Novelty and Neglect
Parr, T., & Friston, K. J. (2018) · Current Topics in Behavioral Neurosciences · doi:10.1007/7854_2018_61 · Cited by 15
Metadata
- Authors
- Loeliger, H.-A., Dauwels, J., Hu, J., Korl, S., Ping, L., & Kschischang, F. R.
- Venue
- Proceedings of the IEEE
- Published
- 2007-06
- Volume
- 95
- Issue
- 6
- Pages
- 1295-1322
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W2052963087
- Cited by
- 526
- References
- 49
- FWCI
- 17.34
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.