Architectures and algorithms for track association and fusion

Target tracking using multiple sensors can provide better performance than using a single sensor. One approach to multiple target tracking with multiple sensors is to first perform single sensor tracking and then fuse the tracks from the different sensors. Two processing architectures for track fusion are presented: sensor to sensor track fusion, and sensor to system track fusion. Technical issues related to the statistical correlation between track estimation errors are discussed. Approaches for associating the tracks and combining the track state estimates of associated tracks that account for this correlation are described and compared by both theoretical analysis and Monte Carlo simulations     

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     

Track labeling and PHD filter for multitarget tracking

Multiple target tracking requires data association that operates in conjunction with filtering. When multiple targets are closely spaced, the conventional approaches (as, e.g., MHT/assignment) may not give satisfactory results. This is mainly because of the difficulty in deciding what the number of targets is. Recently, the probability hypothesis density (PHD) filter has been proposed and particle filtering techniques have been developed to implement the PHD filter. In the particle PHD filter, the track labeling problem is not considered, i.e., the PHD is obtained only for a frame at a time, and it is very difficult to perform the multipeak extraction, particularly in high clutter environments. A track labeling method combined with the PHD approach, as well as considering the finite resolution, is proposed here for multitarget tracking, i.e., we keep a separate tracker for each target, use the PHD in the resolution cell to get the estimated number and locations of the targets at each time step, and then perform the track labeling ("peak-to-track" association), whose results can provide information for PHD peak extraction at the next time step. Besides, by keeping a separate tracker for each target, our approach provides more information than the standard particle PHD filter. For example, in group target tracking, if we are interested in the motion of a specific target, we can track this target, which is not possible for the standard particle PHD filter, since the standard particle PHD filter does not keep track labels. Using our approach, multitarget tracking can be performed with automatic track initiation, maintenance, spawning, merging, and termination     

Tracking with classification-aided multiframe data association

In most conventional tracking systems, only the target kinematic information from, for example, a radar or sonar or an electro-optical sensor, is used in measurement-to-track association. Target class information, which is typically used in postprocessing, can also be used to improve data association to give better tracking accuracy. The use of target class information in data association can improve discrimination by yielding purer tracks and preserving their continuity. In this paper, we present the simultaneous use of target classification information and target kinematic information for target tracking. The approach presented integrates target class information into the data association process using the 2-D (one track list and one measurement list) as well as multiframe (one track list and multiple measurement lists) assignments. The multiframe association likelihood is developed to include the classification results based on the "confusion matrix" that specifies the accuracy of the target classifier. The objective is to improve association results using class information when the kinematic likelihoods are similar for different targets, i.e., there is ambiguity in using kinematic information alone. Performance comparisons with and without the use of class information in data association are presented on a ground target tracking problem. Simulation results quantify the benefits of classification-aided data association for improved target tracking, especially in the presence of association uncertainty in the kinematic measurements. Also, the benefit of 5-D (or multiframe) association versus 2-D association is investigated for different quality classifiers. The main contribution of this paper is the development of the methodology to incorporate exactly the classification information into multidimensional (multiframe) association.     

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.     

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

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

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

基于飞行器图像的目标跟踪方法研究

提出了一种利用飞行器图像进行目标跟踪的方法，建立了飞行器图像跟踪系统。该系统利用一种云台控制算法搜索飞行器的图像，通过对飞行器图像的边缘检测、图像中心点提取等处理，实现了飞行器图像定位。理论计算和实际应用表明，该系统可以对低马赫数和高马赫数飞行器进行图像跟踪。     

基于人工神经网络的多模型目标跟踪算法

针对在目标跟踪中单模型跟踪算法难以应对目标运动形式的变化,而多模型跟踪算法存在结构固定、跟踪精度被非匹配模型削弱且模型切换缓慢的矛盾,文章提出了一种基于人工神经网络的多模型目标跟踪算法。通过分析目标几种基本运动模式的轨迹特点,归纳出目标运动轨迹的特征向量。利用训练好的BP神经网络对滑窗里的轨迹段进行运动模型识别,按结果进行跟踪模型切换,达到使跟踪算法实时适应目标运动状态的目的。仿真结果证明了该算法的有效性,且与传统的多模型算法相比,具有结构更加简单、更强的灵活性和拓展性的特点。     

Evaluating a multiple-hypothesis multitarget tracking algorithm

The performance evaluation of multiple-hypothesis, multitarget tracking algorithm is presented. We are primarily interested in target-detection/track-initiation capabilities as measures of performance. Through Monte Carlo simulations, a multiple-hypothesis tracking algorithm was evaluated in terms of 1) probability of establishing a track from target returns and 2) false track density. A radar was chosen as the sensor, and a general multiple-hypothesis, multitarget tracking algorithm was used in the Monte Carlo simulations. The simulation results predict the probability of establishing a track from returns of a target as well as the false track density per scan volume per unit time. The effects of the target radar cross section and the radar power, measured through the mean signal-to-noise ratio (SNR) were studied, as were the effects of detection threshold and track quality threshold. Computational requirements were also investigated     

Maximum likelihood track-before-detect with fluctuating targetamplitude

An important problem in target tracking is the detection and tracking of targets in very low signal-to-noise ratio (SNR) environments. In the past, several approaches have been used, including maximum likelihood. The major novelty of this work is the incorporation of a model for fluctuating target amplitude into the maximum likelihood approach for tracking of constant velocity targets. Coupled with a realistic sensor model, this allows the exploitation of signal correlation between resolution cells in the same frame, and also from one frame to the next. The fluctuating amplitude model is a first order model to reflect the inter-frame correlation. The amplitude estimates are obtained using a Kalman filter, from which the likelihood function is derived. A numerical maximization technique avoids problems previously encountered in “velocity filtering” approaches due to mismatch between assumed and actual target velocity, at the cost of additional computation. The Cramer-Rao lower bound (CRLB) is derived for a constant, known amplitude case. Estimation errors are close to this CRLB even when the amplitude is unknown. Results show track detection performance for unknown signal amplitude is nearly the same as that obtained when the correct signal model is used     

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.     

Interacting multiple model tracking with target amplitude feature

A recursive tracking algorithm is presented which uses the strength of target returns to improve track formation performance and track maintenance through target maneuvers in a cluttered environment. This technique combines the interacting multiple model (IMM) approach with a generalized probabilistic data association (PDA), which uses the measured return amplitude in conjunction with probabilistic models for the target and clutter returns. Key tracking decisions can be made automatically by assessing the probabilities of target models to provide rapid and accurate decisions for both true track acceptance and false track dismissal in track formation. It also provides the ability to accurately continue tracking through coordinated turn target maneuvers     

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.     

IMMPDAF for radar management and tracking benchmark with ECM

A framework is presented for controlling a phased array radar for tracking highly maneuvering targets in the presence of false alarms (FAs) and electronic countermeasures (ECMs). Algorithms are presented for track formation and maintenance; adaptive selection of target revisit interval, waveform and detection threshold; and neutralizing techniques for ECM, namely, against a standoff jammer (SOJ) and range gate pull off (RGPO). The interacting multiple model (IMM) estimator in combination with the probabilistic data association (PDA) technique is used for tracking. A constant false alarm rate (CFAR) approach is used to adaptively select the detection threshold and radar waveform, countering the effect of jammer-induced false measurements. The revisit interval is selected adaptively, based on the predicted angular innovation standard deviations. This tracker/radar-resource-allocator provides a complete solution to the benchmark problem for target tracking and radar control. Simulation results show an average sampling interval of about 2.5 s while maintaining a track loss less than the maximum allowed 4%     

Use of measurements from an imaging sensor for precision targettracking

The extraction of measurements for precision tracking of the centroid of a target from a forward-looking infrared imaging sensor is presented. The size of the image of the target is assumed to be small, i.e. around 10 pixels. The statistical characterization of the centroid of the target is obtained. Similarly, the statistical properties of the image correlation of two frames, which measures the target offset, are derived. Explicit expressions that map the video noise statistics into measurement noise statistics are obtained. The offset measurement noise is shown to be autocorrelated. State variable models for tracking the target centroid with these measurements are then presented. Simulation results and quantitative conclusions about achievable subpixel tracking accuracy are given. It is shown that the filter that models the autocorrelated measurement noise provides the best performance     

A Self-organizing Bearings-only Target Tracking Algorithm in Wireless Sensor Network

In the bearings-only target tracking, wireless sensor network (WSN) collects observations of the target direction at various nodes and uses an adaptive filter to combine them for target tracking. An efficient network management is necessary to gain an optimal tradeoff between locating accuracy and energy consumption. This article proposes a self-organizing target tracking algorithm to select the most beneficial subset of nodes to track the target at every snapshot. Compared with traditional methods, this scheme avoids the need for keeping global position information of the network as in greedy selection. Each node judges its future usefulness depending on the knowledge of its own position and using simple mathematics computation. Simulations indicate that this scheme has locating accuracy comparable to the global greedy algorithm. Also, it has good robustness against node failure and autonomous adaptability to the change of the network scale. Furthermore, this algorithm consumes limited energy because only a portion of nodes partakes in the selection at every snapshot.     

运动平台上基于粒子滤波的目标跟踪技术

在固定平台上实现视频运动目标的准确跟踪本身就是一项富有挑战性的工作。何况在运动平台上,受到背景杂波、亮度变化以及摄像机运动等干扰的影响,要想成功地对目标进行跟踪则更加困难。提出将强度梯度跟踪器与粒子滤波相结合,实现对运动平台上的视频序列中的运动目标的准确跟踪。实验结果表明,跟踪方法能准确、可靠地自动跟踪视频序列中的运动目标。     

Efficient target tracking using dynamic programming

A dynamic programming (DP) algorithm has been developed for the detection and tracking of subpixel-sized, low signal-to-noise ratio (SNR) targets observed by side-or forward-looking imaging sensors. A distinguishing feature of this approach is that target detection and tracking are combined into a single optimization procedure that takes into account statistical models of target motion, background noise, and clutter. Current work has led to a number of technical innovations that improve the performance and efficiency of the DP tracking algorithm, including the development of a new track scoring function, and an extension to the basic DP algorithm that reduces computation requirements by over an order of magnitude. A prototype infrared (IR) target tracking system incorporating these enhancements has been implemented for a step-starting IR camera application. Sensitivity improvements of several decibels over conventional sequential detection and tracking algorithms were realized     

多目标跟踪的概率假设密度粒子滤波

在多目标跟踪中,当目标数很大时,目标状态的联合分布的计算量会非常大。如果目标独立运动,可用各目标分别滤波来代替,但这要求考虑数据互联问题。文章介绍一种可以解决计算量问题的方法,只需计算联合分布的一阶矩——概率假设密度(PHD),PHD在任意区域S上的积分是S内目标数的期望值。因未记录目标身份,避免了数据互联问题。仿真中,传感器为被动雷达,目标观测值为距离、角度及速度时,对上述的PHD滤波进行了粒子实现,并对观测值是否相关的不同情况进行比较。PHD粒子滤波应用在非线性模型的多目标跟踪,实验结果表明,滤波可以稳健跟踪目标数为变数的情况,得到了接近真实情况的结果。