随机集的概率假设密度粒子滤波

多目标跟踪问题中,当目标数已知时,可以用概率数据互联(PDA)或联合概率数据互联(JPDA)算法。而当目标数未知或随时间变化时,需要对不同目标数的跟踪进行比较。可以把目标集看作随机集进行讨论,目标数N是随机变量。随机集的跟踪通过有限集统计(FISST)理论来完成。文中讨论了用粒子滤波实现跟踪随机集的方法。实验表明,在杂波环境下,粒子滤波可以稳健跟踪目标状态和目标数。     

新生目标强度未知的双门限粒子PHD滤波器

传统粒子概率假设密度(PHD)滤波器假定新生目标强度已知,当新生目标在整个观测区域随机出现时不再适用。为解决新生目标强度未知时的多目标跟踪问题,提出了一种基于量测信息的双门限粒子PHD(PHD-DT)滤波器。首先基于似然函数设定门限对存活目标量测进行粗提取,利用上一时刻的目标估计值构建圆形波门进行精细提取,并对门限设定方法进行分析,然后根据提取结果对目标PHD进行分解,得到存活目标和新生目标的PHD预测及更新表达式,最后给出了滤波器的实现方法并同基于量测驱动的PHD(PHD-M)滤波器和Logic+联合概率数据互联(JPDA)方法进行了仿真对比。仿真结果表明,在新生目标强度未知时,PHD-DT可有效避免Logic+JPDA在杂波背景下因航迹起始错误带来的估计误差,并较好地解决了PHD-M的目标数目过估问题,多目标估计性能更优,且杂波越强性能优势越明显。     

交互多模型PHD滤波跟踪多目标方法

在机动多目标跟踪问题中,目标数未知或随时间而变化,概率假设密度（PHD）滤波可以在每一时间步估计多目标状态和目标数,但单模型方法不能给出精确的估计。提出了一种交互多模型PHD滤波方法,建立多模型描述多目标运动方式,利用PHD滤波结合多模型跟踪目标运动轨迹。同时,给出了多传感器交互多模型PHD滤波方法,以提高目标跟踪精度。     

未知测量噪声分布下的多目标跟踪算法

 粒子概率假设密度滤波(SMC-PHDF)在进行粒子更新时需要知道测量噪声的概率分布以计算似然函数,这使得SMC-PHDF依赖于测量噪声的概率模型。针对这一点不足,提出一种未知测量噪声分布下的多目标跟踪算法——基于风险评估的概率假设密度滤波(RE-PHDF)。该算法在SMC-PHDF进行概率假设密度(PHD)粒子更新时采用风险函数计算每个PHD粒子的风险值,并通过一个风险评估函数评估每个PHD粒子,然后用评估后的结果更新粒子的权值。由于粒子更新时避免了在多维测量空间中计算似然函数,算法不仅不依赖于测量噪声的概率分布,还可以节省大量计算时间。仿真结果表明：和SMC-PHDF相比,RE-PHDF在未知的复杂测量噪声环境下具有更高的鲁棒性和稳定性;同时,在两种算法跟踪精度接近的情况下,所提算法节省了50%的运行时间。     

多目标跟踪的核粒子概率假设密度滤波算法

提出一种新的多目标跟踪算法：核粒子概率假设密度滤波算法(KP-PHDF)。算法的创新点在概率假设密度滤波算法(PHDF)的目标状态提取步骤,以粒子概率假设密度滤波算法为框架,并运用结合了mean-shift算法的核密度估计(KDE)理论进行概率假设密度(PHD)分布的二次估计、提取PHD峰值位置作为目标状态估计值。分析与多目标跟踪(MTT)仿真的结果表明,与现有序列蒙特卡罗概率假设密度滤波算法（SMC-PHDF）相比,在相同仿真条件下新算法的估计精度提高30.5%。     

Rao-Blackwellized粒子概率假设密度滤波算法

针对多目标跟踪（MTT）,提出一种新的基于随机集的滤波算法,称为Rao-Blackwellized粒子概率假设密度滤波算法（RBP-PHDF）。算法运用Rao-Blackwellized思想,通过挖掘分析“混合线性/非线性模型”的结构,采用序列蒙特卡罗（SMC）方法预测与估计概率假设密度（PHD）迭代式中各个目标的非线性状态,并利用非线性状态粒子中包含的信息,使用卡尔曼滤波器（KF）对线性状态进行预测与估计。以更好地估计PHD进而提高各目标状态估计精度。分析与MTT仿真的结果表明,在相同的仿真条件下,与现有序列蒙特卡罗概率假设密度滤波算法（SMC-PHDF）相比,RBP-PHDF在降低粒子维数、减少计算量的同时,有效提升了估计精度。     

基于改进的UPF雷达组网数据融合方法

传统粒子滤波方法(PF)中,粒子权值仅参考当前观测值,由于观测随机误差的影响,降低了粒子权值的准确性。本文提出一种新的粒子权值确定方法,利用目标运动方程向后外推目标状态,综合利用外推的目标状态以及历史观测数据,降低了观测随机误差的影响,改进了粒子权值的准确性,从而提高了粒子滤波性能。采用改进的粒子滤波方法处理多雷达测量数据,仿真结果表明,改进的粒子滤波方法可以很好地实现多雷达测量数据的融合处理,提高了目标外弹道定位精度,可以应用在飞行器跟踪测量的数据融合处理中。     

区域杂波估计的多目标跟踪方法

高斯粒子概率假设密度（PHD）滤波往往假定杂波密度参数已知,这种做法对于实际应用是不现实的。此外,杂波的参数值通常依赖于环境条件,可能随时间发生变化。因此,多目标跟踪算法中需要实时准确估计杂波密度的参数。基于此,提出了一种多目标跟踪的区域杂波估计方法。首先根据量测信息在线估计出场景中的杂波数目,然后估计落入目标附近感兴趣区域的杂波数,并估计每个目标感兴趣区域杂波强度。仿真结果表明,在复杂场景下算法的跟踪性能明显优于未进行杂波估计的多目标跟踪算法,提高了跟踪的实时性和跟踪精度。     

基于CPHD的双层粒子滤波目标跟踪算法

常规基于势概率假设密度滤波(Cardinalized Probability Hypothesis Density,CPHD)的粒子滤波(Particle Fil? ter,PF)跟踪算法应用于多目标跟踪时,容易遇到因粒子数量增加而带来的运算效率下降、目标数目估计不准的问题。文章基于常规粒子滤波 CPHD跟踪算法,通过部署双层粒子,提出基于势概率假设密度滤波的双层粒子滤波 (Two-Layer Particle Filter-CPHD,TLPF-CPHD)算法,以便提高目标数目及状态估计精度。仿真实验结果证明,相比于常规 PF-CPHD算法,新算法具有更好的目标数目和状态估计准确性。     

基于量测一致性的分布式多传感器多目标跟踪算法

针对无线传感器网络跟踪多目标过程中传感器能搭载的计算负荷有限,不宜采用复杂算法实现数据处理的问题,提出了一种基于量测一致性的分布式多传感器多目标跟踪算法。算法采用计算相对简易的最近邻域法处理多目标跟踪中的数据互联问题,针对最近邻域法容易受杂波干扰的情况,通过量测的平均一致性迭代来改进算法的性能。仿真结果证明,算法具备有效抑制因误判产生的错误量测对跟踪过程干扰的性能,实现了良好的传感器网络跟踪精度和估计信息一致性。     

Track labeling and PHD filter for multitarget tracking

Multiple target tracking requires data association that operates in conjunction with filtering. When multiple targets are closely spaced, the conventional approaches (as, e.g., MHT/assignment) may not give satisfactory results. This is mainly because of the difficulty in deciding what the number of targets is. Recently, the probability hypothesis density (PHD) filter has been proposed and particle filtering techniques have been developed to implement the PHD filter. In the particle PHD filter, the track labeling problem is not considered, i.e., the PHD is obtained only for a frame at a time, and it is very difficult to perform the multipeak extraction, particularly in high clutter environments. A track labeling method combined with the PHD approach, as well as considering the finite resolution, is proposed here for multitarget tracking, i.e., we keep a separate tracker for each target, use the PHD in the resolution cell to get the estimated number and locations of the targets at each time step, and then perform the track labeling ("peak-to-track" association), whose results can provide information for PHD peak extraction at the next time step. Besides, by keeping a separate tracker for each target, our approach provides more information than the standard particle PHD filter. For example, in group target tracking, if we are interested in the motion of a specific target, we can track this target, which is not possible for the standard particle PHD filter, since the standard particle PHD filter does not keep track labels. Using our approach, multitarget tracking can be performed with automatic track initiation, maintenance, spawning, merging, and termination     

Multiple-Model Probability Hypothesis Density Filter for Tracking Maneuvering Targets

Tracking multiple targets with uncertain target dynamics is a difficult problem, especially with nonlinear state and/or measurement equations. With multiple targets, representing the full posterior distribution over target states is not practical. The problem becomes even more complicated when the number of targets varies, in which case the dimensionality of the state space itself becomes a discrete random variable. The probability hypothesis density (PHD) filter, which propagates only the first-order statistical moment (the PHD) of the full target posterior, has been shown to be a computationally efficient solution to multitarget tracking problems with a varying number of targets. The integral of PHD in any region of the state space gives the expected number of targets in that region. With maneuvering targets, detecting and tracking the changes in the target motion model also become important. The target dynamic model uncertainty can be resolved by assuming multiple models for possible motion modes and then combining the mode-dependent estimates in a manner similar to the one used in the interacting multiple model (IMM) estimator. This paper propose a multiple-model implementation of the PHD filter, which approximates the PHD by a set of weighted random samples propagated over time using sequential Monte Carlo (SMC) methods. The resulting filter can handle nonlinear, non-Gaussian dynamics with uncertain model parameters in multisensor-multitarget tracking scenarios. Simulation results are presented to show the effectiveness of the proposed filter over single-model PHD filters.     

An improved multiple model GM-PHD filter for maneuvering target tracking

In this paper, an improved implementation of multiple model Gaussian mixture probability hypothesis density (MM-GM-PHD) filter is proposed. For maneuvering target tracking, based on joint distribution, the existing MM-GM-PHD filter is relatively complex. To simplify the filter, model conditioned distribution and model probability are used in the improved MM-GM-PHD filter. In the algorithm, every Gaussian components describing existing, birth and spawned targets are estimated by multiple model method. The final results of the Gaussian components are the fusion of multiple model estimations. The algorithm does not need to compute the joint PHD distribution and has a simpler computation procedure. Compared with single model GM-PHD, the algorithm gives more accurate estimation on the number and state of the targets. Compared with the existing MM-GM-PHD algorithm, it saves computation time by more than 30%. Moreover, it also outperforms the interacting multiple model joint probabilistic data association (IMMJPDA) filter in a relatively dense clutter environment.     

Multi-target state estimation and track continuity for the particle PHD filter

Particle filter approaches for approximating the first-order moment of a joint, or probability hypothesis density (PHD), have demonstrated a feasible suboptimal method for tracking a time-varying number of targets in real-time. We consider two techniques for estimating the target states at each iteration, namely k-means clustering and mixture modelling via the expectation-maximization (EM) algorithm. We present novel techniques for associating the targets between frames to enable track continuity.     

A class of near optimal JPDA algorithms

The crucial problem in multiple target tracking is the hit-to-track data association. A hit is a received signal from a target or background clutter which provides positional information If an incorrect hit is associated with a track, that track could diverge and prematurely terminate or cause other tracks to also diverge. Most methods for hit-to-track data association fall into two categories: multiple hypothesis tracking (MHT) and joint probabilistic data association (JPDA). Versions of MHT use all or some reasonable hits to update a track and delay the decision on which hit was correct. JPDA uses a weighted sum of the reasonable hits to update a track. These weights are the probability that the hit originated from the target in track. The computational load for the joint probabilities increases exponentially as the number of targets increases and therefore, is not an attractive algorithm when expecting to track many targets. Reviewed here is the JPDA filter and two simple approximations of the joint probabilities which increase linearly in computational load as the number of targets increase. Then a new class of near optimal JPDA algorithms is introduced which run in polynomial time. The power of the polynomial is an input to the algorithm. This algorithm bridges the gap in computational load and accuracy between the very fast simple approximations and the efficient optimal algorithms     

A measurement-driven adaptive probability hypothesis density filter for multitarget tracking

This paper studies the dynamic estimation problem for multitarget tracking. A novel gating strategy that is based on the measurement likelihood of the target state space is proposed to improve the overall effectiveness of the probability hypothesis density(PHD) filter. Firstly, a measurement-driven mechanism based on this gating technique is designed to classify the measurements. In this mechanism, only the measurements for the existing targets are considered in the update step of the existing targets while the measurements of newborn targets are used for exploring newborn targets. Secondly, the gating strategy enables the development of a heuristic state estimation algorithm when sequential Monte Carlo(SMC) implementation of the PHD filter is investigated, where the measurements are used to drive the particle clustering within the space gate.The resulting PHD filter can achieve a more robust and accurate estimation of the existing targets by reducing the interference from clutter. Moreover, the target birth intensity can be adaptive to detect newborn targets, which is in accordance with the birth measurements. Simulation results demonstrate the computational efficiency and tracking performance of the proposed algorithm.     

PHD filters of higher order in target number

The multitarget recursive Bayes nonlinear filter is the theoretically optimal approach to multisensor-multitarget detection, tracking, and identification. For applications in which this filter is appropriate, it is likely to be tractable for only a small number of targets. In earlier papers we derived closed-form equations for an approximation of this filter based on propagation of a first-order multitarget moment called the probability hypothesis density (PHD). In a recent paper, Erdinc, Willett, and Bar-Shalom argued for the need for a PHD-type filter which remains first-order in the states of individual targets, but which is higher-order in target number. In this paper we show that this is indeed possible. We derive a closed-form cardinalized PHD (CPHD) filter, which propagates not only the PHD but also the entire probability distribution on target number.     

Probability hypothesis density filter with adaptive parameter estimation for tracking multiple maneuvering targets

The probability hypothesis density (PHD) filter has been recognized as a promising tech-nique for tracking an unknown number of targets. The performance of the PHD filter, however, is sensitive to the available knowledge on model parameters such as the measurement noise variance and those associated with the changes in the maneuvering target trajectories. If these parameters are unknown in advance, the tracking performance may degrade greatly. To address this aspect, this paper proposes to incorporate the adaptive parameter estimation (APE) method in the PHD filter so that the model parameters, which may be static and/or time-varying, can be estimated jointly with target states. The resulting APE-PHD algorithm is implemented using the particle filter (PF), which leads to the PF-APE-PHD filter. Simulations show that the newly proposed algorithm can correctly identify the unknown measurement noise variances, and it is capable of tracking mul-tiple maneuvering targets with abrupt changing parameters in a more robust manner, compared to the multi-model approaches.     

Novel data association schemes for the probability hypothesis density filter

The probability hypothesis density (PHD) filter is a practical alternative to the optimal Bayesian multi-target Alter based on finite set statistics. It propagates the PHD function, a first-order moment of the full multi-target posterior density. The peaks of the PHD function give estimates of target states. However, the PHD filter keeps no record of target identities and hence does not produce track-valued estimates of individual targets. We propose two different schemes according to which PHD filter can provide track-valued estimates of individual targets. Both schemes use the probabilistic data-association functionality albeit in different ways. In the first scheme, the outputs of the PHD filter are partitioned into tracks by performing track-to-estimate association. The second scheme uses the PHD filter as a clutter filter to eliminate some of the clutter from the measurement set before it is subjected to existing data association techniques. In both schemes, the PHD filter effectively reduces the size of the data that would be subject to data association. We consider the use of multiple hypothesis tracking (MHT) for the purpose of data association. The performance of the proposed schemes are discussed and compared with that of MHT.