基于相对位置矢量的群目标灰色精细航迹起始算法

为解决群内目标精细航迹起始的难题,基于对传统航迹起始算法及现有群目标航迹起始算法优缺点的分析,给出了完整的群目标航迹起始框架,并提出了一种基于相对位置矢量的群目标灰色精细航迹起始算法。首先基于循环阈值模型、群中心点进行群的预分割、预关联,然后对预关联成功的群搜索对应坐标系,建立群中各量测的相对位置矢量,基于灰色精细互联模型完成群内量测的互联,最后基于航迹确认规则得到群目标状态矩阵。经仿真数据验证,与修正的逻辑法、基于聚类和Hough变换的多编队航迹起始算法相比,该算法在起始真实航迹、抑制虚假航迹及杂波鲁棒性等方面综合性能更优。     

纯方位二维目标跟踪的航迹起始算法

 针对传统航迹起始算法在纯方位目标定位和跟踪系统应用中存在的弊端,提出了一种完全基于角度量测的快速航迹起始算法。该方法通过深入分析目标在角度坐标下的运动特性,给出了全新的关联门构造方法。该波门技术有效提高了纯方位二维目标真实量测的确认效率,极大限制了虚假航迹随密集杂波的扩张。利用此波门,通过基于逻辑的方法对仅有角度量测的目标航迹进行扩展。该方法有效地解决了角度坐标系下机动目标的航迹起始分辨率下降的问题,为基于单个被动传感器纯方位跟踪系统进行快速、准确的航迹起始提供了新的思路。仿真结果及实际应用表明了此算法的有效性和实用性。     

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     

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     

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

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

Clutter map information for data association and track initialization

This paper considers the problem of forming and maintaining tracks when measurements have both uncertain origin and are corrupted by additive sensor noise. The spatial clutter measurement density is assumed nonhomogeneous and known. The PPDA-MAP algorithm provides a set of recursive formulae for data association and probability of target existence, thus enabling automatic track initiation, track maintenance, and track termination. New values for initial probability of target existence for IPDA-type algorithm are also derived. Simulation results compare the performance of IPDA-MAP with IPDA, IMM-PDA, IMM-PDA-MAP, EB-PDA and EB-PDA-MAP in a heavy and nonuniform clutter situation.     

New assignment-based data association for tracking move-stop-move targets

We present a new assignment-based algorithm for data association in tracking ground targets employing evasive move-stop-move maneuvers using ground moving target indicator (GMTI) reports obtained from an airborne sensor. To avoid detection by the GMTI sensor, the targets deliberately stop for some time before moving again. The sensor does not detect a target when the latter's radial velocity (along the line-of-sight from the sensor) falls below a certain minimum detectable velocity (MDV). Even in the absence of move-stop-move maneuvers, the detection has a less-than-unity probability (P/sub D/<1) due to obscuration and thresholding. Then, it is of interest, when a target is not detected, to develop a systematic technique that can distinguish between lack of detection due to P/sub D/<1 and lack of detection due to a stop (or a near stop). Previously, this problem was solved using a variable structure interacting multiple model (VS-IMM) estimator with a stopped target model (VS-IMM-ST) without explicitly addressing data association. We develop a novel "two-dummy" assignment approach for move-stop-move targets that considers both the problem of data association as well as filtering. Typically, in assignment-based data association a "dummy" measurement is used to denote the nondetection event. The use of the standard single-dummy assignment, which does not handle move-stop-move motion explicitly, can result in broken tracks. The new algorithm proposed here handles the evasive move-stop-move motion by introducing a second dummy measurement to represent nondetection due to the MDV. We also present a likelihood-ratio-based track deletion scheme for move-stop-move targets. Using this two-dummy data association algorithm, the track corresponding to a move-stop-move target is kept "alive' during missed detections both due to MDV and due to P/sub D/<1. In addition, one can obtain reductions in both rms estimation errors as well as the total number of track breakages.     

Suboptimal joint probabilistic data association

A significant 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 terminate. Prior methods for this data association problem include various optimal and suboptimal two-dimensional assignment algorithms which make hit-to-track associations. Another method is to assign a weight for the reasonable hits and use a weighted centroid of those hits to update the track. The method of weighting the hits is known as joint probabilistic data association (JPDA). The authors review the JPDA approach and a simple ad hoc approximation and then introduce a new suboptimal JPDA algorithm. Examples which compare an optimal two-dimensional assignment algorithm with the ad hoc and the new suboptimal JPDA formulation are given     

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

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

基于运动状态的航迹起始算法研究

 针对传统的基于逻辑的航迹起始方法在量测扩展过程中存在的弊端，提出了基于目标运动状态的航迹起始算法，并给出了更为精确的起始波门构造方法。利用目标的位置信息形成候选目标航迹，在候选目标航迹扩展过程中，采用提出的修正Hough变换提取目标状态信息，并根据目标〖JP2〗的状态信息对候选航迹进行检验。仿真结果表明，该算法比其他基于逻辑的方法有更低的虚警概率，并且对存储空间要求低，适于工程应用。     

多局部节点异步抗差航迹关联算法

为解决航迹异步与系统误差并存情况下的多局部节点航迹关联问题,提出一种基于区间序列离散度的多局部节点异步抗差航迹关联算法。定义区间型数据集的离散信息度量,给出系统误差下航迹序列区间化方法,通过累次积分计算离散度,结合多维分配进行关联判定。针对多局部节点上报目标不完全一致现象,设置零号航迹管理关联质量。与传统算法相比,无需时域配准,可在系统误差下对异步航迹直接关联。仿真结果表明,算法能在局部节点上报目标不完全一致场景下实现有效关联,且正确关联率随局部节点数目的增加或目标密集程度的增大而提高。     

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     

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     

Multiple scan joint probabilistic data association

This paper presents a multiple scan or n-scan-back joint probabilistic data association (JPDA) algorithm which addresses the problem of measurement-to-track data association in a multiple target and clutter environment. The standard single scan JPDA algorithm updates a track with weighted sum of the measurements which could have reasonably originated from the target in track. The only information the standard JPDA algorithm uses is the measurements on the present scan and the state vectors and covariance matrices of the present targets. The n-scan-back algorithm presented here uses multiple scans of measurements along with the present target information to produce better weights for data association. The standard JPDA algorithm can utilize a formidable amount of processing power and the n-scan-back version only worsens the problem. Therefore, along with the algorithm presentation, implementations which make this algorithm practical are discussed and referenced. An example is also shown for a few n-scan-back window lengths     

基于数据关联的故障快速检测

 多数情况下,快速实时地进行故障检测是很重要的。将故障看做是通过多传感器观测的动态模型,进行多传感器多模型概率数据关联,以各个模型的关联结果和设定的阈值为依据,可以有效地实现故障检测。联合概率数据关联（JPDA）算法是解决多传感器多目标跟踪的一个有效方法,文中通过分析概率数据关联算法,对联合概率数据关联算法进行了改进：（1）通过正确地选择阈值,移除小概率事件,进而建立一个近似的确认矩阵;（2）根据被跟踪目标故障跟踪门的相交情况,将跟踪空间进行数学划分,形成若干相互独立的区域;（3）对同一区域内公共有效量测的概率密度值进行衰减,计算出关联概率。仿真对比表明,本文的改进算法能显著减少计算时间,有效提高故障检测的快速性和实时性。     

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.     

Automatic detection and tracking of a small surface watercraft in shallow water using a high-frequency active sonar

A high-frequency (HF) active sonar can be used to detect and track a small fast surface watercraft in shallow water based on the evolution of the watercraft wake observed in the sonar image sequence. An automatic detection and tracking (ADT) algorithm is described for this novel application. For each ping, the measurement of the target's polar position consists of 2 steps. First, the target bearing is estimated by finding the direction of arrival of the cavitation noise emitted by the watercraft. Then range measurements are extracted from the range profile (constant-angle cut of the sonar image) at the estimated target bearing. Range normalization and clutter map processing are used to reduce the number of false measurements. Estimates of the target's Cartesian position and velocity are updated at the sonar pulse repetition rate using the Kalman filter with debiased consistent converted measurements and nearest neighbour data association. The proposed algorithm is demonstrated using real data.     

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.     

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