幅度及多普勒信息辅助的多目标跟踪算法

针对现有的多目标跟踪（MTT）算法在强杂波环境下会出现严重的性能衰退,利用目标的幅度及多普勒特征,基于随机有限集（RFS）理论,提出了一种幅度及多普勒信息辅助的δ广义标签多伯努利（ADI-δ-GLMB）滤波器。首先,利用幅度及多普勒信息对目标状态进行扩展,在此基础上建立了新的量测似然函数。然后,基于δ-GLMB滤波器框架推导了新的更新方程。最后,进行仿真验证,结果表明：强杂波下,ADI-δ-GLMB滤波器跟踪性能明显优于δ-GLMB滤波器,估计精度及稳定性更高,且计算量更低;同信息辅助的概率假设密度（PHD）、多目标多伯努利（MeMBer）滤波器相比,ADI-δ-GLMB滤波器状态估计精度更高。     

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

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

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

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

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

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

高斯混合概率假设密度算法对多目标的跟踪研究

为了规避数据关联的困难,本文深入研究了适宜多目标跟踪工程应用,线性高斯多目标模型假设下的高斯混合概率假设密度算法（GM—PHD）,详细给出了后验PHD高斯元素的均值、方差和权值的解析递推式,使用了修剪和合并方法控制高斯元素数目的指数增长。最后。给出了一系列仿真实验,验证了在检测不确定和高杂波环境下,即使对目标数量未知和...     

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

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

面向目标的概率多假设跟踪算法

 概率多假设跟踪(PMHT)算法由于其计算量与目标和量测的个数成线性关系而成为一种重要的数据关联方法,但该算法采用的是一种面向量测的参数模型,容易受到杂波的干扰。针对这个问题,提出一种面向目标的PMHT（TO/PMHT）算法,将量测与目标的距离作为权重,使计算出的后验关联概率能够真实地反映量测和目标的关联可能性。通过多种典型环境的仿真计算表明：TO/PMHT算法和面向量测的PMHT算法相比,跟踪性能有了明显的提高;与多假设跟踪(MHT)算法相比,在保持跟踪性能的同时,极大地提高了计算效率。     

基于高斯混合概率假设密度滤波的扫描型光学传感器像平面多目标跟踪算法

高斯混合概率假设密度(GM-PHD)滤波是一种基于随机有限集理论的次优贝叶斯多目标跟踪方法,本文研究了该算法在扫描型光学传感器像平面的多目标跟踪问题.针对典型的锥扫模式和推扫模式,根据其扫描特性建立目标的运动模型和测量模型.介绍高斯混合概率假设密度滤波的基本原理.针对原算法在强杂波环境中的低效率问题,借鉴传统多目标跟踪...     

一种混合的多机动目标跟踪算法研究

提出了一种混合的多机动目标跟踪算法:交互多模型模糊联合概率数据关联算法(IMM-FJPDA),该算法将交互多模型算法(IMM)和模糊联合概率数据关联算法(FJPDA)相结合,它克服了IMM-JPDA算法计算量大和IMM-FDA算法在强杂波环境中跟踪精度差的问题.给出了基于模糊C均值(FCM)算法的多机动目标跟踪步骤.仿真结果表明IMM-FJPDA算法跟踪精度与IMM-JPDA算法相当,但计算量明显减小,提高了跟踪实时性.     

基于视觉注意机制的认知雷达数据关联算法

针对传统关联波门设计方法在应用于机动目标跟踪时容易引起失跟、以及概率数据关联算法不适于多交叉目标跟踪的问题,提出了一种基于人类视觉选择性注意机制和知觉客体的"特征整合"理论的认知雷达数据关联算法。算法以综合交互式多模型概率数据关联算法为基础,采取假设目标最大机动水平已知的"当前"统计模型和匀速运动模型作为模型集,通过实时交互使关联波门能够随目标机动动态调整,较好地兼顾了雷达计算耗时和跟踪成功率。在利用目标位置特征的基础上,进一步提取、整合目标运动特征,对关联波门交叉区域公共量测进行分类,使多交叉目标跟踪问题转化为多个单目标跟踪问题,优化了传统概率数据关联算法。仿真结果表明：与传统关联波门设计方法相比,算法跟踪失败率和计算耗时明显降低;而且在计算资源增加不大的情况下,杂波环境适应性也得到了显著增强。     

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.     

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.     

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.     

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     

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

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

A Poisson multi-Bernoulli mixture filter with spawning based on Kullback–Leibler divergence minimization

In the classical form, the Poisson Multi-Bernoulli Mixture (PMBM) filter uses a PMBM density to describe target birth, surviving, and death, which does not model the appearance of spawned targets. Although such a model can handle target birth, surviving, and death well, its performance may degrade when target spawning arises. The reason for this is that the original PMBM filter treats the spawned targets as birth targets, ignoring the surviving targets’ information. In this paper, we propose a Kullback–Leibler Divergence (KLD) minimization based derivation for the PMBM prediction step, including target spawning, in which the spawned targets are modeled using a Poisson Point Process (PPP). Furthermore, to improve the computational efficiency, three approximations are used to implement the proposed algorithm, such as the Variational Multi-Bernoulli (VMB) filter, the Measurement-Oriented marginal MeMBer/Poisson (MOMB/P) filter, and the Track-Oriented marginal MeMBer/Poisson (TOMB/P) filter. Finally, simulation results demonstrate the validity of the proposed filter by using the spawning model in these three approximations.     

Particle flters for probability hypothesis density flter with the presence of unknown measurement noise covariance

In Bayesian multi-target fltering,knowledge of measurement noise variance is very important.Signifcant mismatches in noise parameters will result in biased estimates.In this paper,a new particle flter for a probability hypothesis density（PHD）flter handling unknown measurement noise variances is proposed.The approach is based on marginalizing the unknown parameters out of the posterior distribution by using variational Bayesian（VB）methods.Moreover,the sequential Monte Carlo method is used to approximate the posterior intensity considering non-linear and non-Gaussian conditions.Unlike other particle flters for this challenging class of PHD flters,the proposed method can adaptively learn the unknown and time-varying noise variances while fltering.Simulation results show that the proposed method improves estimation accuracy in terms of both the number of targets and their states.