.png){kind=icon}
.png){kind=icon}
Return
On Bayesian Fixed-Interval Smoothing Algorithms
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2008.2007858.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this note, we revisit fixed-interval Kalman like smoothing algorithms. We have two results. We first unify the family of existing algorithms by deriving them in a common Bayesian framework; as we shall see, all these algorithms stem from forward and/or backward Markovian properties of the state process, involve one (or two) out of four canonical probability density functions, and can be derived from the systematic use of some generic properties of Gaussian variables which we develop in a specific toolbox. On the other hand the methodology we use enables us to complete the set of existing algorithms by five new Kalman like smoothing algorithms, which is our second result.
Keywords:
Fixed-interval Kalman smoothing algorithms
hidden Markov chains (HMC)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W