2015
DOI: 10.1016/j.spa.2015.01.008
|View full text |Cite
|
Sign up to set email alerts
|

Generalised particle filters with Gaussian mixtures

Abstract: Stochastic filtering is defined as the estimation of a partially observed dynamical system. A massive scientific and computational effort is dedicated to the development of numerical methods for approximating the solution of the filtering problem. Approximating the solution of the filtering problem with Gaussian mixtures has been a very popular method since the. Despite nearly fifty years of development, the existing work is based on the success of the numerical implementation and is not theoretically justifie… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
11
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 19 publications
(11 citation statements)
references
References 29 publications
(42 reference statements)
0
11
0
Order By: Relevance
“…A modern implementation of the particle filter to a high-dimensional filtering problem should involve intensive modifications to mitigate the curse of dimensionality. Successful innovations include proposal densities [34], mixtures [7], and dimension reduction strategies including the classic Rao-Blackwellized PF or recent localized PFs [24,25]. We conclude the numerics section by displaying the compatibility of Emu-PFs with a proposal density based PF, the Optimal Proposal PF, in section 4.7.…”
Section: 4mentioning
confidence: 97%
“…A modern implementation of the particle filter to a high-dimensional filtering problem should involve intensive modifications to mitigate the curse of dimensionality. Successful innovations include proposal densities [34], mixtures [7], and dimension reduction strategies including the classic Rao-Blackwellized PF or recent localized PFs [24,25]. We conclude the numerics section by displaying the compatibility of Emu-PFs with a proposal density based PF, the Optimal Proposal PF, in section 4.7.…”
Section: 4mentioning
confidence: 97%
“…This is equivalent to making a hard decision about the model in effect and hence the accuracy and precision of estimation is dependent on the correct choice of this model. At the cost of increased computational complexity, the performance of these methods can be improved by applying resampling procedures [16], [28], [39]. Alternatively, in [15], [21] a forgetting and merging algorithm is proposed, where the components with weights smaller than a given threshold are removed, and the components with close enough moments are merged.…”
Section: Introductionmentioning
confidence: 99%
“…Currently, most suboptimal methods for obtaining the posterior density in nonlinear discrete-time stochastic dynamic systems are using global and local approximation methods. Taking the point-mass filter based on adaptive algorithm [1] and particle filters with Gaussian mixtures based on Gaussian mixture approximation [2], for example, it is the advantage of the global approximate approach that any clear assumption pertaining to the form of posterior density is not needed. Although the global methods have strong adaptability, they suffer from enormous computational complexity.…”
Section: Introductionmentioning
confidence: 99%