Least Squares and Kalman Filtering on Forney Graphs
By Hans-Andrea Loeliger. 2002
61 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Molecular Biology
View Paper: https://www.semanticscholar.org/paper/33b067108175d082002e815edffceb953b3e3f93
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- PROCEssIng magazInE
- Hans-Andrea Loeliger
- Justin H. G. Dauwels
- Li Ping
- Frank R. Kschischang
- Junli Hu
- Sascha Korl
- Tom Minka
In Molecular Biology
- PROCEssIng magazInE
- Justin H. G. Dauwels
- Li Ping
- Frank R. Kschischang
- Junli Hu
- Sascha Korl
- Hans-Andrea Loeliger
Citations in the corpus
- IEEE Signal Processing Magazine (2008, background): “In this article, we give an introduction to this unified perspective in terms of (Forney-style) factor graphs.”
- An introduction to factor graphs (2004, background): “(In the main ideas, we will follow [24] and [13], but we will also adopt some details of notation from [27] and [42].”
- The free energy principle made simpler but not too simple (2022, unknown): “…filtering is a generic Bayesian filtering scheme for nonlinear state–space models formulated in generalised coordinates of motion [36]; special cases include variational filtering [90], dynamic expectation maximisation [91], extended Kalman filtering [92], and generalised predictive coding.”
- The Factor Graph Approach to Model-Based Signal Processing (2007, methodology): “In particular, we will present tabulated message computation rules for multivariate Gaussian messages that are extensions and refinements of similar tables in [3] and [ 33 ].”