## Abstract

We address the recursive computation of the filtering probability density function (pdf) pn_{n} in a hidden Markov chain (HMC) model. We first observe that the classical path pn-_{1n-1}→pn _{n-1}→pn_{n} is not the only possible one that enables to compute pn_{n} recursively, and we explore the direct, prediction-based (P-based) and smoothing-based (S-based) recursive loops for computing pn _{n}. We next propose a common methodology for computing these equations in practice. Since each path can be decomposed into an updating step and a propagation step, in the linear Gaussian case these two steps are implemented by Gaussian transforms, and in the general case by elementary simulation techniques. By proceeding this way we routinely obtain in parallel, for each filtering path, one set of Kalman filter (KF) equations and one generic sequential Monte Carlo (SMC) algorithm. Finally we classify in a common framework four KF (two of which are original), which themselves can be associated to four generic SMC algorithms (two of which are original). We finally compare our algorithms via simulations. S-based filters behave better than P-based ones, and within each class of filters better results are obtained when updating precedes propagation.

Original language | English (US) |
---|---|

Pages (from-to) | 2064-2077 |

Number of pages | 14 |

Journal | Signal Processing |

Volume | 91 |

Issue number | 8 |

DOIs | |

State | Published - Aug 2011 |

Externally published | Yes |

## Keywords

- Kalman filters
- Particle filtering
- Sampling importance resampling
- Sequential Monte Carlo
- Sequential importance sampling

## ASJC Scopus subject areas

- Control and Systems Engineering
- Software
- Signal Processing
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering