Abstract
We address the statistical filtering problem in dynamical models with jumps. When a particular application is adequately modeled by linear and Gaussian probability density functions with jumps, a usual method consists in approximating the optimal Bayesian estimate [in the sense of the minimum mean square error (MMSE)] in a linear and Gaussian jump Markov state space system (JMSS). Practical solutions include algorithms based on numerical approximations or on sequential Monte Carlo (SMC) methods. In this paper, we propose a class of alternative methods which consists in building statistical models which, locally, similarly model the problem of interest, but in which the computation of the MMSE estimate can be be computed exactly (without numerical nor SMC approximations) and at a computational cost which is linear in the number of observations.
| Original language | English |
|---|---|
| Article number | 6826583 |
| Pages (from-to) | 3643-3653 |
| Number of pages | 11 |
| Journal | IEEE Transactions on Signal Processing |
| Volume | 62 |
| Issue number | 14 |
| DOIs | |
| Publication status | Published - 15 Jul 2014 |
Keywords
- Conditional pairwise Markov chains
- Exact Bayesian filtering
- Hidden Markov chains
- Jump Markov state space systems
- NP-hard problems
- Pairwise Markov chains
Fingerprint
Dive into the research topics of 'A class of fast exact bayesian filters in dynamical models with jumps'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver