一种密集多回波环境下的机动多目标跟踪起始算法

 本文研究密集多回波环境下的机动多目标跟踪起始问题。文中首先提出主跟踪子空间和边缘跟踪子空间的定义与性质,接着修正Bayes轨迹确定方法BTC,并将其与具有残差滤波的修正概率数据关联滤波算法MPDAF-RF有机地结合起来,提出一种适合高密集多回波环境的机动多目环跟踪起始方法——“全邻”Bayes跟踪起始算法ABTI。Monte Carlo仿真表明,本文所给出的算法不仅克服了一类概率数据关联滤波方法没有跟踪起始机理的缺陷,而且辨别目标与虚警的能力很强,不失为解决高密集多回波环境下机动多目标跟踪起始的有效方法。     

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

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

多目标跟踪技术综述

本文讨论过去二十年来多目标跟踪问题所取得的进展。主要的注意力集中在数据相关这一重要而困难的方面。首先介绍了在密集多回波环境中跟踪单个目标的各种方法。其次讨论了在密集多回波环境中多目标的跟踪方法。随后简要地介绍了与此问题有关的一些进展并扼要地进行了小结。     

MPDAF方法和DF方法在抗距离拖引干扰中的应用

利用Monte Carlo方法,对修正的概率数据互联滤波(MPDAF)和分解融合方法(DF)在有虚警测量的环境下抗距离拖引干扰的性能进行了分析和比较.研究表明,在虚警测量较少的情况下,采用MPDAF算法和DF算法可以有效地抗距离后拖欺骗干扰,实现对目标的跟踪,但是在虚警测量较多的情况下,采用DF方法可以较好地对抗距离后拖欺骗干扰,实现对目标的跟踪,而MPDAF方法则基本失去作用.     

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

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

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

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

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

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

机动多目标跟踪问题中关联区域的研究

 本文研究了跟踪多个机动目标时,由滤波算法所获得的新息向量范数的统计性质,关联区域的大小以及接收正确回波的概率。借助拉蒙特卡洛方法,考察了不同的目标状态模型、目标机动加速度及状态噪声方差等因素对所研究的问题的影响。研究表明,文献[1]所提出的机动目标状态模型及相应的自适应算法具有较好的适应目标机动的能力,关联区域的大小及接收正确回波的概率均较为稳定。     

时空关联多跟踪剔除的多源数据融合方法

随着网络信息共享技术的深入发展,多源异构数据将是未来数据融合的主要信息源,这种数据融合表现出跨平台、跨军种、跨领域等特征,对多源异构数据关联与融合提出了新要求。针对特定场景敏感区域内有限多目标的探测问题,结合一体化作战数据融合的数据滤波、空时配准、航迹关联与建立、多目标跟踪等方面,提出了时空关联多跟踪剔除的数据融合方法,并从数据滤波、航迹关联与融合、时空关联多跟踪剔除以及融合数据“簇”等方面重点研究了所提出的数据融合方法。距离波门拖引干扰和牵引干扰的对抗仿真试验表明,所提方法具有一定应用价值。     

基于辅助粒子滤波的机动目标跟踪研究

针对机动目标跟踪巾扩展卡尔曼算法（EKF）收敛速度慢、跟踪精度低的问题,基于粒子滤波（PF）和辅助粒子滤波（APF）的基本思想,结合目标先验信息将速度约束条件加入到跟踪过程巾,对辅助粒子滤波算法进行了仿真分析,与扩展卡尔曼进行仿真对比,分析了跟踪性能和误差。仿真结果表明,对机动目标跟踪问题,辅助粒子滤波不仅解决了扩展卡尔曼线性化困难难题,与EKF相比还具有收敛速度快,跟踪精度高的优点。     

A Gaussian Mixture PHD Filter for Jump Markov System Models

The probability hypothesis density (PHD) filter is an attractive approach to tracking an unknown and time-varying number of targets in the presence of data association uncertainty, clutter, noise, and detection uncertainty. The PHD filter admits a closed-form solution for a linear Gaussian multi-target model. However, this model is not general enough to accommodate maneuvering targets that switch between several models. In this paper, we generalize the notion of linear jump Markov systems to the multiple target case to accommodate births, deaths, and switching dynamics. We then derive a closed-form solution to the PHD recursion for the proposed linear Gaussian jump Markov multi-target model. Based on this an efficient method for tracking multiple maneuvering targets that switch between a set of linear Gaussian models is developed. An analytic implementation of the PHD filter using statistical linear regression technique is also proposed for targets that switch between a set of nonlinear models. We demonstrate through simulations that the proposed PHD filters are effective in tracking multiple maneuvering targets.     

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.     

Extended solution to multiple maneuvering target tracking

An improved algorithm for tracking multiple maneuvering targets is presented. This approach is implemented with an approximate adaptive filter consisting of the one-step conditional maximum-likelihood technique together with the extended Kalman filter and an adaptive maneuvering compensator. In order to avoid the extra computational burden of considering events with negligible probability, a validation matrix is defined in the tracking structure. With this approach, data-association and target maneuvering problems can be solved simultaneously. Detailed Monte Carlo simulations of the algorithm for many tracking situations are described. Computer simulation results indicate that this approach successfully tracks multiple maneuvering targets over a wide range of conditions     

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     

Track monitoring when tracking with multiple 2D passive sensors

A fast method of track monitoring is presented which determines what tracks are good and what tracks have had data association problems and should be eliminated. The philosophy of tracking in a dense target environment with limited central processing unit (CPU) time is to acquire the targets, track them with as simple a filter as will meet requirements, and monitor the tracks to determine if they are still tracking a target or are tracking incorrect returns and should be terminated. After termination the true targets are reacquired. However, it is difficult to determine from simple track monitoring the correct interpretation of a poor track. Poor tracks can be a result of a sensor failure, target maneuver, or incorrect data association. The author describes track monitoring and provides a solution to this dilemma when tracking with multiple two-dimensional passive sensors. The method is much faster than other monitoring methods.<>     

An Algorithm for Tracking a Maneuvering Target in Clutter

We consider the problem of tracking a maneuvering target in clutter. In such an environment, missed detections and false alarms make it impossible to decide, with certainty, the origin of received echoes. Processing radar returns in cluttered environments consists of three functions: 1) target detection and plot formation, 2) plot-to-track association, and 3) track updating. Two inadequacies of the present approaches are 1) Optimization of detection characteristics have not been considered and 2) features that can be used in the plot-to-track correlation process are restricted to a specific class. This paper presents a new approach to overcome these limitations. This approach facilitates tracking of a maneuvering target in clutter and improves tracking performance for weak targets.     

Precision large scale air traffic surveillance using IMM/assignmentestimators

We present the development and implementation of a multisensor-multitarget tracking algorithm for large scale air traffic surveillance based on interacting multiple model (IMM) state estimation combined with a 2-dimensional assignment for data association. The algorithm can be used to track a large number of targets from measurements obtained with a large number of radars. The use of the algorithm is illustrated on measurements obtained from 5 FAA radars, which are asynchronous, heterogeneous, and geographically distributed over a large area. Both secondary radar data (beacon returns from cooperative targets) as well as primary radar data (skin returns from noncooperative targets) are used. The target IDs from the beacon returns are not used in the data association. The surveillance region includes about 800 targets that exhibit different types of motion. The performance of an IMM estimator with linear motion models is compared with that of the Kalman filter (KF). A number of performance measures that can be used on real data without knowledge of the ground truth are presented for this purpose. It is shown that the IMM estimator performs better than the KF. The advantage of fusing multisensor data is quantified. It is also shown that the computational requirements in the multisensor case are lower than in single sensor case, Finally, an IMM estimator with a nonlinear motion model (coordinated turn) is shown to further improve the performance during the maneuvering periods over the IMM with linear models     

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