scholarly journals Time-Matching Random Finite Set-Based Filter for Radar Multi-Target Tracking

Sensors ◽  
2018 ◽  
Vol 18 (12) ◽  
pp. 4416 ◽  
Author(s):  
Defu Jiang ◽  
Ming Liu ◽  
Yiyue Gao ◽  
Yang Gao ◽  
Wei Fu ◽  
...  
Keyword(s):  
Target Tracking ◽  
Gaussian Mixture ◽  
Bayesian Filtering ◽  
Probability Hypothesis Density ◽  
Random Finite Set ◽  
Bayesian Formulation ◽  
Multi Target Tracking ◽  
Finite Set ◽  
Density Filter ◽  
Bernoulli Filter

The random finite set (RFS) approach provides an elegant Bayesian formulation of the multi-target tracking (MTT) problem without the requirement of explicit data association. In order to improve the performance of the RFS-based filter in radar MTT applications, this paper proposes a time-matching Bayesian filtering framework to deal with the problem caused by the diversity of target sampling times. Based on this framework, we develop a time-matching joint generalized labeled multi-Bernoulli filter and a time-matching probability hypothesis density filter. Simulations are performed by their Gaussian mixture implementations. The results show that the proposed approach can improve the accuracy of target state estimation, as well as the robustness.

scholarly journals Improved Gaussian Mixture Probability Hypothesis Density for Tracking Closely Spaced Targets

2017 ◽  
Vol 63 (3) ◽  
pp. 247-254 ◽  
Author(s):  
Huanqing Zhang ◽  
Hongwei Ge ◽  
Jinlong Yang
Keyword(s):  
State Estimation ◽  
Analytic Solution ◽  
Gaussian Mixture ◽  
Multiple Target ◽  
Probability Hypothesis Density ◽  
Random Finite Set ◽  
Multi Target Tracking ◽  
Finite Set ◽  
Estimation Precision ◽  
Simulation Results

AbstractProbability hypothesis density (PHD) filter is a suboptimal Bayesian multi-target filter based on random finite set. The Gaussian mixture PHD filter is an analytic solution to the PHD filter for linear Gaussian multi-target models. However, when targets move near each other, the GM-PHD filter cannot correctly estimate the number of targets and their states. To solve the problem, a novel reweighting scheme for closely spaced targets is proposed under the framework of the GM-PHD filter, which can be able to correctly redistribute the weights of closely spaced targets, and effectively improve the multiple target state estimation precision. Simulation results demonstrate that the proposed algorithm can accurately estimate the number of targets and their states, and effectively improve the performance of multi-target tracking algorithm.

scholarly journals Multisensor Multi-Target Tracking Based on GM-PHD Using Out-Of-Sequence Measurements

Sensors ◽  
2019 ◽  
Vol 19 (19) ◽  
pp. 4315 ◽  
Author(s):  
Meiqin Liu ◽  
Tianyi Huai ◽  
Ronghao Zheng ◽  
Senlin Zhang
Keyword(s):  
Target Tracking ◽  
Tracking System ◽  
Gaussian Mixture ◽  
Tracking Performance ◽  
Probability Hypothesis Density ◽  
Single Target ◽  
Multi Target Tracking ◽  
Finite Set ◽  
Single Target Tracking ◽  
Better Than

In this paper, we study the issue of out-of-sequence measurement (OOSM) in a multi-target scenario to improve tracking performance. The OOSM is very common in tracking systems, and it would result in performance degradation if we used it inappropriately. Thus, OOSM should be fully utilized as far as possible. To improve the performance of the tracking system and use OOSM sufficiently, firstly, the problem of OOSM is formulated. Then the classical B1 algorithm for OOSM problem of single target tracking is given. Next, the random finite set (RFS)-based Gaussian mixture probability hypothesis density (GM-PHD) is introduced. Consequently, we derived the equation for re-updating of posterior intensity with OOSM. Implementation of GM-PHD using OOSM is also given. Finally, several simulations are given, and results show that tracking performance of GM-PHD using OOSM is better than GM-PHD using in-sequence measurement (ISM), which can strongly demonstrate the effectiveness of our proposed algorithm.

scholarly journals Sensor Selection for Decentralized Large-Scale Multi-Target Tracking Network

Sensors ◽  
2018 ◽  
Vol 18 (12) ◽  
pp. 4115 ◽  
Author(s):  
Feng Lian ◽  
Liming Hou ◽  
Bo Wei ◽  
Chongzhao Han
Keyword(s):  
Target Tracking ◽  
Large Scale ◽  
Sequential Monte Carlo ◽  
Signal To Noise Ratio ◽  
Computational Cost ◽  
Gaussian Mixture ◽  
Descent Method ◽  
Sensor Selection ◽  
Multi Target Tracking ◽  
Finite Set

A new optimization algorithm of sensor selection is proposed in this paper for decentralized large-scale multi-target tracking (MTT) network within a labeled random finite set (RFS) framework. The method is performed based on a marginalized δ-generalized labeled multi-Bernoulli RFS. The rule of weighted Kullback-Leibler average (KLA) is used to fuse local multi-target densities. A new metric, named as the label assignment (LA) metric, is proposed to measure the distance for two labeled sets. The lower bound of LA metric based mean square error between the labeled multi-target state set and its estimate is taken as the optimized objective function of sensor selection. The proposed bound is obtained by the information inequality to RFS measurement. Then, we present the sequential Monte Carlo and Gaussian mixture implementations for the bound. Another advantage of the bound is that it provides a basis for setting the weights of KLA. The coordinate descent method is proposed to compromise the computational cost of sensor selection and the accuracy of MTT. Simulations verify the effectiveness of our method under different signal-to- noise ratio scenarios.

Sign in / Sign up

Export Citation Format

Share Document