引入神经网络的交互式多模型算法

在交互式多模型算法中引入神经网络算法以改进目标跟踪的精度。利用神经网络算法对基于机动目标“当前”统计模型的均值和方差自适应滤波算法进行修改,提高该算法的性能,然后采用交互作用多模型算法跟踪机动目标,提高了机动目标的跟踪精度。     

Track-before-detect procedures for early detection of moving target from airborne radars

In this paper we present a family of track-before-detect (TBD) procedures for early detection of moving targets from airborne radars. Upon a sectorization of the coverage area, the received echoes are jointly processed in the azimuth-range-Doppler domain and in the time domain through a Viterbi-like algorithm that exploits the physically admissible target transitions between successive illuminations, in order to collect all of the energy back-scattered during the time on target (TOT). A reduced-complexity implementation is derived assuming, at the design stage, that the target does not change resolution cell during the TOT in each scan. The constant false alarm rate (CFAR) constraint is also englobed in the proposed procedures as well as the possibility of working with quantized data. Simulation results show that the proposed algorithms have good detection and tracking capabilities even for high target velocities and low quantization rates.     

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

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

Minimal submodel-set algorithm for maneuvering target tracking

The variable structure multiple model (VSMM) approach to the maneuvering target tracking problem is considered. A new VSMM design, the minimal submodel-set switching (MSMSS) algorithm for tracking a maneuvering target is presented. The MSMSS algorithm adaptively determines the minimal set of models from the total model set and uses this to perform multiple models (MM) estimation. In addition, an iterative MSMSS algorithm with improved maneuver detection and termination properties is developed. Simulations results demonstrate that, compared with a standard interacting MM (IMM), the proposed algorithms require significantly lower computation while maintaining similar tracking performance. Alternatively, for a computational load similar to IMM, the new algorithms display significantly improved performance.     

Problem characterization in tracking/fusion algorithm evaluation

The performance of a tracking/fusion algorithm depends very much on the complexity of the problem. This paper presents an approach for evaluating tracking/fusion algorithms that consider the difficulty of the problem. Evaluation is performed by characterizing the performance of the basic functions of prediction and association. The problem complexity is summarized by means of context metrics. Two context metrics for characterizing prediction and association difficulty are normalized target mobility and normalized target density. These metrics should be presented along with the performance metrics. The context metrics also support more efficient generation of input data for performance evaluation. Simple tests for evaluating basic tracking algorithm functions are presented     

Particle filters for tracking with out-of-sequence measurements

An extension is presented to the particle filtering toolbox that enables nonlinear/non-Gaussian filtering to be performed in the presence of out-of-sequence measurements (OOSMs) with arbitrary lag, without the need to adopt linearising approximations in the filter and without the degradation of performance that would occur if the OOSMs were simply discarded. An estimate of the performance of the OOSM particle filter (OOSM-PF) is obtained for bearings-only tracking scenarios with a single target and a small number of sensors. These performance estimates are then compared with the posterior Cramer-Rao lower bound (CRLB) for the state estimate rms error and similar performance estimates obtained from the oosm extended Kalman filter (OOSM-EKF) algorithms recently introduced in the literature. For a mildly nonlinear bearings-only tracking problem the OOSM-PF and OOSM-EKF are shown to achieve broadly similar performance.     

基于STF的Jerk模型自适应机动目标跟踪算法

在Jerk模型的基础上,提出了一种新的机动目标自适应跟踪算法STF-Jerk。该算法通过引入强跟踪滤波器(STF)的渐消因子,实时调节滤波器增益,增强了系统对突发机动的自适应跟踪能力,从而很好地改善了Jerk模型在跟踪机动目标时的跟踪精度。仿真结果表明,提出的STF-Jerk自适应跟踪算法显著提高了Jerk模型自适应算法的机动目标跟踪性能。     

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.     

复杂环境下一种基于改进核相关滤波的视觉鲁棒目标跟踪方法

目标跟踪在自动驾驶和智能监控系统等实时视觉应用中发挥着重要作用。在遮挡、相似干扰等情况下，传统的基于相关滤波的跟踪算法容易发生漂移，鲁棒性有待进一步提高。基于此，提出了一种扩展特征描述的检测辅助核相关滤波目标跟踪架构。首先，在传统的核相关滤波目标跟踪算法的基础上，通过目标检测辅助对跟踪结果进行质量判断，实现对遮挡以及目标丢失的判别；然后通过拓展特征模板的构建与匹配，实现抗干扰相似目标判断及目标重定位；最终，以行人跟踪为例进行了试验，分别通过OTB数据及验证试验和移动机器人平台视觉跟踪验证试验，验证了算法的可行性，并对算法的跟踪性能进行了测试。试验结果表明，所提方法能够稳定地跟踪移动目标，对遮挡、相似干扰具有较强的鲁棒性。     

Survey of maneuvering target tracking. Part V. Multiple-model methods

This is the fifth part of a series of papers that provide a comprehensive survey of techniques for tracking maneuvering targets without addressing the so-called measurement-origin uncertainty. Part I and Part II deal with target motion models. Part III covers measurement models and associated techniques. Part IV is concerned with tracking techniques that are based on decisions regarding target maneuvers. This part surveys the multiple-model methods $the use of multiple models (and filters) simultaneously - which is the prevailing approach to maneuvering target tracking in recent years. The survey is presented in a structured way, centered around three generations of algorithms: autonomous, cooperating, and variable structure. It emphasizes the underpinning of each algorithm and covers various issues in algorithm design, application, and performance.     

Image-enhanced tracking

Measurement of the angular orientation of the target or the target designation makes possible the design of high-accuracy tracking and prediction systems. Such measurements are best accomplished with an imaging sensor. A model is presented for the image-based observation link, along with the equations used to convert a sequence of image processor outputs into an estimate of target status. An example examines the interrelationship which exists between the rate of feature changes of a target, the frame rate of the imager, and the sensitivity of the sensor-image processor. It is shown that even at high frame rates, anomalous events may occur     

图象序列中机动目标的形心跟踪

从边检测边跟踪的角度探讨了图象序列中机动目标的形心跟踪问题,深入分析了强高斯噪声背景下目标形心估计的统计性质及用于形心估计的图象预处理方法。指出经典的图象二值化变换分割后作形心估计的方法面临着估计偏差和方差的矛盾,提出了用自适应交互三模型(ATIMM)跟踪图象序列中机动目标的方法,同时发现在了解目标形状的条件下,空间匹配滤波,二值变换点集聚类和 ATIMM三者的结合对图象序列中的机动目标具有最好的跟踪性能。     

The Tracking Index: A Generalized Parameter for ? ? ? and ? ? ? ? Target Trackers

A generalized, optimal filtering solution is presented for the target tracking problem. Applying optimal filtering theory to the target tracking problem, the tracking index, a generalized parameter proportional to the ratio of the position uncertainty due to the target maneuverability to that due to the sensor measurement, is found to have a fundamental role not only in the optimal steady-state solution of the stochastic regulation tracking problem, but also in the track initiation process. Depending on the order of the tracking model, the tracking index solution yields a closed form, consistent set of generalized tracking gains, relationships, and performances. Using the tracking index parameter, an initializing and tracking procedure in recursive form, realizes the accuracy of the Kalman filter with an algorithm as simple as the well-known ? ? ? filter or ? ? ? ? ? filter depending on the tracking order.     

Design of a practical tracking algorithm with radar measurements

The extended Kalman filter (EKF) has been widely used as a nonlinear filtering method for radar tracking problems. However, it has been found that if cross-range measurement errors of the target position are large, the performance of the conventional EKF degrades considerably due to nonnegligible nonlinear effects. A new filtering algorithm for improving the tracking performance with radar measurements is developed based on the fact that correct evaluation of the measurement error covariance is possible in the Cartesian coordinate system. The proposed algorithm may be viewed as a modification of the EKF in which the variance of the range measurement errors is evaluated in an adaptive manner. The filter structure facilitates the incorporation of the sequential measurement processing scheme, and this makes the resulting algorithm favorable to both estimation accuracy and computational efficiency. Computer simulation results show that the proposed method offers superior performance in comparison to previous methods. Moreover, our developed algorithm provides some useful insight into the radar tracking problem     

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.     

Track-before-detect for Infrared Maneuvering Dim Multi-target via MM-PHD

In this paper, we present a novel and efficient track-before-detect (TBD) algorithm based on multiple-model probability hypothesis density (MM-PHD) for tracking infrared maneuvering dim multi-target. Firstly, the standard sequential Monte Carlo probability hypothesis density (SMC-PHD) TBD-based algorithm is introduced and sequentially improved by the adaptive process noise and the importance re-sampling on particle likelihood, which result in the improvement in the algorithm robustness and convergence speed. Secondly, backward recursion of SMC-PHD is derived in order to ameliorate the tracking performance especially at the time of the multi-target arising. Finally, SMC-PHD is extended with multiple-model to track maneuvering dim multi-target. Extensive experiments have proved the efficiency of the presented algorithm in tracking infrared maneuvering dim multi-target, which produces better performance in track detection and tracking than other TBD-based algorithms including SMC-PHD, multiple-model particle filter (MM-PF), histogram probability multi-hypothesis tracking (H-PMHT) and Viterbi-like.     

自由段弹道目标跟踪算法在工程中的应用

在对弹道目标跟踪预警的工程实践中,雷达系统对目标运动的信息处理速度尤为重要,因而,文章选取自适应跟踪模型与卡尔曼滤波相结合的方法解决自由段弹道目标的跟踪问题,并与扩展卡尔曼跟踪算法做了对比分析。仿真显示,2种滤波方式分别与自适应跟踪模型相结合后,卡尔曼滤波和扩展卡尔曼滤波跟踪性能相差不大,但其算法简单、运算时间短,可以较好满足自由段弹道目标跟踪的工程需求。     

Nonparametric methods for clutter removal

Methods of clutter rejection are discussed which furnish an inherent counterpart of target tracking and detection algorithms. We describe how nonparametric curve estimation methods reduce the original sensor data to a “signal-plus-noise” model which is well suited for various hypotheses testing and dynamical filtering algorithms. We also verify a “white noise” assumption for the model of residuals     

Tracking in Clutter using IMM-IPDA?Based Algorithms

We describe three single-scan probabilistic data association (PDA) based algorithms for tracking manoeuvering targets in clutter. These algorithms are derived by integrating the interacting multiple model (IMM) estimation algorithm with the PDA approximation. Each IMM model a posteriori state estimate probability density function (pdf) is approximated by a single Gaussian pdf. Each algorithm recursively updates the probability of target existence, in the manner of integrated PDA (IPDA). The probability of target existence is a track quality measure, which can be used for false track discrimination. The first algorithm presented, IMM-IPDA, is a single target tracking algorithm. Two multitarget tracking algorithms are also presented. The IMM-JIPDA algorithm calculates a posteriori probabilities of all measurement to track allocations, in the manner of the joint IPDA (JIPDA). The number of measurement to track allocations grows exponentially with the number of shared measurements and the number of tracks which share the measurements. Therefore, IMM-JIPDA can only be used in situations with a small number of crossing targets and low clutter measurement density. The linear multitarget IMM-IPDA (IMM-LMIPDA) is also a multitarget tracking algorithm, which achieves the multitarget capabilities by integrating linear multitarget (LM) method with IMM-IPDA. When updating one track using the LM method, the other tracks modulate the clutter measurement density and are subsequently ignored. In this fashion, LM achieves multitarget capabilities using the number of operations which are linear in the: number of measurements and the number of tracks, and can be used in complex scenarios, with dense clutter and a large number of targets.