基于概率最近邻域算法的分布式多传感器多目标跟踪算法

为进一步扩大分布式多传感器的应用范围,基于概率最近邻域思想,研究了分布式多传感器概率最近邻域算法,并对其与分布式多传感器联合概率数据互联算法进行了性能仿真分析。经仿真验证,分布式多传感器概率最近邻域算法能够解决多传感器多目标跟踪问题,且实时性有较大提高。     

基于模板匹配的集中式多传感器群内目标精细跟踪算法

为解决多传感器探测下群内目标精细跟踪的难题,基于非机动情况下各探测周期内群内目标真实回波位置相对固定的特性,提出了一种基于模板匹配的集中式多传感器群内目标精细跟踪算法。该算法通过预关联成功的群状态集合与群量测集合分别建立模板形状矩阵和待匹配形状矩阵,利用匹配搜索模型和匹配矩阵确认规则选出代价最小的匹配矩阵,并基于模板和对应的匹配矩阵利用 kalman滤波完成群内各目标航迹的状态更新。仿真表明,与传统多传感器多目标跟踪算法中性能优越的基于数据压缩的集中式多传感器多假设算法相比,该算法在跟踪精度、实时性、有效跟踪率方面的性能明显优越,能很好的满足群内目标精细跟踪的实际工程需求。     

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

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

多传感器数据融合的平均航迹算法

提出了一种适用于分布式多传感器的平均融合算法，对其算法机理进行了详细描述。对融合算法、未融合算法和算术平均算法三者的跟踪航迹和方差进行了仿真比较。仿真结果表明，融合算法优于算术平均算法和未融合算法。它提高了跟踪精度，改善了航迹质量。尤其在多传感器跟踪系统工作异常的情况下具有独特的优良位能。     

基于混合滤波的无线传感器网络融合跟踪方法

 针对无线传感器网络(WSN)中的多传感器融合目标跟踪,提出一种混合滤波算法,称为无迹混合集中式粒子滤波(UM CPF)。该算法使用了一个混合的粒子传播方案。在使用集中式粒子滤波(CPF)对WSN中的节点测量信息进行融合时,粒子滤波器中的一部分粒子使用从无迹变换(UT)获得的高斯分布作为建议分布进行粒子传播,而剩余的另一部分粒子则简单地使用状态转移先验分布进行粒子传播。WSN中的融合跟踪仿真结果表明,和纯粒子滤波算法CPF相比,在仿真速率相当的情况下,混合滤波算法明显提高了跟踪精度和稳定性。     

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

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

基于目标战略优先级与精度自适应的效能函数的机载多传感器管理

传感器管理在数据融合系统中起着重要作用,机载多传感器系统通常面临着资源受限的状况,如传感器最大跟踪数量小于目标数量,无法保证所有传感器拥有相同精度与参照系等。因此,本文提出了一种基于目标战略优先级与精度自适应的效能函数的多传感器管理算法。首先,将空中目标的自身属性部分量化以得到目标战略优先级;再利用目标的跟踪精度、传感器测量精度和期望的跟踪精度之间的关系,定义了精度预提升矩阵和精度缺乏矩阵。再将上述两部分结合构建目标函数,运用整数线性规划的方法进行优化。最后,仿真试验设置了包括三个机载传感器对4个目标的跟踪任务,对比其他文献中的结果,显示出本文算法更为合理、有效。     

基于多模型的低轨星座多目标跟踪传感器资源调度

针对低轨星座多目标持续跟踪传感器资源调度问题,首先将目标跟踪任务划分为高精度任务集合和低精度任务集合,并分析了跟踪任务状态转移过程;然后,为两任务集合分别建立了基于动态优先级的优化调度模型,提出了一种基于多模型的实时传感器调度算法。不同场景下仿真实验表明,所提算法较之以跟踪精度为优化目标和以跟踪精度为门限约束的方法具有更强的适用性,尤其对于目标分布较为集中的情况,其目标丢失率大大降低,尽管个别目标的跟踪误差略有增大。     

红外成像导引系统跟踪算法研究

实时目标跟踪是当前红外成像导引头图像处理中的关键技术,但是在目标跟踪的末端,匹配点漂移和滑动将直接影响目标跟踪精度,甚至使导弹丢失目标。本文深入分析了跟踪点滑动的原因,提出了基于特征点邻域的边缘模板匹配目标跟踪算法。该算法从红外图像中获取特征点,以特征点为中心选取参考模板,然后利用边缘检测算法获得边缘点集,最后使用改进的Hausdorff距离测度进行边缘点集的匹配,从而实现实时目标跟踪。仿真实验测试证明,该方法能够很好地解决跟踪点滑动和漂移问题,并满足实时性要求,跟踪稳定。     

非线性系统中多传感器目标跟踪融合算法研究

主要阐述了在非线性系统中多传感器目标跟踪的融合算法，提出了基于变换测量卡尔曼滤波器（CMKF）的分布式融合算法，从该理论出发，导出了分布式变换测量卡尔曼滤波算法（DCMKFA）几乎能够重视集中式融合估计，仿真结果证明了这一结论，因此，DCMKFA对于非线性系统中的目标跟踪是一个有效的分布式融合算法。     

Evaluation of multiple radar target trackers in stressfulenvironments

This paper evaluates the performance of multiple target tracking (MTT) algorithms in real-life stressful radar tracking environments. Real closely spaced maneuver radar data, generated by six F-18 fighters and other targets, were collected jointly by the defence departments of Canada and United States to support this practical MTT algorithm evaluation study. A set of performance metrics was defined here to compare the suboptimal nearest neighbor (SNN), global nearest neighbor (GNN), and various variants of the joint probabilistic data association (JPDA) MTT trackers. Results reveal an interesting result that all these MTT algorithms exhibited very close performance. In addition, the weighted sum approach of the PDA/JPDA trackers which are theoretically effective were observed to perform poorly in tracking closely spaced targets. Overall speaking, the GNN filter based on the Munkres algorithm had the best performance in terms of both tracking performance and robustness     

SEQUENTIAL ALGORITHM FOR MULTISENSOR PROBABILISTIC DATA ASSOCIATION

Jointprobabillsticdataassociation(JPDA)isanalgorithmusedinsinglesensormultipletargettrackingsystems.Itemploysthenon-uniqueassignmentof"allneighbor"strategytoadaptforthedensemultitargettrackingenvironments[1].Becauseofitswideapplications,itisnecessarytoextendJPDAintosomemultiplesensortrackingsystems.Suchamultisensorsystem,forexample,canbeformedbycollocatingradarandinfraredsearchandtrack(IRST)whichcantakeadvantagesofboththesensorsbodatafusion.Undertheconditionofthesamesensors,acommonmeasure…     

修正的概率数据互联算法

阐明了概率数据互联(PDA)算法能很好地解决密集环境下的目标跟踪问题,在该算法基础上,人们又提出了联合概率数据互联(JPDA)算法和一些基于 PDA 的修正算法。在概率数据互联算法中,有一个很重要的参数就是杂波数密度(或波门内虚假量测期望数)。然而在许多实际情况中,这个参数是很难获取的。针对这一问题,文中提出了一种修正的概率数据互联算法,该算法通过实时地调整这一参数来获得对目标较为准确的估计结果。最后,给出了算法的仿真分析。     

一种基于最小二乘拟合的数据关联算法

针对点航关联在多目标跟踪中精度与实时性难兼顾的问题,提出了一种基于最小二乘拟合的点航关联算法。首先采用滑窗将历史航迹截断,采用最小二乘法在不同维度分别拟合、外推融合航迹历史信息条件下的航迹点,增加外推点的多样性及信息量。同时定义了5种全概率关联事件,提取传统滤波方法的预测点,将拟合外推点与滤波预测点融合,使归属判决更加准确。最后分别推导了不同事件发生时的状态更新方程与误差协方差更新方程,给出了其中参数的确定方法。经仿真数据验证,与经典的最近邻域法和联合概率数据互联算法相比,所提算法能够更好地兼顾精度与实时性,且计算复杂度较低,易于工程实现。     

Loopy belief propagation based data association for extended target tracking

The data association problem of multiple extended target tracking is very challenging because each target may generate multiple measurements. Recently, the belief propagation based multiple target tracking algorithms with high efficiency have been a research focus. Different from the belief propagation based Extended Target tracking based on Belief Propagation (ET-BP) algorithm proposed in our previous work, a new graphical model formulation of data association for multiple extended target tracking is proposed in this paper. The proposed formulation can be solved by the Loopy Belief Propagation (LBP) algorithm. Furthermore, the simplified measurement set in the ET-BP algorithm is modified to improve tracking accuracy. Finally, experiment results show that the proposed algorithm has better performance than the ET-BP and joint probabilistic data association based on the simplified measurement set algorithms in terms of accuracy and efficiency. Additionally, the convergence of the proposed algorithm is verified in the simulations.     

Tracking of multiple maneuvering targets using multiscan JPDA and IMM filtering

The paper considers the problem of tracking multiple maneuvering targets in the presence of clutter using switching multiple target motion models. A novel suboptimal filtering algorithm is developed by applying the basic interacting multiple model (IMM) approach and the joint probabilistic data association (JPDA) technique. Unlike the standard single-scan JPDA approach, the authors exploit a multiscan joint probabilistic data association (mscan-JPDA) approach to solve the data association problem. The algorithm is illustrated via a simulation example involving tracking of four maneuvering targets and a multiscan data window of length two     

空间多分辨率模糊目标跟踪

提出了一种新的模糊目标跟踪算法--CPDA算法。这个算法在空间多分辨率框架下应用概率数据互联算法,在粗分辨率上实现模糊目标跟踪。在不同虚警密度的模糊目标环境下,利用仿真实验分析了CPDA算法的跟踪性能,同时将其与单分辨率上的联合概率数据互联方法进行了性能比较。仿真结果表明,CPDA算法的跟踪性能在达到与单分辨率上JPDA算法同样性能的条件下,能够以较小的计算量跟踪模糊目标。     

Efficient multisensor fusion using multidimensional dataassociation

We present the development of a multisensor fusion algorithm using multidimensional data association for multitarget tracking. The work is motivated by a large scale surveillance problem, where observations from multiple asynchronous sensors with time-varying sampling intervals (electronically scanned array (ESA) radars) are used for centralized fusion. The combination of multisensor fusion with multidimensional assignment is done so as to maximize the “time-depth” in addition to “sensor-width” for the number S of lists handled by the assignment algorithm. The standard procedure, which associates measurements from the most recently arrived S-1 frames to established tracks, can have, in the case of S sensors, a time-depth of zero. A new technique, which guarantees maximum effectiveness for an S-dimensional data association (S⩾3), i.e., maximum time-depth (S-1) for each sensor without sacrificing the fusion across sensors, is presented. Using a sliding window technique (of length S), the estimates are updated after each frame of measurements. The algorithm provides a systematic approach to automatic track formation, maintenance, and termination for multitarget tracking using multisensor fusion with multidimensional assignment for data association. Estimation results are presented for simulated data for a large scale air-to-ground target tracking problem