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.     

Joint integrated probabilistic data association: JIPDA

A new recursive filter for multi-target tracking in clutter is presented. Multiple tracks may share the same measurement(s). Joint events are formed by creating all possible combinations of track-measurement assignments and the probabilities for these joint events are calculated. The expressions for the joint event probabilities incorporate the probabilities of target existence of individual tracks, an efficient approximation for the cluster volume and a priori probability of the number of clutter measurements in each cluster. From these probabilities the data association and target existence probabilities of individual tracks are obtained, which allows track state update and false track discrimination. A simulation study is presented to show the effectiveness of this approach.     

基于PTE的多雷达航迹融合算法

针对杂波背景下的多雷达航迹融合时局部估计误差互协方差矩阵未知的问题，提出基于目标存在概率（PTE）的航迹融合算法，提升了正确航迹率和跟踪精度。首先，通过综合概率数据关联得到单接收站的目标航迹估计集合和对应的目标存在概率。然后，在局部估计误差互协方差矩阵未知的条件下，基于PTE信息提出不带记忆的综合广义凸组合航迹融合算法。进而将前一帧的融合状态进行反馈，提出带记忆的综合广义凸组合航迹融合算法。仿真验证了所提算法的有效性。     

A multipath data association tracker for over-the-horizon radar

A new algorithm, multipath probabilistic data association (MPDA), for initiation and tracking in over-the-horizon radar (OTHR) is described. MPDA is capable of exploiting multipath target signatures arising from discrete propagation modes that are resolvable by the radar. Nonlinear measurement models exhibiting multipath target signatures in azimuth, slant range, and Doppler are used. Tracking is performed in ground coordinates and therefore depends on the provision of estimates of virtual ionospheric heights to achieve coordinate registration. Although the propagation mode characteristics are assumed to be known, their correspondence with the detections is not required to be known. A target existence model is included for automatic track maintenance. Numerical simulations for four resolvable propagation modes are presented that demonstrate the ability of the technique to initiate and maintain track at probabilities of detection of 0.4 per mode in clutter densities for which conventional probabilistic data association (PDA) has a high probability of track loss, and suffers from track bias. A nearest neighbor version of MPDA is also presented     

Diffusion analysis of track loss in clutter

In tracking a target through clutter, the selection of incorrect measurements for track updating causes track divergence and eventual loss of track. The plot-to-track association algorithm is modeled as a Markov process and the tracking error is modeled as a diffusion process in order to study the mechanism of track loss analytically, without recourse to Monte Carlo simulations, for nearest-neighbor association in two space dimensions. The time evolution of the error distribution is examined, and the connection of the approach with diffusion theory is discussed. Explicit results showing the dependence of various performance parameters, such as mean time to lose track and track half-life, on the clutter spatial density are presented. The results indicate the existence of a critical density region in which the tracking performance degrades rapidly with increasing clutter density. An optimal gain adaptation procedure that significantly improves the tracking performance in the critical region is proposed     

基于点集合并的修正Hough变换TBD算法

在低信噪比条件下,基于Hough变换的检测前跟踪算法是进行强杂波背景下目标航迹检测的一种手段。本文针对Hough变换后一个目标产生多条可能航迹以及航迹内可能存在杂波点的问题,提出了一种基于能量最大点和点集合并的修正Hough变换检测前跟踪算法。该算法利用量测点时序、能量信息及目标速度先验信息对Hough变换后点迹进行关联和剔除,能够有效的对目标原始航迹进行回溯。针对高斯噪声背景下的飞行目标,仿真结果表明该算法能够对微弱目标进行有效检测,在目标数目、杂波密度、信噪比发生变化的条件下仍能保持较高的检测概率。     

Road-map assisted ground moving target tracking

Tracking ground targets with airborne GMTI (ground moving target indicator) sensor measurements proves to be a challenging task due to high target density, high clutter, and low visibility. The exploitation of nonstandard background information such as road maps and terrain information is therefore highly desirable for the enhancement of track quality and track continuity. The present paper presents a Bayesian approach to incorporate such information consistently. It is particularly suited to deal with winding roads and networks of roads. The target dynamics is modeled in quasi one-dimensional road coordinates and mapped onto ground coordinates using linear road segments taking road map errors into account. The case of several intersecting roads with different characteristics, such as mean curvature, slope, or visibility, is treated within an interacting multiple model (IMM) scheme. Targets can be masked both by the clutter notch of the sensor and by terrain obstacles. Both effects are modeled using a sensor-target state dependent detection probability. The iterative filter equations are formulated within a framework of Gaussian sum approximations on the one hand and a particle filter approach on the other hand. Simulation results for single targets taken from a realistic ground scenario show strongly reduced target location errors compared with the case of neglecting road-map information. By modeling the clutter notch of the GMTI sensor, early detection of stopping targets is demonstrated     

Passive ranging of a low observable ballistic missile in agravitational field

In this paper we present an estimation algorithm for tracking the motion of a low-observable target in a gravitational field, for example, an incoming ballistic missile (BM), using angle-only measurements. The measurements, which are obtained from a single stationary sensor, are available only for a short time. Also, the low target detection probability and high false alarm density present a difficult low-observable environment. The algorithm uses the probabilistic data association (PDA) algorithm in conjunction with maximum likelihood (ML) estimation to handle the false alarms and the less-than-unity target detection probability. The Cramer-Rao lower bound (CRLB) in clutter, which quantifies the best achievable estimator accuracy for this problem in the presence of false alarms and nonunity detection probability, is also presented. The proposed estimator is shown to be efficient, that is, it meets the CRLB, even for low-observable fluctuating targets with 6 dB average signal-to-noise ratio (SNR). For a BM in free flight with 0.6 single-scan detection probability, one can achieve a track detection probability of 0.99 with a negligible probability of false track acceptance     

Multiple target detection using modified high order correlations

This work is concerned with the problem of multiple target track detection in heavy clutter. Using the “modified high order correlation” (HOC) process and a track scoring mechanism a new method is developed to perform data association and track identification in the presence of heavy clutter. Using this new scheme any number of very close, crossing or splitting target tracks can be resolved without increasing the computational complexity of the algorithm. The applicability of the method for continuous detection of target tracks that can originate and terminate at any scan is also demonstrated, In addition, the operating characteristics as a function of the clutter density are also provided. Simulation results on all the cases are presented     

基于相位相关的部分可辨编队精细起始算法

针对部分可辨条件下编队目标的精细起始难题,提出了一种基于相位相关的部分可辨编队精细起始算法。首先,采用基于坐标映射距离差分的快速群分割与基于编队中心点的预互联对雷达量测进行预处理;然后,利用图像匹配中相位相关特性,将相邻时刻编队结构进行补偿对准,解决了低目标发现概率情况下的编队结构对准问题;最后,采用增加虚拟量测并后验判决的方式,结合最近邻法做编队航迹精细互联,在填补航迹缺失、增加正确航迹的同时抑制虚假航迹的产生。经仿真验证,与修正的逻辑法、基于相对位置矢量的灰色编队精细起始算法相比,本文所提算法在提高航迹正确起始率、抑制虚假航迹方面性能优势显著,且对环境杂波与雷达精度具有较好的鲁棒性,对目标发现概率具有较好的适应性。     

Radar detection in clutter

Clutter is defined as any unwanted radar return. The presence of clutter in a range/Doppler cell complicates the detection of a target return signal in that cell. In order to quantify the effect of clutter on the probability of detection, we must first specify sets of models suitable for representing the clutter and target. The simplest and most common model for clutter is based on the gamma density. We include two additional models, the NCG and NCGG clutter models for low grazing angles. They are motivated by physical arguments, the latter of which can accommodate the well-known phenomenon of speckle. Using one of these models for clutter together with one of several models for targets, we determine, in a range/Doppler cell, expressions for probabilities of detection of a target in the presence of clutter. It is important to control the probability of false alarms. The presence of clutter in a cell necessitates an increase in the detection threshold setting in order to control false alarms, thus lowering the probability of detection. If the clutter level is unknown, then we need to take measurements of the clutter and use it to adjust the threshold. The more clutter samples we take, the better the estimate of the clutter level and the less is the resulting detection loss. Using the expressions for the probability of detection in clutter, we can quantify the detection loss for a pair of commonly used constant false-alarm rate (CFAR) techniques and investigate how the loss varies with different parameter values, especially with regard to the number of clutter samples taken to estimate the clutter level.     

Neural network directed Bayes decision rule for moving targetclassification

In this paper, a new neural network directed Bayes decision rule is developed for target classification exploiting the dynamic behavior of the target. The system consists of a feature extractor, a neural network directed conditional probability generator and a novel sequential Bayes classifier. The velocity and curvature sequences extracted from each track are used as the primary features. Similar to hidden Markov model scheme, several hidden states are used to train the neural network, the output of which is the conditional probability of occurring the hidden states given the observations. These conditional probabilities are then used as the inputs to the sequential Bayes classifier to make the classification. The classification results are updated recursively whenever a new scan of data is received. Simulation results on multiscan images containing heavy clutter are presented to demonstrate the effectiveness of the proposed methods     

Sequential track extraction

Sensors like radar or sonar usually produce data on the basis of a single frame of observation: target detections. The detection performance is described by quantities like detection probability Pd and false alarm density f. A different task of detection is formation of tracks of targets unknown in number from data of multiple consecutive frames of observation. This leads to quantities which are of a higher level of abstraction: extracted tracks. This again is a detection process. Under benign conditions (high Pd, low f and well separated targets) conventional methods of track initiation are recommended to solve a simple task. However, under hard conditions the process of track extraction is known to be difficult. We here concentrate on the case of well separated targets and derive an optimal combinatorial method which can be used under hard operating conditions. The method relates to MHT (multiple hypothesis tracking), uses a sequential likelihood ratio test and derives benefit from processing signal strength information. The performance of the track extraction method is described by parameters such as detection probability and false detection rate on track level, while Pd and f are input parameters which relate to the signal-to-noise interference ratio (SNIR), the clutter density, and the threshold set for target detection. In particular the average test lengths are analyzed parametrically as they are relevant for a user to estimate the time delay for track formation under hard conditions     

Detection Performance in Clutter with Variable Resolution

Experiments were conducted to determine the influence of background clutter on target detection criteria. The experiment consisted of placing observers in front of displayed images on a TV monitor. Observer ability to detect military targets embedded in simulated natural and manmade background clutter was measured when there was unlimited viewing time. Results were described in terms of detection probability versus target resolution for various signal to clutter ratios (SCR). The experiments were preceded by a search for a meaningful clutter definition. The selected definition was a statistical measure computed by averaging the standard deviation of contiguous scene cells over the whole scene. The cell size was comparable to the target size. Observer test results confirmed the expectation that the resolution required for a given detection probability was a continuum function of the clutter level. At the lower SCRs the resolution required for a high probability of detection was near 6 line pairs per target (LP/TGT), while at the higher SCRs it was found that a resolution of less than 0.25 LP/TGT would yield a high probability of detection. These results are expected to aid in target acquisition performance modeling and to lead to improved specifications for imaging automatic target screeners.     

基于SVM算法的虚假航迹识别

针对云雨杂波和主被动干扰导致多雷达传感器产生虚假目标航迹的问题,利用支持向量机(SVM)算法的自主学习能力,通过构建基于数据驱动的判别模型进行虚假航迹识别。针对航迹起始得到的目标潜在航迹,利用人工智能数据驱动、自学习的特点,设计了SVM算法。通过对已标记真假的目标航迹样本进行离线学习,形成虚假航迹识别的SVM分类器,实现了基于数据驱动的判别模型代替先验知识规则约束的固定模型,并在工程应用中,利用SVM分类器在线识别虚假航迹,完成实时剔除。通过实测雷达数据实验验证,该算法的目标虚假航迹准确率高达95%以上,完全满足实际的工程应用需求。相比基于阈值或规则进行硬性判断的传统虚假航迹识别方法,所提出的算法不仅提高了准确率,还具有较高的实时性,能够适应复杂多变的杂波环境,在实际应用中具有更强的适应性和实用性。因此,提出的基于SVM算法的虚假航迹识别方法对于密集杂波场景下的虚假航迹剔除问题具有显著的实际应用价值。     

EM-ML algorithm for track initialization using possibly noninformative data

Initializing and maintaining a track for a low observable (LO) (low SNR, low target detection probability and high false alarm rate) target can be very challenging because of the low information content of measurements. In addition, in some scenarios, target-originated measurements might not be present in many consecutive scans because of mispointing, target maneuvers, or erroneous preprocessing. That is, one might have a set of noninformative scans that could result in poor track initialization and maintenance. In this paper an algorithm based on the expectation-maximization (EM) algorithm combined with maximum likelihood (ML) estimation is presented for tracking slowly maneuvering targets in heavy clutter and possibly noninformative scans. The adaptive sliding-window EM-ML approach, which operates in batch mode, tries to reject or weight down noninformative scans using the Q-function in the M-step of the EM algorithm. It is shown that target features in the form of, for example, amplitude information (AI), can also be used to improve the estimates. In addition, performance bounds based on the supplemented EM (SEM) technique are also presented. The effectiveness of new algorithm is first demonstrated on a 78-frame long wave infrared (LWIR) data sequence consisting of an Fl Mirage fighter jet in heavy clutter. Previously, this scenario has been used as a benchmark for evaluating the performance of other track initialization algorithms. The new EM-ML estimator confirms the track by frame 20 while the ML-PDA (maximum likelihood estimator combined with probabilistic data association) algorithm, the IMM-MHT (interacting multiple model estimator combined with multiple hypothesis tracking) and the EVIM-PDA estimator previously required 28, 38, and 39 frames, respectively. The benefits of the new algorithm in terms of accuracy, early detection, and computational load are illustrated using simulated scenarios as well.     

Optimization of waveform and detection threshold for range and range-rate tracking in clutter

We address an optimization problem to obtain the combined sequence of waveform parameters (pulse amplitudes and lengths, and FM sweep rates) and detection thresholds for optimal range and range-rate tracking in clutter. The optimal combined sequence minimizes a tracking performance index under a set of parameter constraints. The performance index includes the probability of track loss and a function of estimation error covariances. The track loss probability and the error covariances are predicted using a hybrid conditional average algorithm. The effect of the false alarms and clutter interference is taken into account in the prediction. A measurement model in explicit form is also presented which is developed based on the resolution cell in the delay-Doppler plane for a single Gaussian pulse. Numerical experiments were performed to solve the optimization problem for several examples.     

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     

Integrated track splitting filter--efficient multi-scan single target tracking in clutter

A fully automatic tracking algorithm must be able to deal with an unknown number of targets, unknown target initiation and termination times, false measurements and possibly time-varying target trajectory behaviour. An efficient algorithm for tracking in this environment is presented here. This approach makes use of estimates of the probability of target existence, which is an integral part of the algorithm. This allows for the efficient generation and management of possible target hypotheses, yielding an algorithm with performance that matches what can be obtained by multiple hypothesis tracking-based approaches, but at a significantly lower computational cost. This paper considers only the single target case for clarity. The extension to multiple targets is easily incorporated into this framework. Simulation studies are given that show the effectiveness of this approach in the presence of heavy and nonuniform clutter when tracking a target in an environment of low probability of detection and in an environment where the target performs violent manoeuvres.