Abstract
An important problem in signal processing consists in recursively estimating an unobservable process x = {xn}n∈IN from an observed process y = {yn}n∈IN. This is done classically in the framework of Hidden Markov Models (HMM). In the linear Gaussian case, the classical recursive solution is given by the well-known Kalman filter. In this paper, we consider Pairwise Gaussian Models by assuming that the pair (x, y) is Markovian and Gaussian. We show that this model is strictly more general than the HMM, and yet still enables Kalman-like filtering.
| Original language | English |
|---|---|
| Pages (from-to) | 57-60 |
| Number of pages | 4 |
| Journal | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |
| Volume | 6 |
| Publication status | Published - 1 Jan 2003 |
| Externally published | Yes |
| Event | 2003 IEEE International Conference on Accoustics, Speech, and Signal Processing - Hong Kong, Hong Kong Duration: 6 Apr 2003 → 10 Apr 2003 |
Fingerprint
Dive into the research topics of 'Kalman filtering using Pairwise Gaussian Models'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver