Expectation maximization algorithms for MAP estimation of jump Markov linear systems

TitleExpectation maximization algorithms for MAP estimation of jump Markov linear systems
Publication TypeJournal Article
Year of Publication1999
AuthorsLogothetis, A., and V. Krishnamurthy
JournalSignal Processing, IEEE Transactions on
Volume47
Pagination2139 -2156
Date Publishedaug.
ISSN1053-587X
KeywordsBayes methods, Bayesian maximum likelihood state sequence estimates, conditional mean estimates, continuous state, covariance matrices, data length, EM algorithms, expectation maximization algorithms, exponential computational cost, finite state Markov chain, hidden Markov model, hidden Markov models, HMM estimator, iterative methods, iterative schemes, joint MAP estimate, jump Markov linear systems, Kalman filters, Kalman smoother, MAP estimation, maximum a posteriori state sequence estimates, maximum likelihood sequence estimation, MLSE, model parameters, noise covariance matrices, observation matrix, optimisation, signal processing, smoothing methods, state estimation, state matrix
Abstract

In a jump Markov linear system, the state matrix, observation matrix, and the noise covariance matrices evolve according to the realization of a finite state Markov chain. Given a realization of the observation process, the aim is to estimate the state of the Markov chain assuming known model parameters. Computing conditional mean estimates is infeasible as it involves a cost that grows exponentially with the number of observations. We present three expectation maximization (EM) algorithms for state estimation to compute maximum a posteriori (MAP) state sequence estimates [which are also known as Bayesian maximum likelihood state sequence estimates (MLSEs)]. 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 (HMM) estimator and a Kalman smoother (KS) in three different ways to compute the desired MAP state sequence estimates. Unlike the conditional mean state estimates, which require computational cost exponential in the data length, the proposed iterative schemes are linear in the data length

URLhttp://dx.doi.org/10.1109/78.774753
DOI10.1109/78.774753

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2021 The University of British Columbia