Next Article in Journal
Multi-Spectral Fusion and Denoising of Color and Near-Infrared Images Using Multi-Scale Wavelet Analysis
Next Article in Special Issue
Space Debris Tracking with the Poisson Labeled Multi-Bernoulli Filter
Previous Article in Journal
Identification of Sleeper Support Conditions Using Mechanical Model Supported Data-Driven Approach
Previous Article in Special Issue
Performance Study of Distance-Weighting Approach with Loopy Sum-Product Algorithm for Multi-Object Tracking in Clutter
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Robust SMC-PHD Filter for Multi-Target Tracking with Unknown Heavy-Tailed Measurement Noise

Institute of Electronic Countermeasure, National University of Defense Technology, Hefei 230037, China
*
Author to whom correspondence should be addressed.
Sensors 2021, 21(11), 3611; https://doi.org/10.3390/s21113611
Submission received: 7 March 2021 / Revised: 18 May 2021 / Accepted: 20 May 2021 / Published: 22 May 2021
(This article belongs to the Special Issue Multi-Sensor Fusion for Object Detection and Tracking)

Abstract

:
In multi-target tracking, the sequential Monte Carlo probability hypothesis density (SMC-PHD) filter is a practical algorithm. Influenced by outliers under unknown heavy-tailed measurement noise, the SMC-PHD filter suffers severe performance degradation. In this paper, a robust SMC-PHD (RSMC-PHD) filter is proposed. In the proposed filter, Student-t distribution is introduced to describe the unknown heavy-tailed measurement noise where the degrees of freedom (DOF) and the scale matrix of the Student-t distribution are respectively modeled as a Gamma distribution and an inverse Wishart distribution. Furthermore, the variational Bayesian (VB) technique is employed to infer the unknown DOF and scale matrix parameters while the recursion estimation framework of the RSMC-PHD filter is derived. In addition, considering that the introduced Student- t distribution might lead to an overestimation of the target number, a strategy is applied to modify the updated weight of each particle. Simulation results demonstrate that the proposed filter is effective with unknown heavy-tailed measurement noise.

1. Introduction

Multi-target tracking (MTT) involves the estimate of target number and states from noisy measurements [1]. Influenced by clutter and detection uncertainty, the traditional MTT algorithms based on data association, such as joint probabilistic data association (JPDA) [2] and multiple hypotheses tracking (MHT) [3], are burdened with high computation complexity with the increase of target number and clutter number. Under the framework of finite set statistics (FISST), multi-target states and measurements are modeled as random finite sets (RFS) to avoid data association. Unfortunately, the MTT approaches based on RFS are still computationally intractable because of the multiple integrals. To obtain a computational tractable solution, the probability hypothesis density (PHD) filter [4] which propagates the first order moment approximation of multi-target posterior density is proposed and realizes the estimate of multi-target number and states. The two main implementations of the PHD filter are the Gaussian mixture PHD (GM-PHD) filter [5] and the sequential Monte Carle PHD (SMC-PHD) [6]. In recent years, the PHD filter has generated substantial interest in visual tracking [7], radar tracking [8], etc.
However, the above algorithms only achieve good performance with the known Gaussian measurement noise variance. When the measurement noise variance is unknown and inconsistent with the true variance, the performance of these algorithms decreases. In [9], Sarkka considers the unknown measurement noise variance problem under the linear Gaussian system and models noise variance as an inverse Gamma (IG) distribution. Then, the joint estimate of target state and noise variance is obtained by variational Bayesian (VB) technique. Since the inverse Gamma distribution is only suitable for the situation where the noise variance is diagonal, the inverse Wishart (IW) distribution is further used to model the full noise variance [10,11]. Following this, the VB technique was introduced into the PHD filter [12,13,14] for MTT.
In some applications, the measurement noise might be non-Gaussian. For example, due to the electromagnetic interference and the sensor’s unreliability, the measurement model is usually accompanied with outliers and the measurement noise can be treated as non-Gaussian noise with a heavy-tailed probability density function [15]. The outliers will result in the performance degradation of conventional tracking algorithms. In [15], the combination of a Laplacian distribution and a Gaussian distribution is used to describe the heavy-tailed measurement noise. In [16,17], the heavy-tailed measurement noise is characterized as a mixture of two Gaussian distributions. Due to the advantage of the heavy-tailed characteristic, Student-t distribution was widely used to deal with outliers in [18,19,20]. However, the relevant parameters of Student-t distribution need to be known in these applications. Similar to [9,10,11,12,13,14], the VB technique was employed in the situation where the Student-t distribution parameters are unknown in [21,22,23,24]. The joint estimate of target and unknown parameters is obtained in a linear system. However, the above approaches work worse in a nonlinear system. The nonlinear transformation algorithms, such as extended Kalman filter (EKF) and unscented Kalman filter (UKF), can be used to cope with the nonlinear system to some extent. Unfortunately, the EKF depends on the nature of nonlinearities and the UKF relies on the Gaussian characteristic of the system. They often give an unreliable estimate if the nonlinearities are severe or the system is non-Gaussian, which leads to target missing.
With heavy-tailed measurement noise, the robust PHD filter in a nonlinear system has been much less studied than that in a linear system. Compared with nonlinear transformations, the particle filter is more suitable for practical applications because it can deal with nonlinear and non-Gaussian dynamics. Motivated by [23], we extend the Student-t distribution into SMC-PHD filter and propose a robust SMC-PHD (RSMC-PHD) filter with unknown heavy-tailed measurement noise. In the proposed filter, the Student-t distribution where the degrees of freedom (DOF) and the scale matrix are both unknown is used to model the measurement noise. The Gamma distribution and IW distribution are respectively used to model the DOF and the scale matrix. Then, the augmented state of the target involves the target state, DOF, and the scale matrix. Further, the target state is estimated by particle approximations and the DOF and the scale matrix are updated by the VB technique within the SMC-PHD filter framework. In addition, considering the problem that the introduced Student-t distribution might lead to an overestimation of the target number, we apply a strategy to modify the updated weight of each particle. Simulation results show that the proposed RSMC-PHD filter can achieve higher estimate accuracy than the compared filter under unknown heavy-tailed measurement noise.
This paper is organized as follows. Section 2 gives a brief overview of the tracking model, measurement noise model, PHD filter, and SMC-PHD filter. Section 3 presents the detailed implementation of the proposed filter. Section 4 evaluates the performance of the proposed filter under two scenarios. Finally, Section 5 displays the conclusions.

2. Background

2.1. Tracking Model and Measurement Noise Model

Consider a state space system given by
x k = f ( x k 1 ) + w k
z k = h ( x k ) + ε k
where x k is referred to as the target state and z k is referred to as the measurement at time k . w k is the process noise assumed to be Gaussian white noise with covariance matrix Q k . f ( ) and h ( ) are the dynamic motion model function and measurement model function, respectively. ε k is the measurement noise.
The target dynamic motion model function is given by
f x k x k 1 = N x k ; f x k 1 , Q k
where N x ; x ^ , P denotes a Gaussian probability density function with mean x ^ and covariance matrix P . Assume the measurement noise has a heavy tail and can be described by a Student-t distribution as [18]
p ( ε k ) = St ( ε k ; 0 d , R k , ν k ) = Γ ν k + d 2 Γ ν k 2 1 ( ν k π ) d 2 1 R k 1 2 1 + 1 ν k ε k T R k 1 ε k ν k + d 2
where St ( ) denotes the Student-t distribution, 0 d denotes d dimension zeros vector, d is the dimension of z k , ν k denotes DOF, R k is a symmetric, positive defined d × d covariance matrix and Γ ( ) denotes the Gamma function. Different from the Gaussian distribution, the Student-t distribution has a thicker tail away from the mean value. When ν k , the Student-t distribution is equivalent to a Gaussian distribution. The probability density function in Equation (4) can be also formulated as a mixture of Gamma distribution and Gaussian distribution denoted as [25]
St ( ε k ; 0 , R k , ν k ) = 0 N ε k ; 0 , R k / u k G u k ; ν k 2 , ν k 2 d u k
where G denotes the gamma distribution, u k is an auxiliary variable. The likelihood of the measurement can be written as
g k ( z k x k , R k , ν k ) = St ( z k ; h ( x k ) , R k , ν k )
According to Equation (5), we can obtain
g k ( z k x k , R k , μ k ) = N z k ; h ( x k ) , R k / u k
where u k is distributed as
p ( u k ν k ) = G u k ; ν k / 2 , ν k / 2
In this paper, the DOF ν k and scale matrix R k are both unknown. Considering the conjugate prior to Gaussian distribution with unknown variance is the IW distribution, we model R k as the IW distribution. Similarly, the Gamma distribution is assumed to be the conjugate prior to the DOF ν k . Then the joint probability density of R k , u k , and ν k can be expressed as
p R k , u k , ν k = IW R k ; υ k , V k G u k ; ν k / 2 , ν k / 2 × G ν k ; α k , β k
where IW ( ) denotes the IW distribution, υ k , V k are the sufficient statistics of R k , α k and β k are the sufficient statistics of ν k .

2.2. PHD Filter

Assume that X k = { x k 1 , , x k N k } is the multi-target states set and Z k = { z k 1 , , z k M k } is the measurements set at time k . x k n is referred to as the nth target state and z k m is referred to as the mth measurement. N k and M k are the number of targets and measurements, respectively. Then the Bayesian filter recursion can be expressed as
p k k 1 ( X k Z 1 : k 1 ) = f ( X k X k 1 ) p k 1 ( X k 1 Z 1 : k 1 ) μ s d X k 1
p k ( X k Z 1 : k ) = g k ( Z k X k ) p k k 1 ( X k Z 1 : k 1 ) g k ( Z k X k ) p k k 1 ( X k Z 1 : k 1 ) μ s d X k
where g k ( ) is the likelihood function. p k k 1 ( ) and p k ( ) denote multi-target predicted density and multi-target posterior density, respectively. μ s is the reference measure.
The recursion Equations (10) and (11) involve multiple integrals, which are computationally intractable. To alleviate the computational intractability, the PHD filter provides a sub-optimal solution by propagating the first-order statistical moment of the multiple posterior densities. Without the spawning targets, the predicted and updated equations of the PHD filter are given by [5]
D k k 1 ( x k ) = p S , k f ( x k x k - 1 ) D k 1 ( x k - 1 ) d x k - 1 + γ k ( x k )
D k ( x k ) = ( 1 p D , k ) D k k 1 ( x k ) + z Z k p D , k g k ( z x k ) D k k 1 ( x k ) κ k ( z ) + p D , k g k ( z x k ) D k k 1 ( x k ) d x k
where D k k 1 ( x k ) and D k k ( x k ) are the predicted intensity and posterior intensity, respectively. γ k ( x k ) is the birth targets intensity, p S , k is the target survival probability, p D , k is the detection probability. κ k ( z ) = λ c ( z ) is the clutter intensity with average clutter number λ and spatial distribution c ( z ) .

2.3. SMC-PHD Filter

Assume that the multi-target posterior intensity can be denoted by weighted particles set at time k 1 , i.e., D k - 1 ( x k 1 Z 1 : k 1 ) = i = 1 L k 1 ω k 1 ( i ) δ ( x k 1 x k 1 ( i ) ) . L k 1 denotes the particle number at time k 1 , x k 1 ( i ) is the ith particle state and ω k - 1 ( i ) is the corresponding weight. Then, the SMC-PHD filter can be summarized by the following steps.
Step 1 Prediction
x k ( i ) q k ( x k 1 ( i ) , Z k ) , i = 1 , , L k 1 p k ( Z k ) , i = L k 1 + 1 , , L k 1 + J k
ω k k 1 ( i ) ω k 1 ( i ) p S , k f k k 1 ( x k ( i ) x k 1 ( i ) ) q k ( x k ( i ) x k 1 ( i ) , Z k ) , i = 1 , , L k 1 1 J k γ k ( x k ( i ) ) p k ( x k ( i ) Z k ) , i = L k 1 + 1 , , L k 1 + J k
D k k 1 ( x k Z 1 : k 1 ) = i = 1 L k 1 + J k ω k k 1 ( i ) δ ( x k x k ( i ) )
where q k x k 1 ( i ) , Z k is the proposal density of survival targets and p k Z k is the proposal density of birth targets. J k is the particles number of birth targets.
Step 2 Update
ω k ( i ) = ( 1 p D , k ) ω k k 1 ( i ) + z Z k p D , k g k ( z x k ( i ) ) κ k ( z ) + C k ( z ) ω k k 1 ( i )
C k ( z ) = j = 1 L k 1 + J k p D , k g k ( z x k ( i ) ) ω k k 1 ( i )
D k ( x k Z 1 : k ) = i = 1 L k 1 + J k ω k ( i ) δ ( x k x k ( i ) )
Step 3 Resampling
Target number is estimated by N ^ k = ceil i = 1 L k 1 + J k ω k ( i ) , and resample x k ( i ) , ω k ( i ) i = 1 L k 1 + J k . ceil ( x ) denotes the smallest integer more than x , L k = N p a r t i c l e N ^ k , N p a r t i c l e is the number of particles per expected target.
Step 4 State extraction
Extract the target states X k = { x ^ k 1 , , x ^ k N ^ k } from the resampling particles set, where x ^ k 1 , , x ^ k N ^ k denote the estimated target states.

3. The Robust SMC-PHD Filter

3.1. VB Approximation

The aforementioned SMC-PHD filter performs well under Gaussian measurement noise. However, the outliers in measurements will have a negative effect on the SMC-PHD filter. To solve the problem, the Student-t distribution is introduced to model the heavy-tailed measurement noise. Since the parameters of the Student-t distribution are unknown, the joint posterior probability density of target state x k , scale matrix R k , auxiliary variable u k , and DOF ν k need to be estimated. Therefore, the augmented target state can be expressed as
x ¨ k = x k , R k , u k , ν k
Since there is no explicit analytical solution existing for the joint posterior density p ( x ¨ k Z 1 : k ) , we utilize the VB inference [9] to obtain the approximate solution. As for an approximate method, VB inference is widely used in searching for a factored approximate posterior density as follows
p ( x ¨ k Z 1 : k ) = p ( x k , R k , u k , ν k Z 1 : k ) q ( x ¨ k Z 1 : k ) q x ( x k ) q R ( R k ) q u ( u k ) q v ( ν k )
where q ( x ¨ k Z 1 : k ) is the approximate joint posterior density, q x ( ) , q R ( ) , q u ( ) ,and q ν ( ) are the approximate posterior densities. Equation (21) has the implicit assumption that the target state and the Student-t distribution parameters are independent. By minimizing the Kullback–Leibler (KL) divergence between p ( x ¨ k Z 1 : k ) and q ( x ¨ k Z 1 : k ) , the estimate q ^ x ( x k ) , q ^ R ( R k ) , q ^ u ( u k ) , and q ^ ν ( ν k ) can be easily obtained by
q ^ x , q ^ R , q ^ u , q ^ ν = arg min q x , q R , q u , q ν K L q ( x ¨ k Z 1 : k ) p ( x ¨ k Z 1 : k )
where K L ( q ( x ) p ( x ) ) q ( x ) log q ( x ) p ( x ) d x . The optimal solution of Equation (22) can be obtained by [9,21,26]
ln q ^ ( ϕ ) = E x ¨ k ( ϕ ) ln p x ¨ k , Z k Z 1 : k - 1 + c ϕ
where ϕ denotes an arbitrary element in x ¨ k , E [ ] denotes the expectation, x ¨ k ( ϕ ) denotes the elements set in x ¨ k except for ϕ , and c ϕ is an irrelevant constant for element ϕ .

3.2. The Update of Unknown Student-t Distribution Parameters

Based on the assumption that the target state is independent of the Student-t distribution parameters, the joint posterior density of the augmented target state can be factorized as
p ( x ¨ k Z 1 : k ) = p ( R k , u k , ν k Z 1 : k ) p ( x k Z 1 : k )
where the unknown Student-t distribution parameters are integrated out. Based on (24), the target state can be estimated by particle samples and the Student-t distribution parameters can be updated by the VB approximation method.
In this subsection, we derive the update of Student-t distribution parameters for each particle. At time k , let x ¨ k = { x ¨ k ( i ) } i = 1 N = { x k ( i ) , R k ( i ) , u k ( i ) , ν k ( i ) } i = 1 N is the augmented target state where R k ( i ) , u k ( i ) , ν k ( i ) are the Student-t distribution parameters with respect to the ith particle, and N is the number of particles. Assume the predicted density of x ¨ k ( i ) at time k can be expressed as
p ( x ¨ k ( i ) Z 1 : k 1 ) = ω k k 1 ( i ) δ ( x k x k ( i ) ) IW ( R k ( i ) ; υ k k 1 ( i ) , V k k 1 ( i ) ) × G u k ( i ) ; ν k ( i ) 2 , ν k ( i ) 2 G ( ν k ( i ) ; α k k 1 ( i ) , β k k 1 ( i ) )
where υ k k 1 ( i ) , V k k 1 ( i ) , α k k 1 ( i ) and β k k 1 ( i ) are the predicted sufficient statistics with respect to R k ( i ) and ν k ( i ) . Then the joint density of p ( x ¨ k ( i ) , z k Z 1 : k - 1 ) can be expressed as
p ( x ¨ k ( i ) , z k Z 1 : k - 1 ) = ω k k 1 ( i ) δ ( x k x k ( i ) ) N z k ; h ( x k ( i ) ) , R k ( i ) u k ( i ) × IW ( R k ( i ) ; υ k k 1 ( i ) , V k k 1 ( i ) ) G u k ( i ) ; ν k ( i ) 2 , ν k ( i ) 2 × G ( ν k ( i ) ; α k k 1 ( i ) , β k k 1 ( i ) )
where z k is the measurement with respect to the target represented by particle x k ( i ) . Based on Equation (26), ln p ( x ¨ k ( i ) , z k Z 1 : k - 1 ) can be expressed as
ln p ( x ¨ k ( i ) , z k Z 1 : k - 1 ) = 1 2 ln R k ( i ) + d 2 ln u k ( i ) u k ( i ) 2 t r ( R k ( i ) ) 1 Ξ k ( i ) υ k k 1 ( i ) 2 ln R k ( i ) 1 2 t r ( R k ( i ) ) 1 V k k 1 ( i ) + ν k ( i ) 2 ln ν k ( i ) 2 ln Γ ( ν k ( i ) 2 ) + ( ν k ( i ) 2 1 ) ln u k ( i ) ν k ( i ) 2 u k ( i ) + ( α k k 1 ( i ) 1 ) ln ν k ( i ) β k k 1 ( i ) ν k ( i ) + c x ¨ k ( i )
where Ξ k ( i ) = ( z k h ( x k ( i ) ) ) ( z k h ( x k ( i ) ) ) T denotes the innovation covariance matrix. t r ( ) denotes the trace operation. c x ¨ k ( i ) denotes an irrelevant constant for variables x k ( i ) , R k ( i ) , u k ( i ) , and ν k ( i ) .
Letting ϕ = R k ( i ) and using Equation (27) in Equation (23), we can obtain
ln q ^ ( R k ( i ) ) = υ k k 1 ( i ) + 1 2 ln R k ( i ) 1 2 t r ( R k ( i ) ) 1 V k k 1 ( i ) + u k ( i ) Ξ k ( i ) + c R k ( i )
The posterior distribution q ^ ( R k ( i ) ) of R k ( i ) is an IW distribution, i.e.,
q ^ ( R k ( i ) ) = IW ( R k ( i ) ; υ k ( i ) , V k ( i ) )
with parameters
υ k ( i ) = υ k k 1 ( i ) + 1
V k ( i ) = V k k 1 ( i ) + E [ u k ( i ) ] Ξ k ( i )
Letting ϕ = ν k ( i ) and using Equation (27) in Equation (23), we can obtain
ln q ^ ( ν k ( i ) ) = ν k ( i ) 2 ln ν k ( i ) 2 ln Γ ( ν k ( i ) 2 ) + ν k ( i ) 2 ln u k ( i ) ν k ( i ) 2 u k ( i ) + ( α k k 1 ( i ) 1 ) ln ν k ( i ) β k k 1 ( i ) ν k ( i ) + c ν k ( i )
Using Stirling’s approximation in [27]
ln Γ ( ν k ( i ) 2 ) ν k ( i ) 1 2 ln ν k ( i ) 2 ν k ( i ) 2
And ln q ^ ( ν k ( i ) ) can be expressed as
ln q ^ ( ν k ( i ) ) = ( α k k 1 ( i ) + 1 2 1 ) ln ν k ( i ) ( β k k 1 ( i ) 1 2 ( 1 + E [ ln u k ( i ) ] E [ u k ( i ) ] ) ) ν k ( i )
The posterior distribution q ^ ( ν k ( i ) ) of ν k ( i ) is a Gamma distribution, i.e.,
q ^ ( ν k ( i ) ) = G ( ν k ( i ) ; α k ( i ) , β k ( i ) )
with parameters
α k ( i ) = α k k 1 ( i ) + 1 2
β k ( i ) = β k k 1 ( i ) 1 2 ( 1 + E [ ln u k ( i ) ] E [ u k ( i ) ] )
Letting ϕ = u k ( i ) and using Equation (27) in Equation (23), we can obtain
ln q ^ ( u k ( i ) ) = ( ν k ( i ) + d 2 1 ) ln u k ( i ) 1 2 [ ν k ( i ) + t r ( R k ( i ) ) 1 Ξ k ( i ) ] u k ( i ) + c u k ( i )
The posterior distribution q ^ ( u k ( i ) ) of u k ( i ) is a Gamma distribution, i.e.,
q ^ ( u k ( i ) ) = G ( u k ( i ) ; ν k ( i ) + d 2 , 1 2 [ ν k ( i ) + t r ( R k ( i ) ) 1 Ξ k ( i ) ] )
Then we can obtain
E [ u k ( i ) ] = a k ( i ) / b k ( i )
E [ ln u k ( i ) ] = φ ( a k ( i ) ) ln b k ( i )
where a k ( i ) = E [ ν k ( i ) ] + d 2 , b k ( i ) = 1 2 E [ ν k ( i ) ] + t r ( R k ( i ) ) 1 Ξ k ( i ) . Since the parameters in Equations (30), (31), (36), (37), (40) and (41) are coupled, it can be solved iteratively by the fixed point method in [21].

3.3. The Implementation of RSMC-PHD Filter

In this subsection, we introduce the Student-t distribution into the SMC-PHD filter and present an implementation of the robust SMC-PHD filter with unknown heavy-tailed measurement noise. Assume that the multi-target posterior intensity is represented by a weighted particles set { ω k 1 ( i ) , x k 1 ( i ) , R k 1 ( i ) , u k - 1 ( i ) , ν k 1 ( i ) } i = 1 L k 1 at time k 1 , i.e.,
D k - 1 ( x ¨ k 1 Z 1 : k 1 ) = i = 1 L k 1 ω k - 1 ( i ) δ ( x k 1 x k 1 ( i ) ) IW ( R k 1 ( i ) ; υ k 1 ( i ) , V k 1 ( i ) ) × G u k ( i ) ; ν k 1 ( i ) 2 , ν k 1 ( i ) 2 G ( ν k 1 ( i ) ; α k 1 ( i ) , β k 1 ( i ) )
Assume R k , u k , and ν k are independent and the predicted intensity at time k can be expressed as
D k k 1 ( x ¨ k Z 1 : k 1 ) = i = 1 L k 1 + J k ω k k 1 ( i ) δ ( x k x k ( i ) ) G u k ( i ) ; ν k ( i ) 2 , ν k ( i ) 2 × IW ( R k ( i ) ; υ k k 1 ( i ) , V k k 1 ( i ) ) G ( ν k ( i ) ; α k k 1 ( i ) , β k k 1 ( i ) )
where ω k k 1 ( i ) and x k ( i ) are given in Equations (14) and (15). There are L k 1 particles for survival targets and J k particles for birth targets. Generally, the dynamic of measurement noise is unknown and we use the similar heuristic dynamic in [9] for the predicted sufficient statistics. For the particles of survival targets i = 1 , 2 , , L k 1 , the predicted sufficient statistics are given by
υ k k 1 ( i ) = ρ ( υ k 1 ( i ) d 1 ) + d + 1 , V k k 1 ( i ) = ρ V k 1 ( i )
α k k 1 ( i ) = ρ α k 1 ( i ) , β k k 1 ( i ) = ρ β k 1 ( i )
where ρ ( 0 , 1 ] is the decreasing factor. For the particles of birth targets i = L k 1 + 1 , L k 1 + 2 , , L k 1 + J k , the predicted sufficient statistics are given by
υ k k 1 ( i ) = υ γ , k ( i ) , V k k 1 ( i ) = V γ , k ( i )
α k k 1 ( i ) = ρ α k 1 ( i ) , β k k 1 ( i ) = ρ β k 1 ( i )
where υ γ , k ( i ) , V γ , k ( i ) , α γ , k ( i ) and β γ , k ( i ) are sufficient statistics with respect to the birth targets.
The posterior intensity can be expressed as
D k ( x ¨ k Z 1 : k ) = i = 1 L k 1 + J k ω k ( i ) δ ( x k x k ( i ) ) G u k ( i ) ; ν k ( i ) 2 , ν k ( i ) 2 × IW ( R k ( i ) ; υ k ( i ) , V k ( i ) ) G ( ν k ( i ) ; α k ( i ) , β k ( i ) )
where ω k ( i ) is given in (17). It is worth mentioning that the likelihood function is g k ( z x ¨ k ) = St ( z ; h ( x k ( i ) ) , R k ( i ) , ν k ( i ) ) . Then, the sufficient statistics υ k ( i ) , V k ( i ) , α k ( i ) , and β k ( i ) are updated by
R k ( i ) ( j ) = V k ( i ) ( j 1 ) / ( υ k ( i ) d 1 )
R ˜ k ( i ) ( j ) = R k ( i ) ( j ) / u k ( i ) ( j - 1 )
γ k ( i ) ( j ) = t r ( Ξ k ( i ) / R ˜ k ( i ) ( j ) )
a k ( i ) ( j ) = ( ν k ( i ) ( j 1 ) + d ) / 2
b k ( i ) ( j ) = ( ν k ( i ) ( j - 1 ) + γ k ( i ) ( j ) ) / 2
u k ( i ) ( j ) = a k ( i ) ( j ) / b k ( i ) ( j )
β k ( i ) ( j ) = β k k 1 ( i ) 1 2 φ ( a k ( i ) ( j ) ) ln ( b k ( i ) ( j ) ) 2 + u k ( i ) ( j ) 2
V k ( i ) ( j ) = V k k 1 ( i ) + Ξ k ( i ) u k ( i ) ( j )
ν k ( i ) ( j ) = α k ( i ) / β k ( i ) ( j )
where ( ) ( i ) ( j ) denotes the update of parameter ( ) ( i ) at the jth iteration. The initial values are given by V k ( i ) ( 0 ) = V k k 1 ( i ) , υ k ( i ) = υ k k 1 ( i ) + 1 , α k ( i ) = α k k 1 ( i ) + 1 / 2 , β k ( i ) ( 0 ) = β k k 1 ( i ) , ν k ( i ) ( 0 ) = α k ( i ) / β k ( i ) ( 0 ) .
It should be noted that the innovation covariance matrix Ξ k ( i ) = ( z k h ( x k ( i ) ) ) ( z k h ( x k ( i ) ) ) T for particle x k ( i ) is needed in each iteration. Since there is no explicit association between measurements and targets, the measurement origin is ambiguous. Considering the fact that the measurement with larger likelihood value is more likely generated by a potential target, we choose the measurement with the largest likelihood value to calculate the innovation covariance matrix as follows
Ξ k ( i ) = ( z k l h ( x k ( i ) ) ) ( z k l h ( x k ( i ) ) ) T
where l = arg max p I g k p ( x ¨ k ( i ) ) , I = 1 , , Z k . g k p ( x ¨ k ( i ) ) is the normalized likelihood function value given by
g k p ( x ¨ k ( i ) ) = p D , k g k ( z k p x ¨ k ( i ) ) κ k ( z k p ) + C k ( z k p )
C k ( z k p ) = j = 1 L k 1 + J k p D , k g k ( z k p x ¨ k ( i ) ) ω k k 1 ( i )

3.4. The Modification of Particles Weight

The estimate of target number relies on the updated weights of particles in the SMC-PHD filter. In our paper, the weight is updated by Equation (17) for each particle. The likelihood function is g k ( z x ¨ k ) = St ( z ; h ( x k ( i ) ) , R k ( i ) , ν k ( i ) ) , and the updated weight of the ith particle is given by
ω k ( i ) = ( 1 p D , k ) ω k k 1 ( i ) + p = 1 Z k g k p ( x ¨ k ( i ) ) ω k k 1 ( i ) St ( z k p ; h ( x k ( i ) ) , R k ( i ) , ν k ( i ) )
Figure 1 gives the illustration of the measurement likelihood function. We can see that the Student-t distribution has a heavy-tailed characteristic and it can deal with outliers well by increasing the weights of outliers. However, the weight of clutter will increase at the same time. Hence, some clutter may be regarded as target-generated measurements, resulting in the overestimate of the target number at the current time.
To solve this problem, a strategy is adopted to modify the updated weight in this subsection. In the PHD filter, one target can produce at most one measurement and only one measurement can be attributed to one target per time step [4], named as the ‘one-to-one’ assumption. For each particle, the normalized measurement likelihood value g k p ( x ¨ k ( i ) ) can be obtained by Equations (59) and (60). Let J = { p = 1 , , Z k g k p ( x ¨ k ( i ) ) σ } , σ is a preset threshold. If J 2 , it indicates there might be multiple measurements associated with particle x k ( i ) . In this case, the g k p ( x ¨ k ( i ) ) is modified as
g ˜ k p ( x ¨ k ( i ) ) = g k p ( x ¨ k ( i ) ) , p = l     o r     p J g k q ( x ¨ k ( i ) ) , p l     &     p J
where q = arg min   p I g k p ( x ¨ k ( i ) ) , & is a logic and operation and o r is a logic or operation. In our paper, the measurement with the largest normalized likelihood value is regarded as the corresponding measurement generated from the target corresponding to particle x k ( i ) , and other measurements are regarded as clutter. The proposed strategy retains the maximum likelihood value and penalizes the other larger likelihood value to hold the ‘one-to-one’ assumption.
Then the modified weight can be expressed as
ω k ( i ) = ( 1 p D , k ) ω k k 1 ( i ) + p = 1 Z k g ˜ k p ( x ¨ k ( i ) ) ω k k 1 ( i )
The robust SMC-PHD filter is summarized in Algorithm 1.
Remark 1:
Although the heavy-tailed characteristic of the Student-t distribution can deal with outliers, the target might still miss when the weights of outliers are lower than the extracted threshold and the target number would be underestimated. In our paper, the weight modification of the particles is mainly aimed to deal with the target number overestimate problem caused by clutter at the current time.
Algorithm 1. The robust SMC-PHD filter.
Step 1 Prediction
for i = 1 , 2 , , L k 1
     x k ( i ) q k ( x k 1 ( i ) , Z k ) , ω k k 1 ( i ) ω k 1 ( i ) p S , k f k k 1 ( x k ( i ) x k 1 ( i ) ) q k ( x k ( i ) x k 1 ( i ) , Z k )
     υ k k 1 ( i ) = ρ ( υ k 1 ( i ) d 1 ) + d + 1 , V k k 1 ( i ) = ρ V k 1 ( i ) α k k 1 ( i ) = ρ α k - 1 ( i ) , β k k 1 ( i ) = ρ β k - 1 ( i )
end for
for i = L k 1 + 1 , L k 1 + 2 , , L k 1 + J k
     x k ( i ) p k ( Z k ) , ω k k 1 ( i ) 1 J k γ k ( x k ( i ) ) p k ( x k ( i ) Z k )
     υ k k 1 ( i ) = υ γ , k ( i ) , V k k 1 ( i ) = V γ , k ( i )
     α k k 1 ( i ) = α γ , k ( i ) , β k k 1 ( i ) = β γ , k ( i )
end for
Step 2 Update
For i = 1 , 2 , , L k 1 + J k
         R k ( i ) = V k k 1 ( i ) / ( υ k k 1 ( i ) d 1 ) , ν k ( i ) = α k k 1 ( i ) / β k k 1 ( i ) g k ( z x ¨ k ( i ) ) = St ( z ; h ( x k ( i ) ) , R k ( i ) , ν k ( i ) )
         g k p ( x ¨ k ( i ) ) = p D , k g k ( z k p x ¨ k ( i ) ) κ k ( z k p ) + C k ( z k p ) C k ( z k p ) = j = 1 L k 1 + J k p D , k g k ( z k p x ¨ k ( i ) ) ω k k 1 ( i )
         I = 1 , , Z k , J = p = 1 , , Z k g k p ( x ¨ k ( i ) ) σ
         l = arg max p I g k p ( x ¨ k ( i ) ) , q = arg min p I g k p ( x ¨ k ( i ) )
         g ˜ k p ( x ¨ k ( i ) ) = g k p ( x ¨ k ( i ) ) , p = l     o r     p J g k q ( x ¨ k ( i ) ) , p l     &     p J
         ω k ( i ) = ( 1 p D , k ) ω k k 1 ( i ) + p = 1 Z k g ˜ k p ( x ¨ k ( i ) ) ω k k 1 ( i )
Perform iteration initialization, set the iteration number τ , and update the parameters of measurement noise by Equations (49)–(60).
end for
Step 3 Resampling
Step 4 State extraction
    Step 3 and step 4 are the same as that in the standard SMC-PHD filter.

4. Simulation Results

To reveal the performance of the proposed robust SMC-PHD (RSMC-PHD) filter, we compare the Gaussian (Normal) Gamma inverse Wishart Gamma PHD (NGIWG-PHD) filter [23] and the SMC-PHD filter [6] with the proposed filter. For each simulation, 100 Monte Carlo trials are performed. The target number and optimal sub-pattern assignment (OSPA) [28] distance are chosen as the metric, where the parameters of OSPA are p = 2 and c = 100 .

4.1. The Choice of Threshold σ

In Section 3.4, threshold σ is utilized to distinguish the target-generated measurements from clutter. In the SMC-PHD filter, the underlying target relies on the updated weight of each particle, and the likelihood value in Equation (59) can directly reflect the contribution of a given measurement or clutter to the underlying target. In most cases, the target-generated measurements usually have the largest likelihood value for each particle. If σ is larger, some clutter might be still regarded as target-generated measurements, and the overestimate of the target number cannot be solved. By contrast, if σ is smaller, the likelihood values of some clutter which contribute a small proportion to the updated weight will be modified. However, this modification will have no obvious effect on the updated weight of the particle except for unnecessary complexity. As we all know, N p a r t i c l e is the number of particles for each expected target in the SMC-PHD filter and it is used to extract the weighted particles to approximate the posterior intensity. To some extent, 1 / N p a r t i c l e can approximately reflect the average contribution of each particle for an underlying target. Therefore, we choose σ = 1 / N p a r t i c l e as the threshold.

4.2. Linear Scenario

The target state of each target is x k = [ x k , x ˙ k , y k , y ˙ k ] T , consisting of the position [ x k , y k ] T and velocity [ x ˙ k , y ˙ k ] T . The target motion model is given by
x k = F x k 1 + G w k
where
F = 1 Δ 0 0 0 1 0 0 0 0 1 Δ 0 0 0 1
G = Δ 1 0 0 0 0 Δ 1 T
w k N ( ; 0 2 , Q k ) , Q k = diag ( [ σ w 2 , σ w 2 ] T ) , σ w = 5     m / s 2 is the standard deviation of the process noise, Δ = 1   s is the sampling period.
The observation model is formulated by
z k = H x k + ε k
where
H = 1 0 0 0 0 0 1 0
The heavy-tailed measurement noise corrupted by outliers is represented as [21,23]
ε k N ( ε k ; 0 2 , R 0 )                     1 η N ( ε k ; 0 2 , R n )                           η
where η denotes the probability of the measurement noise outlier. R 0 = diag ( [ 10 2 , 10 2 ] T ) is the nominal noise variance, and R n = 20 R 0 .
The model of the birth target is a Poisson RFS with intensity
γ k ( x ) = j = 1 3 0.1 N ( x ; m γ ( j ) , P γ )
where m γ ( 1 ) = [ 1200 , 0 , 400 , 0 ] T , m γ ( 2 ) = [ 600 , 0 , 700 , 0 ] T , m γ ( 3 ) = [ 600 , 0 , 300 , 0 ] T , P γ = diag ( [ 100 , 100 , 100 , 100 ] T ) . The survival probability is p S , k = 0.99 and the detection probability is p D , k = 0.98 . The surveillance region is [ 0 , 2000 ]       m × [ 1000 , 1000 ]       m . The clutter is uniformly distributed over the surveillance region, and the average clutter number is λ = 10 . For the particles of birth targets, V γ , k ( i ) = diag ( [ 10 2 , 10 2 ] T ) , υ γ , k ( i ) = 4 , α γ , k ( i ) = 3 , β γ , k ( i ) = 1 . The number of iteration is τ = 5 , the decreasing factor is ρ = 0.98 , and the particles number is N p a r t i c l e = 800 .
The trajectories of the targets are shown in Figure 2, where circles are the beginning positions and triangles are the ending positions.
To illustrate the performance of the proposed filter under the Gaussian measurement noise, η is set to 0. Figure 3 and Figure 4 show the estimate of target number and OSPA distance of the three filters, respectively. From Figure 3, we can see that all the filters achieve unbiased estimate of the target number and have a comparable estimate accuracy under Gaussian measurement noise. This is because the SMC-PHD filter utilizes the true measurement noise covariance. For the NGIWG-PHD filter and the RSMC-PHD filter, the DOF and scale matrix of the Student-t distribution can be adjusted automatically and the target tracking under Gaussian measurement noise realized. Figure 4 shows the OSPA distance of the three filters. Obviously, all the filters have an approximate OSPA distance.
To verify the multi-tracking performance under heavy-tailed measurement noise, η is set to 0.2. The remaining parameters are the same as above.
Figure 5 and Figure 6 show the estimate of target number and OSPA distance of the three filters, respectively. Under heavy-tailed measurement noise, the SMC-PHD filter will diverge because the assumed measurement noise is not matched with the true measurement noise. For the NGIWG-PHD filter and the RSMC-PHD filter, the two filters will produce a weight which is non-negligible for filter update when there are outliers in measurements. Thus, the estimate accuracy of the target number of the NGIWG-PHD filter and the RSMC-PHD filter is higher than that of the SMC-PHD filter. From Figure 6, it can be observed that the RSMC-PHD filter has the best performance on OSPA distance.
To verify the validity of the weight modification method, we compare the proposed RSMC-PHD filter with the proposed robust SMC-PHD filter without weight modification (RSMC-PHD(M1)). Figure 7 and Figure 8 show the mean absolute error (MAE) of the target number and the average OSPA (AOSPA) distance for the RSMC-PHD(M1) filter and the RSMC-PHD filter under different clutter number. The MAE of the target number and AOSPA are given by
MAE number = 1 M C T j = 1 M C k = 1 T N k j N ^ k j
AOSPA = 1 M C T j = 1 M C k = 1 T OSPA k j
where M C is the number of Monte Carle trials, T is the simulation tracking time, N k j and N ^ k j are the true and the estimated target numbers at time k in the jth Monte Carle trial, OSPA k j is the corresponding OSPA distance.
Figure 7 illustrates that the MAE estimate of target number for the RSMC-PHD filter is lower than that of the RSMC-PHD(M1) filter. The more the clutter number, the higher is the probability that the clutter is regarded as the target-generated measurement, resulting in an overestimate of the target number at the current time. From Figure 8, it can be seen that the RSMC-PHD filter also outperforms the RSMC-PHD(M1) filter on AOSPA distance.

4.3. Nonlinear Scenario

To further evaluate the performance of the proposed filter, we consider a nonlinear scenario. For the NGIWG-PHD filter, EKF is used to handle nonlinearity.
The target state transition function is given by
x k = F c t x k 1 + G c t w k
where
F c t = 1 sin ω Δ / ω 0 ( 1 cos ω Δ ) / ω 0 0 cos ω Δ 0 ( 1 cos ω Δ ) / ω 0 0 ( 1 cos ω Δ ) / ω 1 sin ω Δ / ω 0 0 sin ω Δ / ω 0 cos ω Δ 0 0 0 0 0 1
G c t = Δ 2 / 2 Δ 0 0 0 0 0 Δ 2 / 2 Δ 0 0 0 0 0 1 T
The target state is x k = [ x k , x ˙ k , y k , y ˙ k , ω ] T , ω is the turn rate, w k N ( ; 0 2 , Q k ) , Q k = diag ( [ σ x 2 , σ y 2 , σ ω 2 ] T ) , σ x = σ y = 5     m / s 2 , σ ω = 5 ( π / 180 )     rad / s , Δ = 1     s .
The observation model is formulated by
z k = x k 2 + y k 2 arctan ( y k / x k ) + ε k
Assume the nominal measurement noise variance is R 0 = diag ( [ 10 2 , π / 180   2 ] T ) , and the true measurement noise is represented as (69) with R n = 20 R 0 and η = 0.2 .
The model of birth target is a Poisson RFS with intensity
γ k ( x ) = j = 1 3 0.02 N ( x ; m γ ( j ) , P γ )
where P γ = diag ( [ 900 , 900 , 900 , 900 , ( 6 × π / 180 ) 2 ] T ) , m γ ( 1 ) = [ - 400 , 0 , 600 , 0 , 0 ] T , m γ ( 2 ) = [ - 250 , 0 , 250 , 0 , 0 ] T , and m γ ( 3 ) = [ 250 , 0 , 450 , 0 , 0 ] T . The surveillance region is 0 , π rad × 0 , 1500 m . The clutter is uniformly distributed over the surveillance region and the average clutter number is λ = 10 . For the particles of birth targets, V γ , k ( i ) = diag ( [ 10 2 , π / 180   2 ] T ) , υ γ , k ( i ) = 4 , α γ , k ( i ) = 3 , β γ , k ( i ) = 1 . The remaining parameters are the same as that in Section 4.2.
The trajectories of the targets are shown in Figure 9, where circles are the beginning positions and triangles are the ending positions.
Figure 10 and Figure 11 show the estimate of target number and OSPA distance for the two filters, respectively. It indicates that the NGIWG-PHD filter performs worse in the nonlinear system. This is because the NGIWG-PHD filter uses EKF to linearize the nonlinear model, and the estimate error of the target state will become large. Under the influence of heavy-tailed measurement noise, the target will miss and the target number will be underestimated. On the contrary, the RSMC-PHD filter is not subject to nonlinear constraint, and has a better performance in the nonlinear system.

5. Conclusions

In this paper, a robust SMC-PHD filter with unknown heavy-tailed measurement noise is proposed. The proposed filter uses the Student-t distribution to model the unknown measurement noise. The IW distribution is used to model the unknown scale matrix parameter. Meanwhile, the Gamma distribution is used to model the unknown DOF parameter. Then, the unknown noise parameters are updated by the VB technique within the SMC-PHD filter framework. In addition, a strategy is applied to solve the overestimate of the target number induced by the Student-t distribution. Simulation results under the linear system and nonlinear system show that the proposed filter has a better performance than the compared filters with the unknown heavy-tailed measurement noise, especially in a nonlinear system.

Author Contributions

Conceptualization, Y.G. and C.C.; methodology, Y.G.; software, Y.G.; validation, Y.G., C.C.; formal analysis, C.C.; investigation, Y.G.; resources, Y.G.; data curation, Y.G.; writing—original draft preparation, Y.G.; writing—review and editing, Y.G.; visualization, Y.G.; supervision, C.C.; project administration, Y.G. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Mahler, R.P.S. Statistical Multisource-Multitarget Information Fusion; Artech House: Norwood, MA, USA, 2007. [Google Scholar]
  2. Blom, H.; Bloem, E. Interacting multiple model joint probabilistic data association avoiding track coalescence. In Proceedings of the 41st IEEE Conference on Decision and Control, Las Vegas, NV, USA, 10–13 December 2002; pp. 3408–3415. [Google Scholar]
  3. Blackman, S. Multiple hypothesis tracking for multiple target tracking. IEEE Aerosp. Electron. Syst. Mag. 2004, 19, 5–18. [Google Scholar] [CrossRef]
  4. Mahler, R.P.S. Multitarget bayes filtering via first-order multitarget moments. IEEE Trans. Aerosp. Electron. Syst. 2003, 39, 1152–1178. [Google Scholar] [CrossRef]
  5. Vo, B.-N.; Ma, W.-K. The Gaussian Mixture Probability Hypothesis Density Filter. IEEE Trans. Signal Process. 2006, 54, 4091–4104. [Google Scholar] [CrossRef]
  6. Vo, B.-N.; Singh, S.S.; Boucet, A. Sequential monte carlo methods for multi-target filtering with random finite sets. IEEE Trans. Aerosp. Electron. Syst. 2005, 41, 1224–1245. [Google Scholar] [CrossRef] [Green Version]
  7. Zhou, X.; Li, Y.; He, B. Entropy distribution and coverage rate-based birth intensity estimation in GM-PHD filter for multi-target visual tracking. Signal Process. 2014, 94, 650–660. [Google Scholar] [CrossRef]
  8. Yan, B.; Xu, N.; Xu, L.; Li, M.Q.; Cheng, P. An improved partitioning algorithm based on FCM algorithm for extended target tracking in PHD filter. Digit. Signal Process. 2019, 90, 54–70. [Google Scholar] [CrossRef]
  9. Sarkka, S.; Nummenmaa, A. Recursive Noise Adaptive Kalman Filter ing by Variational Bayesian Approximations. IEEE Trans. Autom. Control 2009, 54, 596–600. [Google Scholar] [CrossRef]
  10. Sarkka, S.; Hartikainen, J. Non-linear noise adaptive Kalman filtering via variational Bayes. In Proceedings of the 2013 IEEE International Workshop on Machine Learning for Signal Processing (MLSP), Southampton, UK, 22–25 September 2013; pp. 1–6. [Google Scholar]
  11. Huang, Y.; Zhang, Y.; Wu, Z.; Li, N.; Chambers, J.A. A Novel Adaptive Kalman Filter With Inaccurate Process and Measurement Noise Covariance Matrices. IEEE Trans. Autom. Control 2018, 63, 594–601. [Google Scholar] [CrossRef] [Green Version]
  12. Wu, X.; Huang, G.M.; Gao, J. Adaptive noise variance identification for probability hypothesis density-based multi-target filter by variational Bayesian approximations. IET Radar Sonar Navig. 2013, 7, 895–903. [Google Scholar] [CrossRef]
  13. Yang, J.; Ge, H. Adaptive probability hypothesis density filter based on variational Bayesian approximation for multi-target tracking. IET Radar Sonar Navig. 2013, 7, 959–967. [Google Scholar] [CrossRef]
  14. Wu, X.; Huang, G.; Gao, J. Particle filters for probability hypothesis density filter with the presence of unknown measurement noise covariance. Chin. J. Aeronaut. 2013, 26, 1517–1523. [Google Scholar] [CrossRef] [Green Version]
  15. Bilik, I.; Tabrikian, J. Maneuvering Target Tracking in the Presence of Glint using the Nonlinear Gaussian Mixture Kalman Filter. IEEE Trans. Aerosp. Electron. Syst. 2010, 46, 246–262. [Google Scholar] [CrossRef]
  16. Kim, J.; Tandale, M.; Menon, P.; Ohlmeyer, E. Particle Filter for Ballistic Target Tracking with Glint Noise. J. Guidan. Control Dynam. 2010, 33, 1–4. [Google Scholar] [CrossRef]
  17. Li, K.; Chang, L.; Hu, B. A Variational Bayesian-Based Unscented Kalman Filter with Both Adaptivity and Robustness. IEEE Sensors J. 2016, 16, 6966–6976. [Google Scholar] [CrossRef]
  18. Piche, R.; Sarkka, S.; Hartikainen, J. Recursive outlier-robust filtering and smoothing for nonlinear systems using the multivariate student-t distribution. In Proceedings of the 2012 IEEE International Workshop on Machine Learning for Signal Processing, Santander, Spain, 23–26 September 2012; pp. 1–6. [Google Scholar]
  19. Huang, Y.; Zhang, Y.; Li, N.; Chambers, J. Robust student’s t based nonlinear filter and smoother. IEEE Trans. Aerosp. Electron. Syst. 2016, 52, 2586–2596. [Google Scholar] [CrossRef] [Green Version]
  20. Huang, Y.; Zhang, Y. Robust Student’s t-Based Stochastic Cubature Filter for Nonlinear Systems with Heavy-Tailed Process and Measurement Noises. IEEE Access 2017, 5, 7964–7974. [Google Scholar] [CrossRef]
  21. Huang, Y.; Zhang, Y.; Wu, Z.; Li, N.; Chambers, J. A Novel Robust Student’s t-Based Kalman Filter. IEEE Trans. Aerosp. Electron. Syst. 2017, 53, 1545–1554. [Google Scholar] [CrossRef] [Green Version]
  22. Li, W.; Jia, Y.; Du, J.; Zhang, J. PHD filter for multi-target tracking with glint noise. Signal Process. 2014, 94, 48–56. [Google Scholar] [CrossRef]
  23. Dong, P.; Jing, Z.; Leung, H.; Shen, K.; Li, M. The Labeled Multi-Bernoulli Filter for Multitarget Tracking with Glint Noise. IEEE Trans. Aerosp. Electron. Syst. 2018, 55, 2253–2268. [Google Scholar] [CrossRef]
  24. Li, P.; Xu, C.; Wang, W.; Su, S. Robust Student’s T Distribution Based PHD/CPHD Filter for Multiple Targets Tracking Using Variational Bayesian Approach. Radioengineering 2020, 29, 529–539. [Google Scholar] [CrossRef]
  25. Xu, D.; Shen, C.; Shen, F. A Robust Particle Filtering Algorithm with Non-Gaussian Measurement Noise Using Student-t Dis-tribution. IEEE Signal Process. Letters 2013, 21, 30–34. [Google Scholar] [CrossRef]
  26. Zhu, H.; Leung, H.; He, Z. A variational Bayesian approach to robust sensor fusion based on Student-t distribution. Inf. Sci. 2013, 221, 201–214. [Google Scholar] [CrossRef]
  27. Christmas, J.; Everson, R. Robust Autoregression: Student-t Innovations Using Variational Bayes. IEEE Trans. Signal Process. 2010, 59, 48–57. [Google Scholar] [CrossRef] [Green Version]
  28. Schuhmacher, D.; Vo, B.-T. A Consistent Metric for Performance Evaluation of Multi-Object Filters. IEEE Trans. Signal Process. 2008, 56, 3447–3457. [Google Scholar] [CrossRef] [Green Version]
Figure 1. The illustration of measurement likelihood function.
Figure 1. The illustration of measurement likelihood function.
Sensors 21 03611 g001
Figure 2. Trajectories of the targets.
Figure 2. Trajectories of the targets.
Sensors 21 03611 g002
Figure 3. The estimate of target number.
Figure 3. The estimate of target number.
Sensors 21 03611 g003
Figure 4. The estimate of OSPA.
Figure 4. The estimate of OSPA.
Sensors 21 03611 g004
Figure 5. The estimate of target number.
Figure 5. The estimate of target number.
Sensors 21 03611 g005
Figure 6. The estimate of OSPA.
Figure 6. The estimate of OSPA.
Sensors 21 03611 g006
Figure 7. The MAE estimate of target number.
Figure 7. The MAE estimate of target number.
Sensors 21 03611 g007
Figure 8. The estimate of AOSPA.
Figure 8. The estimate of AOSPA.
Sensors 21 03611 g008
Figure 9. Trajectories of the targets.
Figure 9. Trajectories of the targets.
Sensors 21 03611 g009
Figure 10. The estimate of target number.
Figure 10. The estimate of target number.
Sensors 21 03611 g010
Figure 11. The estimate of OSPA.
Figure 11. The estimate of OSPA.
Sensors 21 03611 g011
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Gong, Y.; Cui, C. A Robust SMC-PHD Filter for Multi-Target Tracking with Unknown Heavy-Tailed Measurement Noise. Sensors 2021, 21, 3611. https://doi.org/10.3390/s21113611

AMA Style

Gong Y, Cui C. A Robust SMC-PHD Filter for Multi-Target Tracking with Unknown Heavy-Tailed Measurement Noise. Sensors. 2021; 21(11):3611. https://doi.org/10.3390/s21113611

Chicago/Turabian Style

Gong, Yang, and Chen Cui. 2021. "A Robust SMC-PHD Filter for Multi-Target Tracking with Unknown Heavy-Tailed Measurement Noise" Sensors 21, no. 11: 3611. https://doi.org/10.3390/s21113611

APA Style

Gong, Y., & Cui, C. (2021). A Robust SMC-PHD Filter for Multi-Target Tracking with Unknown Heavy-Tailed Measurement Noise. Sensors, 21(11), 3611. https://doi.org/10.3390/s21113611

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop