Conference Paper

Efficient Nonlinear Measurement Updating based on Gaussian Mixture Approximation of Conditional Densities

Univ. Karlsruhe, Karlsruhe
DOI: 10.1109/ACC.2007.4282269 Conference: American Control Conference, 2007. ACC '07
Source: IEEE Xplore

ABSTRACT Filtering or measurement updating for nonlinear stochastic dynamic systems requires approximate calculations, since an exact solution is impossible to obtain in general. We propose a Gaussian mixture approximation of the conditional density, which allows performing measurement updating in closed form. The conditional density is a probabilistic representation of the nonlinear system and depends on the random variable of the measurement given the system state. Unlike the likelihood, the conditional density is independent of actual measurements, which permits determining its approximation off-line. By treating the approximation task as an optimization problem, we use progressive processing to achieve high quality results. Once having calculated the conditional density, the likelihood can be determined on-line, which, in turn, offers an efficient approximate filter step. As result, a Gaussian mixture representation of the posterior density is obtained. The exponential growth of Gaussian mixture components resulting from repeated filtering is avoided implicitly by the prediction step using the proposed techniques.

  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we present a recursive estimation algorithm for nonlinear non-Gaussian tracking systems based on an adaptive Gaussian mixture technique. This estimation cannot be efficiently performed for nonlinear non-Gaussian systems because of the complex representation of the state density. To alleviate this complexity, approximation techniques based on Gaussian mixtures are used. An adaptive mixture approximation method is used based on optimal minimization of a least squares error function between the true density and the corresponding approximation mixture. The state Gaussian mixture is propagated over time through prediction and update steps. Results in comparison with other methods show the efficiency of the proposed algorithm.
    Information Fusion (FUSION), 2010 13th Conference on; 01/2010
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In many signal processing applications it is required to estimate the unobservable state of a dynamic system from its noisy measurements. For linear dynamic systems with Gaussian Mixture (GM) noise distributions, Gaussian Sum Filters (GSF) provide the MMSE state estimate by tracking the GM posterior. However, since the number of the clusters of the GM posterior grows exponentially over time, suitable reduction schemes need to be used to maintain the size of the bank in GSF. In this work we propose a low computational complexity reduction scheme which uses an initial state estimation to find the active noise clusters and removes all the others. Since the performance of our proposed method relies on the accuracy of the initial state estimation, we also propose five methods for finding this estimation. We provide simulation results showing that with suitable choice of the initial state estimation (based on the shape of the noise models), our proposed reduction scheme provides better state estimations both in terms of accuracy and precision when compared with other reduction methods.
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper is Part VIc of a comprehensive survey of maneuvering target tracking without addressing the so-called measurement-origin uncertainty. It provides an in-depth coverage of various approximate density-based nonlinear filters in discrete time developed particularly for handling the uncertainties induced by potential target maneuvers as well as nonlinearities in the dynamical systems commonly encountered in target tracking. An emphasis is given to more recent results, especially those with good potential for tracking applications.
    Proceedings of SPIE - The International Society for Optical Engineering 05/2012; DOI:10.1117/12.921508 · 0.20 Impact Factor

Full-text (2 Sources)

Available from
May 28, 2014