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

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

修正的概率数据互联算法

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

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

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

基于数据关联的故障快速检测

 多数情况下,快速实时地进行故障检测是很重要的。将故障看做是通过多传感器观测的动态模型,进行多传感器多模型概率数据关联,以各个模型的关联结果和设定的阈值为依据,可以有效地实现故障检测。联合概率数据关联（JPDA）算法是解决多传感器多目标跟踪的一个有效方法,文中通过分析概率数据关联算法,对联合概率数据关联算法进行了改进：（1）通过正确地选择阈值,移除小概率事件,进而建立一个近似的确认矩阵;（2）根据被跟踪目标故障跟踪门的相交情况,将跟踪空间进行数学划分,形成若干相互独立的区域;（3）对同一区域内公共有效量测的概率密度值进行衰减,计算出关联概率。仿真对比表明,本文的改进算法能显著减少计算时间,有效提高故障检测的快速性和实时性。     

联合交互式多模型概率数据关联算法

通过对交互式多模型（IMM）算法和概率数据关联（PDA）算法的研究,指出Bar-Shalom和Blom等提出的IMMPDA算法结构和理论上存在的问题。根据全局最优的思想,设计了一个最优波门,从而得到全局最优的量测集合,保证了系统的理论完整性和结构合理性。推导完成了新的联合IMMPDA算法--C-IMMP-DA算法。大量仿真计算验证了C-IMMPDA算法在减少计算量的同时,总体性能上较之原IMMPDA算法有大幅度提高。     

基于最近邻的集中式多传感器多目标跟踪算法

经典的集中式多传感器多目标跟踪算法通常计算量较大,经常难以满足系统的实时性要求,工程上实现起来比较困难,为进一步扩大集中式多传感器的应用范围,使其在对算法实时性要求较高、跟踪精度要求较小的实际场合中广泛应用。文章基于最近邻域思想,研究了并行处理结构的集中式多传感器最近邻域算法,并从算法跟踪精度、实时性、有效跟踪率3个方面对其与经典的顺序多传感器联合概率数据互联算法进行了仿真比较。经仿真验证,并行处理结构的集中式多传感器最近邻域算法实时性提高了60%以上,且在跟踪背景杂波适中的情况下能够有效跟踪目标。     

基于期望系统噪声模型的自适应机动目标跟踪

针对防空作战中的机动目标跟踪问题,分析了使用IMM算法跟踪目标所存在的缺陷,提出了一种基于期望系统噪声模型的自适应机动目标跟踪算法（MIMM）,改变IMM算法使用固定模型集合的方法,IMM算法中作用权重较大的只是少部分更接近于实际系统的模型,通过对部分系统噪声模型进行自适应辨识,计算出最接近于系统实际噪声水平的模型——期望系统噪声模型（ESNM）。这些模型作为IMM多模型集的子集,是在一定模型框架内所寻求出的一个（或多个）最优模型（集）。仿真结果证明了MIMM算法能够更好地描述目标机动,达到更理想的跟踪性能,其跟踪精度优于使用固定模型集的IMM算法。     

利用幅值信息的超视距雷达多路径概率数据互联算法

天波超视距雷达是通过电离层反射实现超视距广域监视的,其地理坐标系下的量测方程存在强非线性,同时由于电离层的不同分层,造成了多路径传播的严重问题,即同时存在多个量测模型。多路径概率数据互联(MPDA)滤波器将坐标配准与概率数据互联相结合,解决了超视距目标跟踪中的多路径传播问题,但在杂波环境下滤波跟踪精度不高。文中提出了一种基于信号幅值特征信息的MPDA算法(A-MPDA),当跟踪单一的、存在4种可能非线性量测的非机动目标时,仿真结果表明所提出的算法比标准MPDA有更好的跟踪精度。     

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

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

基于MCMC-Gibbs采样的天波超视距雷达联合状态估计与模式辨识

天波超视距雷达(OTHR)目标跟踪面临着"三低"(低检测概率、低数据率、低测量精度)和"多路径"(多条传播路径)的严峻挑战,准确的传播模式辨识与精确的目标状态估计是改善跟踪能力的关键。针对上述问题,提出了一种基于马尔科夫蒙特卡洛吉布斯(MCMC-Gibbs)采样的OTHR联合状态估计与模式辨识算法,该算法通过MCMC-Gibbs采样求取当次迭代当前拍最优的关联矩阵,进而利用同时多量测滤波进行状态和协方差更新,最后引入联合估计与辨识风险函数寻求最优的模式辨识与状态估计结果。不同仿真参数下仿真结果表明该算法的有效性,同时该算法在径向距和方位角估计精度上均高于多路径概率数据关联算法(MPDA),但这是以计算量为代价的。     

Neural solution to the multitarget tracking data associationproblem

The problem of tracking multiple targets in the presence of clutter is addressed. The joint probabilistic data association (JPDA) algorithm has been previously reported to be suitable for this problem in that it makes few assumptions and can handle many targets as long as the clutter density is not very high. However, the complexity of this algorithm increases rapidly with the number of targets and returns. An approximation of the JPDA that uses an analog computational network to solve the data association problem is suggested. The problem is viewed as that of optimizing a suitably chosen energy function. Simple neural-network structures for the approximate minimization of such functions have been proposed by other researchers. The analog network used offers a significant degree of parallelism and thus can compute the association probabilities more rapidly. Computer simulations indicate the ability of the algorithm to track many targets simultaneously in the presence of moderately dense clutter     

STOCHASTIC NEURAL NETWORK AND ITS APPLICATION TO MULTI－MANEUVERING TARGET TRACKING

ＳＴＯＣＨＡＳＴＩＣＮＥＵＲＡＬＮＥＴＷＯＲＫＡＮＤＩＴＳＡＰＰＬＩＣＡＴＩＯＮＴＯＭＵＬＴＩ－ＭＡＮＥＵＶＥＲＩＮＧＴＡＲＧＥＴＴＲＡＣＫＩＮＧＪｉｎｇＺｈｏｎｇｌｉａｎｇ；ＤａｉＧｕａｎｚｈｏｎｇ；ＴｏｎｇＭｉｎｇａｎ；ＺｈｏｕＨｏｎｇｒｅｎ（Ｄ...     

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     

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     

随机神经网络在机动多目标跟踪中的应用

研究密集多回波环境下的机动多目标跟踪问题。通过对多目标联合概率数据关联方法性能特征的分析,将其归结为一类约束组合优化问题。在此基础上,利用随机神经网络求解组合优化问题的策略,采用改进的增益退火算法,提出了一种新颖的机动多目标快速自适应神经网络跟踪方法。仿真结果表明,该方法不仅具有很高的收敛速度和跟踪精度,而且计算量小,关联效果好。     

组合式快速JPDA算法

基于有序状态空间搜索方法,定义联合事件为问题节点,将多目标数据关联问题求解转化为状态空间问题求解。定义联合数据关联概率函数对数表达为节点的估价函数,减少扩展节点数,迅速产生和搜索Ｎ个最大联合概率事件。给出快速计算Ｎ个最大联合概率事件的ＪＰＤＡ公式,并提出一种确定新生节点是否是已生成节点的简便方法。算法的搜索次数不随回波数增加而增加,有效地解决了传统ＪＰＤＡ算法的实时性问题,兼有贝叶斯方法和非贝叶斯方法的各自优点。     

Suboptimal joint probabilistic data association

A significant 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 terminate. Prior methods for this data association problem include various optimal and suboptimal two-dimensional assignment algorithms which make hit-to-track associations. Another method is to assign a weight for the reasonable hits and use a weighted centroid of those hits to update the track. The method of weighting the hits is known as joint probabilistic data association (JPDA). The authors review the JPDA approach and a simple ad hoc approximation and then introduce a new suboptimal JPDA algorithm. Examples which compare an optimal two-dimensional assignment algorithm with the ad hoc and the new suboptimal JPDA formulation are given     

Multiple scan joint probabilistic data association

This paper presents a multiple scan or n-scan-back joint probabilistic data association (JPDA) algorithm which addresses the problem of measurement-to-track data association in a multiple target and clutter environment. The standard single scan JPDA algorithm updates a track with weighted sum of the measurements which could have reasonably originated from the target in track. The only information the standard JPDA algorithm uses is the measurements on the present scan and the state vectors and covariance matrices of the present targets. The n-scan-back algorithm presented here uses multiple scans of measurements along with the present target information to produce better weights for data association. The standard JPDA algorithm can utilize a formidable amount of processing power and the n-scan-back version only worsens the problem. Therefore, along with the algorithm presentation, implementations which make this algorithm practical are discussed and referenced. An example is also shown for a few n-scan-back window lengths