Conference Paper

Approximate conditional mean particle filter

Dept. of Electr. & Comput. Eng., McMaster Univ., Hamilton, Ont.
DOI: 10.1109/SSP.2005.1628629 Conference: Statistical Signal Processing, 2005 IEEE/SP 13th Workshop on
Source: IEEE Xplore


We consider partially observed non-Gaussian dynamic state space models in which the process equation consists of a combination of linear and nonlinear states and the process noise for the nonlinear state update is distributed according to a mixture of Gaussians. In this paper, we solve a Bayesian filtering problem. The proposed filter is an efficient combination of the particle filter and the approximate conditional mean filter. Simulation results on a time-varying autoregressive signal demonstrate the effectiveness of the proposed algorithm

6 Reads
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We consider linear systems whose state parameters are separable into linear and nonlinear sets, and evolve according to some known transition distribution, and whose measurement noise is distributed according to a mixture of Gaussians. In doing so, we propose a novel particle filter that addresses the optimal state estimation problem for the aforementioned class of systems. The proposed filter, referred to as the approximate conditional mean particle filter (ACM-PF), is a combination of the approximate conditional mean filter and the sequential importance sampling particle filter. The algorithm development depends on approximating a mixture of Gaussians distribution with a moment-matched Gaussian in the weight update recursion. A condition indicating when this approximation is valid is given. In order to evaluate the performance of the proposed algorithm, we address the blind signal detection problem for an impulsive flat fading channel and the tracking of a maneuvering target in the presence of glint noise. Extensive computer simulations were carried out. For computationally intensive implementations (large number of particles), the proposed algorithm offers performance that is comparable to other state-of-the-art particle filtering algorithms. In the scenario where computational horsepower is heavily constrained, it is shown that the proposed algorithm offers the best performance amongst the considered algorithms for these specific examples.
    Full-text · Article · Jan 2009 · IEEE Transactions on Signal Processing