Expectation maximization algorithms for MAP estimation of jump Markov linear systems (Q2723863)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Expectation maximization algorithms for MAP estimation of jump Markov linear systems |
scientific article; zbMATH DE number 1615181
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Expectation maximization algorithms for MAP estimation of jump Markov linear systems |
scientific article; zbMATH DE number 1615181 |
Statements
Expectation maximization algorithms for MAP estimation of jump Markov linear systems (English)
0 references
8 July 2001
0 references
expectation maximization algorithms
0 references
state estimation
0 references
maximum a posteriori
0 references
hidden Markov model estimator
0 references
Kalman smoother
0 references
This paper presents three expectation maximization (EM) algorithms for state estimation to compute maximum a posteriori (MAP) state sequence estimates (Bayes maximum likelihood state sequence estimates). The first EM algorithm yields the MAP estimate for the entire sequence of the finite state Markov chain. The second EM algorithm yields the MAP estimate of the continuous state of the jump linear system. The third EM algorithm computes the joint MAP estimate of the finite and continuous states. The three EM algorithms optimally combine a hidden Markov model estimator and a Kalman smoother in three different ways to compute the desired MAP state sequence estimates. The proposed iterative schemes are linear in the data length.
0 references