Adaptive Gating for Multitarget Tracking With Gaussian Mixture Filters

2012 ◽  
Vol 60 (3) ◽  
pp. 1533-1538 ◽  
Author(s):  
Davide Macagnano ◽  
Giuseppe Thadeu Freitas de Abreu
Keyword(s):  
Gaussian Mixture ◽  
Multitarget Tracking ◽  
Gaussian Mixture Filters

scholarly journals Multitarget Tracking Algorithm Using Multiple GMPHD Filter Data Fusion for Sonar Networks

Sensors ◽  
2018 ◽  
Vol 18 (10) ◽  
pp. 3193 ◽  
Author(s):  
Xueli Sheng ◽  
Yang Chen ◽  
Longxiang Guo ◽  
Jingwei Yin ◽  
Xiao Han
Keyword(s):  
Data Fusion ◽  
Detection Probability ◽  
Gaussian Mixture ◽  
Tracking Algorithm ◽  
Statistical Characteristics ◽  
Multitarget Tracking ◽  
Fusion Algorithm ◽  
Acoustic Shadow ◽  
Multisensor Data Fusion ◽  
Lower Detection

Multitarget tracking algorithms based on sonar usually run into detection uncertainty, complex channel and more clutters, which cause lower detection probability, single sonar sensors failing to measure when the target is in an acoustic shadow zone, and computational bottlenecks. This paper proposes a novel tracking algorithm based on multisensor data fusion to solve the above problems. Firstly, under more clutters and lower detection probability condition, a Gaussian Mixture Probability Hypothesis Density (GMPHD) filter with computational advantages was used to get local estimations. Secondly, this paper provided a maximum-detection capability multitarget track fusion algorithm to deal with the problems caused by low detection probability and the target being in acoustic shadow zones. Lastly, a novel feedback algorithm was proposed to improve the GMPHD filter tracking performance, which fed the global estimations as a random finite set (RFS). In the end, the statistical characteristics of OSPA were used as evaluation criteria in Monte Carlo simulations, which showed this algorithm’s performance against those sonar tracking problems. When the detection probability is 0.7, compared with the GMPHD filter, the OSPA mean of two sensor and three sensor fusion was decrease almost by 40% and 55%, respectively. Moreover, this algorithm successfully tracks targets in acoustic shadow zones.

UWB Positioning with Generalized Gaussian Mixture Filters

2014 ◽  
Vol 13 (10) ◽  
pp. 2406-2414 ◽  
Author(s):  
Philipp Muller ◽  
Henk Wymeersch ◽  
Robert Piche
Keyword(s):  
Gaussian Mixture ◽  
Gaussian Mixture Filters

scholarly journals On Arithmetic Average Fusion and Its Application for Distributed Multi-Bernoulli Multitarget Tracking

2020 ◽  
Author(s):  
Tiancheng Li ◽  
Xiaoxu Wang ◽  
Yan Liang ◽  
Quan Pan
Keyword(s):  
Literature Review ◽  
Information Fusion ◽  
Large Scale ◽  
Gaussian Mixture ◽  
Multitarget Tracking ◽  
Computationally Efficient ◽  
Simple Arithmetic ◽  
Arithmetic Average ◽  
The Core ◽  
Comprehensive Literature Review

<div>Recently, the simple arithmetic averages (AA) fusion has demonstrated promising, even surprising, performance for multitarget information fusion. In this paper, we first analyze the conservativeness and Frechet mean properties of it, presenting new empirical analysis based on a comprehensive literature review. Then, we propose a target-wise fusion principle for tailoring the AA fusion to accommodate the multi-Bernoulli (MB) process, in which only significant Bernoulli components, each represented by an individual Gaussian mixture, are disseminated and fused in a Bernoulli-to-Bernoulli (B2B) manner. For internode communication, both the consensus and flooding schemes are investigated, respectively. At the core of the proposed fusion algorithms, Bernoulli components obtained at different sensors are associated via either clustering or pairwise assignment so that the MB fusion problem is decomposed to parallel B2B fusion subproblems, each resolved via exact Bernoulli-AA fusion. Two communicatively and computationally efficient cardinality consensus approaches are also presented which merely disseminate and fuse target existence probabilities among local MB filters. The accuracy and computing and communication cost of these four approaches are tested in two large scale scenarios with different sensor networks and target trajectories. </div>

scholarly journals Multisensor RFS Filters for Unknown and Changing Detection Probability

Electronics ◽  
2019 ◽  
Vol 8 (7) ◽  
pp. 741
Author(s):  
Zhang ◽  
Li ◽  
Sun
Keyword(s):  
Detection Probability ◽  
A Priori ◽  
Gaussian Mixture ◽  
Multitarget Tracking ◽  
Probability Hypothesis Density ◽  
Inverse Gamma ◽  
Motion State ◽  
Performance Deterioration ◽  
Cphd Filter ◽  
Monitoring Area

The detection probability is an important parameter in multisensor multitarget tracking. The existing multisensor multi-Bernoulli (MS-MeMBer) filter and multisensor cardinalized probability hypothesis density (MS-CPHD) filter require that detection probability is a priori. However, in reality, the value of the detection probability is constantly changing due to the influence of sensors, targets, and other environmental characteristics. Therefore, to alleviate the performance deterioration caused by the mismatch of the detection probability, this paper applies the inverse gamma Gaussian mixture (IGGM) distribution to both the MS-MeMBer filter and the MS-CPHD filter. Specifically, the feature used for detection is assumed to obey the inverse gamma distribution and is statistically independent of the target’s spatial position. The feature is then integrated into the target state to iteratively estimate the target detection probability as well as the motion state. The experimental results demonstrate that the proposed methods can achieve a better filtering performance in scenarios with unknown and changing detection probability. It is also shown that the distribution of the sensors has a vital influence on the filtering accuracy, and the filters perform better when sensors are dispersed in the monitoring area.

scholarly journals Large Sample Properties of the Adaptive Gaussian Mixture Filter

2017 ◽  
Vol 145 (7) ◽  
pp. 2533-2553 ◽  
Author(s):  
Andreas S. Stordal ◽  
Hans A. Karlsen
Keyword(s):  
Monte Carlo ◽  
Particle Filter ◽  
Sample Size ◽  
Sequential Monte Carlo ◽  
Hybrid Methods ◽  
Gaussian Mixture ◽  
Error Norm ◽  
Filter Performance ◽  
Special Cases ◽  
Gaussian Mixture Filters

In high-dimensional dynamic systems, standard Monte Carlo techniques that asymptotically reproduce the posterior distribution are computationally too expensive. Alternative sampling strategies are usually applied and among these the ensemble Kalman filter (EnKF) is perhaps the most popular. However, the EnKF suffers from severe bias if the model under consideration is far from linear. Another class of sequential Monte Carlo methods is kernel-based Gaussian mixture filters, which reduce the bias but maintain the robustness of the EnKF. Although many hybrid methods have been introduced in recent years, not many have been analyzed theoretically. Here it is shown that the recently proposed adaptive Gaussian mixture filter can be formulated in a rigorous Bayesian framework and that the algorithm can be generalized to a broader class of interpolated kernel filters. Two parameters—the bandwidth of the kernel and a weight interpolation factor—determine the filter performance. The new formulation of the filter includes particle filters, EnKF, and kernel-based Gaussian mixture filters as special cases. Techniques from particle filter literature are used to calculate the asymptotic bias of the filter as a function of the parameters and to derive a central limit theorem. The asymptotic theory is then used to determine the parameters as a function of the sample size in a robust way such that the error norm vanishes asymptotically, whereas the normalized error is sample independent and bounded. The parameter choice is tested on the Lorenz 63 model, where it is shown that the error is smaller or equal to the EnKF and the optimal particle filter for a varying sample size.

Sign in / Sign up

Export Citation Format

Share Document