Global Sampling for Sequential Filtering over Discrete State Space
<p/> <p>In many situations, there is a need to approximate a sequence of probability measures over a growing product of finite spaces. Whereas it is in general possible to determine analytic expressions for these probability measures, the number of computations needed to evaluate these q...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2004-01-01
|
Series: | EURASIP Journal on Advances in Signal Processing |
Subjects: | |
Online Access: | http://dx.doi.org/10.1155/S1110865704407173 |
id |
doaj-45b48ebbe5734fe68f7c785c74637d52 |
---|---|
record_format |
Article |
spelling |
doaj-45b48ebbe5734fe68f7c785c74637d522020-11-24T20:57:13ZengSpringerOpenEURASIP Journal on Advances in Signal Processing1687-61721687-61802004-01-01200415106356Global Sampling for Sequential Filtering over Discrete State SpaceCheung-Mon-Chan PascalMoulines Eric<p/> <p>In many situations, there is a need to approximate a sequence of probability measures over a growing product of finite spaces. Whereas it is in general possible to determine analytic expressions for these probability measures, the number of computations needed to evaluate these quantities grows exponentially thus precluding real-time implementation. Sequential Monte Carlo techniques (SMC), which consist in approximating the flow of probability measures by the empirical distribution of a finite set of <it>particles</it>, are attractive techniques for addressing this type of problems. In this paper, we present a simple implementation of the sequential importance sampling/resampling (SISR) technique for approximating these distributions; this method relies on the fact that, the space being finite, it is possible to consider every offspring of the trajectory of particles. The procedure is straightforward to implement, and well-suited for practical implementation. A limited Monte Carlo experiment is carried out to support our findings.</p>http://dx.doi.org/10.1155/S1110865704407173particle filterssequential importance samplingsequential Monte Carlo samplingsequential filteringconditionally linear Gaussian state-space modelsautoregressive models |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Cheung-Mon-Chan Pascal Moulines Eric |
spellingShingle |
Cheung-Mon-Chan Pascal Moulines Eric Global Sampling for Sequential Filtering over Discrete State Space EURASIP Journal on Advances in Signal Processing particle filters sequential importance sampling sequential Monte Carlo sampling sequential filtering conditionally linear Gaussian state-space models autoregressive models |
author_facet |
Cheung-Mon-Chan Pascal Moulines Eric |
author_sort |
Cheung-Mon-Chan Pascal |
title |
Global Sampling for Sequential Filtering over Discrete State Space |
title_short |
Global Sampling for Sequential Filtering over Discrete State Space |
title_full |
Global Sampling for Sequential Filtering over Discrete State Space |
title_fullStr |
Global Sampling for Sequential Filtering over Discrete State Space |
title_full_unstemmed |
Global Sampling for Sequential Filtering over Discrete State Space |
title_sort |
global sampling for sequential filtering over discrete state space |
publisher |
SpringerOpen |
series |
EURASIP Journal on Advances in Signal Processing |
issn |
1687-6172 1687-6180 |
publishDate |
2004-01-01 |
description |
<p/> <p>In many situations, there is a need to approximate a sequence of probability measures over a growing product of finite spaces. Whereas it is in general possible to determine analytic expressions for these probability measures, the number of computations needed to evaluate these quantities grows exponentially thus precluding real-time implementation. Sequential Monte Carlo techniques (SMC), which consist in approximating the flow of probability measures by the empirical distribution of a finite set of <it>particles</it>, are attractive techniques for addressing this type of problems. In this paper, we present a simple implementation of the sequential importance sampling/resampling (SISR) technique for approximating these distributions; this method relies on the fact that, the space being finite, it is possible to consider every offspring of the trajectory of particles. The procedure is straightforward to implement, and well-suited for practical implementation. A limited Monte Carlo experiment is carried out to support our findings.</p> |
topic |
particle filters sequential importance sampling sequential Monte Carlo sampling sequential filtering conditionally linear Gaussian state-space models autoregressive models |
url |
http://dx.doi.org/10.1155/S1110865704407173 |
work_keys_str_mv |
AT cheungmonchanpascal globalsamplingforsequentialfilteringoverdiscretestatespace AT moulineseric globalsamplingforsequentialfilteringoverdiscretestatespace |
_version_ |
1716788393691578368 |