Cart (Loading....) | Create Account
Close category search window

A semi-exact sequential Monte Carlo filtering algorithm in Hidden Markov Chains

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Petetin, Y. ; CITI Dept., Telecom SudParis, Evry, France ; Desbouvries, F.

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 Θ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 Θ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.

Published in:

Information Science, Signal Processing and their Applications (ISSPA), 2012 11th International Conference on

Date of Conference:

2-5 July 2012

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.