A semi-exact sequential Monte Carlo filtering algorithm in hidden Markov chains - Archive ouverte HAL
Communication Dans Un Congrès ISSPA '12 : The 11th International Conference on Information Sciences, Signal Processing and their Applications Année : 2012

A semi-exact sequential Monte Carlo filtering algorithm in hidden Markov chains

Résumé

Bayesian filtering is an important issue in Hidden Markov Chains (HMC) models. In many problems it is of interest to compute both the a posteriori filtering pdf at each time instant n and a moment teta n thereof. Sequential Monte Carlo (SMC) techniques, which include Particle filtering (PF) and Auxiliary PF (APF) algorithms, propagate a set of weighted particles which approximate that filtering pdf at time n, and then compute a Monte Carlo (MC) estimate of teta n. In this paper we show that in models where the so-called Fully Adapted APF (FA-APF) algorithm can be used such as semi-linear Gaussian state-space models, one can compute an estimate of the moment of interest at time n based only on the new observation yn and on the set of particles at time n - 1. This estimate does not suffer from the extra MC variation due to the sampling of new particles at time n, and is thus preferable to that based on that new set of particles, due to the Rao-Blackwell (RB) theorem. We finally extend our solution to models where the FA-APF cannot be used any longer.
Fichier non déposé

Dates et versions

hal-00765899 , version 1 (17-12-2012)

Identifiants

Citer

Yohan Petetin, François Desbouvries. A semi-exact sequential Monte Carlo filtering algorithm in hidden Markov chains. ISSPA '12 : The 11th International Conference on Information Sciences, Signal Processing and their Applications, Jul 2012, Montreal, Canada. pp.595-600, ⟨10.1109/ISSPA.2012.6310621⟩. ⟨hal-00765899⟩
122 Consultations
0 Téléchargements

Altmetric

Partager

More