弹道导弹助推段拦截融合跟踪算法研究

针对空基雷达数据率低的特点,提出一种新的基于雷达/红外成像的机动目标跟踪信息融合算法.建立了弹道导弹目标机动模型和雷达/红外成像导引头观测方程,以动能拦截弹红外成像导引头数据更新时间为基准,以空基雷达采样周期为间隔对距离信息进行实时修正,推导了雷达/红外成像复合制导信息融合跟踪扩展卡尔曼滤波算法.仿真结果表明,该算法融...     

A fusion and learning algorithm for landing aircraft tracking:compensating for exhaust plume disturbance

An algorithm is presented for tracking a landing aircraft using fusion of two different passive sensors, a laser range finder (LRF) and a forward-looking infrared (FLIR) camera. The main feature of this algorithm is its ability to identify and compensate for an exhaust plume disturbance. The algorithm is based on the extended Kalman filter (EKF) and the filtering confidence function (FCF) which introduces a learning approach to the tracking problem. The results of a simulation using the learning tracking algorithm and the EKF alone are presented and compared     

A nonlinear IMM algorithm for maneuvering target tracking

In target tracking, the measurement noise is usually assumed to be Gaussian. However, the Gaussian modeling of the noise may not be true. Noise can be non-Gaussian. The non-Gaussian noise arising in a radar system is known as glint noise. The distribution of glint noise is long tailed and will seriously affect the tracking performance. We develop a new algorithm that can effectively track a maneuvering target in the glint environment The algorithm incorporates the nonlinear Masreliez filter into the interactive multiple model (IMM) method. Simulations demonstrate the superiority of the new algorithm     

A simple fixed-lag algorithm for tracking frequency rate-of-change

A family of simple fixed-lag frequency smoothing algorithms which provide good estimates of both frequency and frequency rate-of-change is reported. The smoothers were developed from a fixed-gain αβ tracker by replacing the recursive derivative estimator with a finite-impulse-response (FIR) differentiator. Simulation results are presented which show that the smoothing algorithms provide frequency estimates with a similar variance to those produced by the αβ filter but with greatly improved frequency-rate estimates. The smoothing algorithms and the αβ filter are also compared on the basis of the bias and delay introduced in the frequency-rate estimates. Although the results presented are for frequency estimation, the smoothing algorithms can be used in any single-input tracking application where some lag in the estimates is allowable     

On mapping a tracking algorithm onto parallel processors

The problem of mapping the tasks of a multitarget tracking algorithm onto parallel computing architectures to maximize speedup is considered. An asymptotically optimal mapping algorithm is developed and applied to study the effects of task granularity and processor architectures on the speedup. From the simulation results, it is concluded that task granularity and the parallelization of clustering and global hypotheses formation stages of the tracking algorithm are major determinants of speedup     

An efficient algorithm for multisensor track fusion

An efficient algorithm for track-to-track fusion by incorporating cross-covariance between tracks created by dissimilar sensors is described. An analytical solution of this problem is complicated if cross-correlation between sensors tracking the same target is taken into account. An explicit solution of the cross-covariance matrix at steady state is derived in terms of an integral. It is shown that solution of this integral involves inversion of a matrix whose elements are functions of parameters of individual trackers. Structure of this matrix is analyzed. An efficient analytical solution for inversion of this matrix is obtained. For fusion of similar sensors, it is shown that this matrix is reduced to the Routh-Hurwitz matrix which arises in the study of steady state stability of linear systems. Numerical results showing the amount of reduction of fused track covariance by taking into account the effects of cross-correlation between candidate tracks for fusion is also presented     

Taxonomic performance evaluation for multitarget tracking systems

A scoring scheme based on an object track classification which facilitates performance evaluation for multiple-target tracking systems is derived and applied to specific test cases involving a comparison of operational and modified tracking system performance. The performance measures derived can be applied both to comparative evaluations of tracking system alternatives where relative performance is the issue, and to evaluations of system performance relative to what can be achieved in any given target object environment     

飞行小目标自适应双波门跟踪算法

波门跟踪是一种利用实际图像处理的区域范围的视觉跟踪算法。在飞行小目标信噪比较低的情况下,现有方法往往不能获得稳定的跟踪结果。针对小目标跟踪的特点,提出了一种自适应双波门的跟踪算法。该算法采用帧间差分算法检测小目标,通过质心标定修正当前帧目标的初始位置,并利用最小二乘估计预测算法实现目标范围的估计,从而实现自适应跟踪的目的。实验结果表明,即使在飞行小目标被短时遮挡情况下,利用本算法也能稳定地检测出它的位置,能根据目标的轮廓自适应地确定目标波门形状,并能有效解决目标跟踪偏移和短时丢失等问题。     

无人机跟踪运动目标航迹规划算法

对无人机跟踪运动目标的原理进行了分析,设计了跟踪系统的动力学模型,提出了一种基于切线法的航迹规划算法。在动力学约束条件下实现了对无人机的航迹、速度、加速度等的最优控制,从而解决了无人机跟踪运动目标问题,并给出了算法的具体设计步骤。仿真结果表明,该算法能够快速、有效地为无人机规划出跟踪运动目标的最优航迹。     

一种融合卡尔曼滤波的改进时空上下文跟踪算法

针对时空上下文跟踪算法对快速运动和遭受严重遮挡目标的跟踪精度下降问题,提出一种融合卡尔曼滤波的改进时空上下文跟踪算法。首先人工标记目标所在的矩形区域,然后利用改进的时空上下文算法对目标进行稳定跟踪,在跟踪过程中,基于连续两帧图像灰度的欧氏距离判定目标跟踪状态,当判定目标遭受严重遮挡时,利用卡尔曼滤波进行预测估计。算法对噪声有一定的容忍度,通过降低噪声对跟踪过程的影响,能够得到更优的目标区域。仿真实验结果表明:本文算法适用于不同光照强度下高速、高机动目标的稳定跟踪,并且对目标的尺度变化和短时严重遮挡具有鲁棒性。算法帧平均耗时为34.07ms;帧几何中心平均误差为5.43pixel,比时空上下文算法减少70.2%;目标轮廓面积平均误差为13.08%,比时空上下文算法减少52.7%。     

Comparison of two-sensor tracking methods based on state vectorfusion and measurement fusion

There are two approaches to the two-sensor track-fusion problem. Y Bar-Shalom and L. Campo (ibid., vol.AES-22, 803-5, Nov. 1986) presented the state vector fusion method, which combines state vectors from the two sensors to form a new estimate while taking into account the correlated process noise. The measurement fusion method or data compression of D. Willner et al. (1976) combines the measurements from the two sensors first and then uses this fused measurement to estimate the state vector. The two methods are compared and an example shows the amount of improvement in the uncertainty of the resulting estimate of the state vector with the measurement fusion method     

Data fusion of multiradar system by using genetic algorithm

Detection system with distributed sensors and data fusion. are increasingly being used by surveillance systems. There has been a great deal of theoretical study on decentralized detection networks composed of identical or non-identical sensors. To solve the resulting nonlinear system, exhaustive search and some crude approximations are adopted. However, those methods often cause either the system to be insensitive to some parameters or the suboptimal results. In this paper, a novel flexible genetic algorithm is investigated to obtain the optimal results on constant false alarm rate data fusion. Using this approach, all system parameters are directly coded in decimal chromosomes and they can be optimized simultaneously. The simulation results show that adopting the proposed approach, one can achieve better performances than the reported methods and results     

Performance evaluation for multi-target tracking with temporal dimension specifics

With the great development of Multi-Target Tracking(MTT) technologies,many MTT algorithms have been proposed with their own advantages and disadvantages.Due to the fact that requirements to MTT algorithms vary from the application scenarios,performance evaluation is significant to select an appropriate MTT algorithm for the specific application scenario.In this paper,we propose a performance evaluation method on the sets of trajectories with temporal dimension specifics to compare the estimated trajectories with the true trajectories.The proposed method evaluates the estimate results of an MTT algorithm in terms of tracking accuracy,continuity and clarity.Furthermore,its computation is based on a multi-dimensional assignment problem,which is formulated as a computable form using linear programming.To enhance the influence of recent estimated states of the trajectories in the evaluation,an attention function is used to reweight the trajectory errors at different time steps.Finally,simulation results show that the proposed performance evaluation method is able to evaluate many aspects of the MTT algorithms.These evaluations are worthy for selecting suitable MTT algorithms in different application scenarios.     

A robust Poisson multi-Bernoulli filter for multi-target tracking based on arithmetic average fusion

The coalescence and missed detection are two key challenges in Multi-Target Tracking (MTT). To balance the tracking accuracy and real-time performance, the existing Random Finite Set (RFS) based filters are generally difficult to handle the above problems simultaneously, such as the Track-Oriented marginal Multi-Bernoulli/Poisson (TOMB/P) and Measurement-Oriented marginal Multi-Bernoulli/Poisson (MOMB/P) filters. Based on the Arithmetic Average (AA) fusion rule, this paper proposes a novel fusion framework for the Poisson Multi-Bernoulli (PMB) filter, which integrates both the advantages of the TOMB/P filter in dealing with missed detection and the advantages of the MOMB/P filter in dealing with coalescence. In order to fuse the different PMB distributions, the Bernoulli components in different Multi-Bernoulli (MB) distributions are associated with each other by Kullback-Leibler Divergence (KLD) minimization. Moreover, an adaptive AA fusion rule is designed on the basis of the exponential fusion weights, which utilizes the TOMB/P and MOMB/P updates to solve these difficulties in MTT. Finally, by comparing with the TOMB/P and MOMB/P filters, the performance of the proposed filter in terms of accuracy and efficiency is demonstrated in three challenging scenarios.     

The workshop on estimation, tracking and fusion: a tribute toYaakov Bar-Shalom

The subject of this article, the 4th ONR/GTRI Workshop on Target Tracking and Sensor Fusion was held at the Naval Postgraduate School in Monterey, California in May 2001. The people who meet at this share a common interest in and around the tracking area, and perforce owe much to Yaakov. On the day following the workshop, most of the participants moved across the NPS campus for The Workshop on Estimation, Tracking and Fusion: A Tribute to Yaakov Bar-Shalom, a remarkable two-part event in honor of Yaakov's 50th birthday     

Weighted adaptive filtering algorithm for carrier tracking of deep space signal

Carrier tracking is laid great emphasis and is the difficulty of signal processing in deep space communication system.For the autonomous radio receiving system in deep space, the tracking of the received signal is automatic when the signal to noise ratio(SNR) is unknown.If the frequency-locked loop(FLL) or the phase-locked loop(PLL) with fixed loop bandwidth, or Kalman filter with fixed noise variance is adopted, the accretion of estimation error and filter divergence may be caused.Therefore, the Kalman filter algorithm with adaptive capability is adopted to suppress filter divergence.Through analyzing the inadequacies of Sage–Husa adaptive filtering algorithm, this paper introduces a weighted adaptive filtering algorithm for autonomous radio.The introduced algorithm may resolve the defect of Sage–Husa adaptive filtering algorithm that the noise covariance matrix is negative definite in filtering process.In addition, the upper diagonal(UD) factorization and innovation adaptive control are used to reduce model estimation errors,suppress filter divergence and improve filtering accuracy.The simulation results indicate that compared with the Sage–Husa adaptive filtering algorithm, this algorithm has better capability to adapt to the loop, convergence performance and tracking accuracy, which contributes to the effective and accurate carrier tracking in low SNR environment, showing a better application prospect.     

三角嵌铺粒子追踪算法的三维化扩展

针对连续帧三维流场粒子的匹配问题,对基于三角嵌铺的粒子追踪算法进行了三维化扩展并将其命名为3DT PTV。3DT PTV遵循从粒子样型匹配到粒子匹配的原则,即粒子匹配结果从粒子样型匹配结果中总结。首先通过自定义"粒子样型DT网格"实现了粒子样型匹配的参数无依赖性,使3DT PTV适用于粒子非均匀分布流场;其次通过自定义"样型唯一性标识向量"进行粒子样型匹配;最终通过"双向计算-概率择优"模块对样型匹配结果进行样本扩展并整合出粒子匹配。通过添加自定义干扰的JPIV人工流场对3DT PTV进行了检验。除了算法本身的简洁性,结果亦证明了3DT PTV处理粒子无匹配率较高的复杂流动的良好特性。     

多UAV路径跟踪协同编队机动指令决策算法

针对多UAV在空间路径跟踪下的协同编队控制问题,设计了一种机动指令决策算法。对单架UAV的路径跟踪引入视距导航算法并进行改进,得到航迹方位角和航迹倾斜角的参考指令;对于多UAV协同编队控制,应用图论知识得到空速大小的参考指令;依据参考指令,通过函数解析与数值编程相结合的方法计算出机动指令。仿真结果表明,该算法能够有效控制多UAV从任意初始状态进行预期的路径跟踪协同编队飞行。     

Performance evaluation of track fusion with information matrixfilter

In a multisensor environment, each sensor detects multiple targets and creates corresponding tracks. Fusion of tracks from these, possibly dissimilar, sensors yields more accurate kinematic and attribute information regarding the target. Two methodologies have been employed for such purpose, which are: measurement fusion and state vector fusion. It is well known that the measurement fusion approach is optimal but computationally inefficient and the state vector fusion algorithms are more efficient but suboptimal, in general. This is so because the state vector estimates to be fused obtained from two sensors, are not conditionally independent in general due to the common process noise from the target being tracked. It is to be noted that there are three approaches to state vector fusion, which are: weighted covariance, information matrix, and pseudomeasurement. This research is restricted solely to performance evaluation of the information matrix form of state vector fusion. Closed-form analytical solution of steady state fused covariance has been derived as a measure of performance using this approach. Note that the results are derived under the assumptions that the two sensors are synchronized and no misassociation or merged measurement is considered in the study. Results are compared with those using Monte Carlo simulation, which was used in the past to predict fusion system performance by various authors. These results provide additional insight into the mechanism of track fusion and greatly simplify evaluation of fusion performance. In addition, availability of such a solution facilitates the trade-off studies for designing fusion systems under various operating conditions     

Dignet: an unsupervised-learning clustering algorithm forclustering and data fusion

Dignet is a self-organizing artificial neural network (ANN) that exhibits deterministically reliable behavior-to-noise interference, when the noise does not exceed a prespecified level of tolerance. The complexity of the proposed ANN, in terms of neuron requirements versus stored patterns, increases linearly with the number of stored patterns and their dimensionality. The self-organization of Dignet is based on the idea of competitive generation and elimination of attraction well in the pattern space. Dignet is used for detection and distributed decision fusion. Analytical and numerical results are included