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     

Tracking in clutter with nearest neighbor filters: analysis andperformance

The measurement that is “closest” to the predicted target measurement is known as the “nearest neighbor” (NN) measurement in tracking. A common method currently in wide use for tracking in clutter is the so-called NN filter, which uses only the NN measurement as if it were the true one. The purpose of this work is two fold. First, the following theoretical results are derived: the a priori probabilities of all three data association events (updates with correct measurement, with incorrect measurement, and no update), the probability density functions (pdfs) of the NN measurement conditioned on the association events, and the one-step-ahead prediction of the matrix mean square error (MSE) conditioned on the association events. Secondly, a technique for prediction without recourse to expensive Monte Carlo simulations of the performance of tracking in clutter with the NN filter is presented. It can quantify the dynamic process of tracking divergence as well as the steady-state performance. The technique is a new development along the line of the recently developed general approach to the performance prediction of algorithm with both continuous and discrete uncertainties     

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

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

Waveform selective probabilistic data association

An adaptive, waveform selective probabilistic data association (WSPDA) algorithm for tracking a single target in clutter is presented. The assumption of an optimal receiver allows the inclusion of transmitted waveform specification parameters in the tracking subsystem equations, leading to a waveform selection scheme where the next transmitted waveform parameters are selected so as to minimize the average total mean-square tracking error at the next time step. Semiclosed form solutions are given to the local (one-step-ahead) adaptive waveform selection problem for the case of one-dimensional target motion. A simple simulation example is given to compare the performance of a tracking system using a WSFDA based tracking filter with that of a conventional system with a fixed waveform shape and probabilistic data association (PDA) tracking filter.     

Mixture Reduction Algorithms for Point and Extended Object Tracking in Clutter

The Bayesian solution to the problem of tracking a target with measurement association uncertainty gives rise to mixture distributions, which are composed of an ever increasing number of components. To produce a practical tracking filter, the growth of components must be controlled by approximating the mixture distribution. Two mixture reduction schemes (a joining algorithm and a clustering algorithm) have been derived for this purpose. If significant well spaced mixture components are present, these techniques can provide a useful improvement over the probabilistic data association filter (PDAF) approach, which reduces the mixture to a single Gaussian component at each time step. For the standard problem of tracking a point target in uniform random clutter, a Monte Carlo simulation study has been employed to identify the region of the problem parameter space where significant performance improvement is obtained over the PDAF. In the second part of this paper, the formal Bayesian filter is derived for an extended target consisting of an array of measurement sources with association uncertainty. A practical multiple hypothesis filter is implemented using mixture reduction and simulation results are presented.     

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     

用于非线性跟踪问题的一种新的粒子滤波器

机动目标跟踪系统通常是非线性而且不完全观测的 ,所以问题的关键在于每一时刻的目标机动性都是高度不确定的。提出了一种新的平滑粒子滤波算法 ,该算法在粒子滤波器中加入了对系统模型的概率分布密度的平滑处理 ,从而很好的解决了目标的机动性估计问题。在仿真研究中 ,与辅助粒子滤波器的比较验证了本文算法处理非线性跟踪问题的优越性     

Fusion of sensors with dissimilar measurement/tracking accuracies

The case of data fusion of sensors dissimilar in their measurement/tracking errors is considered. It is shown that the fused track performance is similar whether the sensor data are fused at the track level or at the measurement level. The case of a cluster of targets, resolved by one sensor but not the other, is also considered. Under certain conditions the fused track may perform worse than the worst of the sensors. A remedy to this problem through modifications of the association algorithm is presented     

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

 研究了在非线性系统中 ,基于转换坐标卡尔曼滤波器的多传感器目标跟踪融合算法。通过分析得出 :在非线性系统的多传感器目标跟踪中 ,基于转换坐标卡尔曼滤波器 ( CMKF)的分布融合估计基本可以重构中心融合估计。仿真实验也证明了此结论。由此可见分布的 CMKFA是非线性系统中较优的分布融合算法     

一种面向多域作战指挥控制系统的信息融合系统设计

针对信息化战争条件下多源异构传感器的复杂目标识别与跟踪问题,基于开放架构思想设计了该系统 的功能逻辑与部署方式,在融合算法上基于最小化Cauchy-Schwarz散度的分布式融合算法和改进的D-S推理算法,实现了目标的点迹与属性融合。多个指标维度下的仿真评估结果表明,该系统的设计方案实现了预期功能,能够满足多域作战指挥控制系统的要求,相关方法可为相关领域研究人员提供参考。     

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 tracki...     

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

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

Directed Subspace Search ML-PDA with Application to Active Sonar Tracking

The maximum likelihood probabilistic data association (ML-PDA) tracking algorithm is effective in tracking Very Low Observable targets (i.e., very low signal-to-noise ratio (SNR) targets in a high false alarm environment). However, the computational complexity associated with obtaining the track estimate in many cases has precluded its use in real-time scenarios. Previous ML-PDA implementations used a multi-pass grid (MPG) search to find the track estimate. Two alternate methods for finding the track estimate are presented-a genetic search and a newly developed directed subspace (DSS) search algorithm. Each algorithm is tested using active sonar scenarios in which an autonomous underwater vehicle searches for and tracks a target. Within each scenario, the problem parameters are varied to illustrate the relative performance of each search technique. Both the DSS search and the genetic algorithm are shown to be an order of magnitude more computationally efficient than the MPG search, making possible real-time implementation. In addition, the DSS search is shown to be the most effective technique at tracking a target at the lowest SNR levels-reliable tracking down to 5 dB (postprocessing SNR in a resolution cell) using a 5-frame sliding window is demonstrated, this being 6 dB better than the MPG search.     

密集杂波环境下的数据关联快速算法

基于联合概率数据互联（JPDA）的思想,提出了一种新的数据关联快速算法（Fast Al-gorithm for Data Association,简称FAFDA算法）.该方法不需象在最优JPDA算法中那样生成所有可能的联合互联假设,因而具有计算量小,易于工程实现的特点。仿真结果表明,与最优JPDA算法相比,FAFDA算法的跟踪性能令人满意,并且在密集杂波环境下可实时、有效地跟踪100批次以上的目标。     

STUDY ON ALGORITHM OF SENSOR MANAGEMENT BASED ON FUNCTIONS OF EFFICIENCY AND WASTE

The sensor management system is a subsys-tem of a multisensor data fusion system,and itspurpose is to satisfy requests of multitarget andscanned space by using the limited sensor resourcesin order to gain optimal measurement values of allspecified characteristics ( detection and captureprobability,emission power of sensor,trackingprecision or target losing probability and so on) .By the optimal principle listed above,sensor re-sources are distributed in science and reason.In aword,itis a key p…     

Bernoulli particle flter with observer altitude for maritime radiation source tracking in the presence of measurement uncertainty

For maritime radiation source target tracking in particular electronic counter measures（ECM）environment,there exists two main problems which can deteriorate the tracking performance of traditional approaches.The frst problem is the poor observability of the radiation source.The second one is the measurement uncertainty which includes the uncertainty of the target appearing/disappearing and the detection uncertainty（false and missed detections）.A novel approach is proposed in this paper for tracking maritime radiation source in the presence of measurement uncertainty.To solve the poor observability of maritime radiation source target,using the radiation source motion restriction,the observer altitude information is incorporated into the bearings-only tracking（BOT）method to obtain the unique target localization.Then the two uncertainties in the ECM environment are modeled by the random fnite set（RFS）theory and the Bernoulli fltering method with the observer altitude is adopted to solve the tracking problem of maritime radiation source in such context.Simulation experiments verify the validity of the proposed approach for tracking maritime radiation source,and also demonstrate the superiority of the method compared with the traditional integrated probabilistic data association（IPDA）method.The tracking performance under different conditions,particularly those involving different duration of radiation source opening and switching-off,indicates that the method to solve our problem is robust and effective.     

基于自适应Siamese网络的无人机目标跟踪算法

无人机已被广泛应用到军事和民用领域，目标跟踪是无人机应用的关键技术之一。针对无人机跟踪过程中目标易发生形变、遮挡等问题，提出一种基于自适应Siamese网络的无人机目标跟踪算法。首先，利用2个卷积网络构建一个5层Siamese网络，通过对模板特征与当前帧图像特征进行卷积得到目标位置；其次，利用高斯混合模型对以往的预测结果进行建模并建立目标模板库；然后，从模板库中挑选出最可靠的目标模板并以此更新Siamese网络的匹配模板，使Siamese网络能够自适应目标的外观变化；最后，引入回归模型进一步精确目标位置，降低背景对网络性能的影响。仿真实验结果表明：该算法有效降低了形变、遮挡等情况对跟踪性能的影响，具有较高的准确率。     

Reduced spatio-temporal complexity MMPP and image-based tracking filters for maneuvering targets

We present reduced-complexity nonlinear filtering algorithms for image-based tracking of maneuvering targets. In image-based target tracking, the mode of the target is observed as a Markov modulated Poisson process (MMPP) and the aim is to compute optimal estimates of the target's state. We present a reduced complexity algorithm in two steps. First, a gauge transformation is used to reexpress the filtering equations in a form that is computationally more efficient for time discretization than naive discretization of the filtering equations. Second, a spatial aggregation algorithm with guaranteed performance bounds is presented for the time-discretized filters. A numerical example illustrating the performance of the resulting reduced-complexity filtering algorithms for a switching turn-rate model is presented.     

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

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