一种基于新三维随机Hough变换的航迹起始算法

针对雷达跟踪多目标时,目标点迹受杂波、噪声等因素影响,航迹起始难度大的问题,利用三维空间直线表示方法提出了一种4参数三维Hough变换算法.该算法是对传统二维Hough变换的拓展,它结合了传统的二维随机Hough变换理论,是一种新的三维随机Hough变换算法.通过该算法对理论数据和实测数据进行验证,结果表明,对于航迹区别较大的目标,该算法的航迹起始成功概率为98.5％;对于空间航迹相近的目标,该算法可成功将目标航迹从杂波中提取出来,虽然可能会出现航迹混淆,但利用目标先验信息可解决该问题,实现航迹起始.     

非合作目标动态RCS仿真方法

针对非合作目标难以开展动态测量的问题,根据空气动力学原理提出了一种非合作目标动态雷达散射截面（RCS）仿真方法。该方法首先建立测量背景下典型飞行航路模型,然后计算雷达视线在机体坐标系上的时变姿态角。根据姿态角开展电磁计算,获得F-117A隐身攻击机在侧站平飞、背站拉起、对站俯冲、侧站盘旋4种航路下的动态RCS数据。着重分析了动、静态RCS特性在起伏目标检测性能评估上的差异。结果表明：静态RCS特性难以反映目标运动时真实的雷达特性,利用静态数据描述目标特性可能导致错误结论,而文中方法获取的动态RCS数据可以提高结论的完整性和可信度。     

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.     

Bayesian tracking of two possibly unresolved maneuvering targets

The paper studies the problem of maintaining tracks of two targets that may maneuver in and out formation flight, whereas the sensor and measurement extraction chain produces false and possibly unresolved or missing measurements. If the possibility of unresolved measurements is not modelled then it is quite likely that either the two tracks coalesce or that one of the two tracks diverges on false measurements. In literature a robust measurement resolution model has been incorporated within an interacting multiple model/multiple hypothesis tracking (IMM/MHT) track maintenance setting. A straightforward incorporation of the same model within an IMM and probabilistic data association (PDA)-like hypothesis merging approach suffers from track coalescence. In order to improve this situation, the paper develops a track-coalescence avoiding hypotheses merging version for the two target problem considered. Through Monte Carlo simulations, the novel filters are compared with applying hypotheses merging approaches that ignore the possibility of unresolved measurements or track-coalescence.     

Effectiveness of track monitoring with multiple 2D passive sensors

An analytical technique is presented which can be used to evaluate the effectiveness of the track monitoring scheme presented by J.A. Roecker (see ibid., vol.27, no.6, p.872-6, Nov. 1991) in detecting false track-to-track (ghost track) assignments without the use of simulations. It is shown that when two tracks are traveling in parallel and in the direction of the inclination angle, it is impossible to determine which tracks to associate. However, track monitoring is effective under all other circumstances. A tracking algorithm designer can use this technique to determine the length of time before track-to-track initiation for good ghost track rejection. This technique also determines the probability of accepting ghost tracks during mature track monitoring.<>     

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     

Analysis of Some Modified Cell-Averaging CFAR Processors in Multiple-Target Situations

A serious degradation of detection probability (Pd) in a cellaverging constant false alarm rate (CA-CFAR) detector is known to be caused by the presence of an interfering target in the set of reference cells. A technique which is often used to prevent excessive false alarms at clutter ?edges? is a ?greatest of? (GO) selection between the leading and lagging sets of cells (GO-CFAR). However, it is demonstrated for a Rayleigh target that the abovementioned suppression effect is more acute in the GO-CFAR. Practically, detection of closely separated targets is almost inhibited. Selection of the ?smallest of? (SO) the means for the adaptive threshold has been proposed to alleviate this problem. An analytic expression for Pd of this detector is also derived, and it is shown that though it does prevent the suppression effect, a large sensitivity loss is introduced unless the number of reference cells is sufficiently large. A modified CO-CFAR detector, combining a ?censoring? circuit, is proposed for automatic detection in a complex nonhomogeneous environment.     

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

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

A multi-frame track-before-detect algorithm based on root label clustering for multiple targets

In this paper, a novel multi-frame track-before-detect algorithm is proposed, which is based on root label clustering to reduce the high computational complexity arising by observation area expansion and clutter/noise density increase. A criterion of track extrapolation is used to construct state transition set, root label is marked by state transition set to obtain the distribution information of multiple targets in measurement space, then measurement plots of multi-frame are divided into sever...     

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.     

一种改进的直方图概率多假设多目标跟踪方法

直方图概率多假设跟踪（H-PMHT）方法及其变形泊松分布直方图概率多假设跟踪（P-HPMHT）方法的一个主要缺点是其量测模型仅考虑了背景杂波而没有考虑传感器噪声,从而导致在低信噪比条件下检测概率较低。针对这一问题,提出了一种带传感器噪声模型的H-PMHT方法,通过将传感器噪声引入量测模型,从而明显提高了对低信噪比目标的跟踪检测能力。该方法的计算量与目标数保持线性关系,仍然适用于目标数目较多的情况。仿真实验表明：该方法在误跟踪比率为1‰,信噪比为6 dB时,检测比率可提升近20%,信噪比为3 dB时,可提升近10%。     

OS-CFAR theory for multiple targets and nonuniform clutter

The performance of a cell averaging constant false-alarm rate (CA-CFAR) detector degrades rapidly in nonideal conditions caused by multiple targets and nonuniform clutter. The ordered-statistic CFAR (OS-CFAR) is an alternative to the CA-CFAR. The OS-CFAR trades a small loss in detection performance relative to the CA-CFAR in ideal conditions for much less performance degradation in nonideal conditions. A formula is given for the detection probability of the OS-CFAR when there are multiple Swerling I targets in the CFAR window, and a formula is given for the probability of false alarm in nonuniform Raleigh clutter     

Searching tracks

Search theory is the discipline that studies the problem of how best to search for an object when the amount of searching efforts is limited and only probabilities of the possible position of the object are given. Then, the problem is to find the optimal distribution of this total effort that maximizes the probability of detection. Although the general formalism of search theory will be used subsequently, we consider now a radically different problem. The problem is to detect target tracks. In the "classical" search theory, the target is said detected if a detection occurs during any time of the time frame. Here, on the contrary, the target track will be said to be detected if elementary detections occur at various times. That means that there is a test for acceptance (or detection) of a target track and that the problem is to optimize the allocation of the search effort for track detection. So, specific optimization problems are solved by means of the primal-dual formalism, in an original setup. Other aspects concern Markovian targets and two-sided search for which simple and efficient algorithms are derived.     

Track segment association, fine-step IMM and initialization with Doppler for improved track performance

In this work we present a new track segment association technique to improve track continuity in large-scale target tracking problems where track breakages are common. A representative airborne early warning (AEW) system scenario, which is a challenging environment due to highly maneuvering targets, close target formations, large measurement errors, long sampling intervals, and low detection probabilities, provides the motivation for the new technique. Previously, a tracker using the interacting multiple model (IMM) estimator combined with an assignment algorithm was shown to be more reliable than a conventional Kalman filter based approach in tracking similar targets but it still yielded track breakages due to the difficult environment. In order to combine the broken track segments and improve track continuity, a new track segment association algorithm using a discrete optimization approach is presented. Simulation results show that track segment association yields significant improvements in mean track life as well as in position, speed, and course rms errors. Also presented is a modified one-point initialization technique with range rate measurements, which are typically ignored by other initialization techniques, and a fine-step IMM estimator, which improves performance in the presence of long revisit intervals. Another aspect that is investigated is the benefit of "deep" (multiframe or N-dimensional, with N > 2) association, which is shown to yield significant benefit in reducing the number of false tracks.     

Data Association and Track Management for the Gaussian Mixture Probability Hypothesis Density Filter

The Gaussian mixture probability hypothesis density (GM-PHD) recursion is a closed-form solution to the probability hypothesis density (PHD) recursion, which was proposed for jointly estimating the time-varying number of targets and their states from a sequence of noisy measurement sets in the presence of data association uncertainty, clutter, and miss-detection. However the GM-PHD filter does not provide identities of individual target state estimates, that are needed to construct tracks of individual targets. In this paper, we propose a new multi-target tracker based on the GM-PHD filter, which gives the association amongst state estimates of targets over time and provides track labels. Various issues regarding initiating, propagating and terminating tracks are discussed. Furthermore, we also propose a technique for resolving identities of targets in close proximity, which the PHD filter is unable to do on its own.     

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

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

无先验信息的低轨空间目标航迹起始方法

针对光学观测中缺乏预报信息的低轨道空间目标自动识别捕获问题,提出一种基于修正Hough变换的空间目标航迹起始方法,从而实现空间目标的自动识别。首先利用背景恒星运动规律对观测数据进行预处理,剔除大部分背景恒星。再利用观测数据的时序信息、定向参数进行Hough变换。本方法并没有采用传统的Hough变换对所有参数空间中的数据点进行投票,而是仅对参数空间中部分点投票,可以大幅减少运算量和存储量。试验表明:该方法能够有效地抑制背景恒星产生的虚假航迹,并快速准确地完成无先验信息的低轨道空间目标的航迹起始;可以在光学观测中实现空间目标的自动识别捕获,以及实时发现新目标,这为低轨道空间目标光学观测的无人值守和联网观测奠定了技术基础。     

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

Multi-Target Tracking in Clutter without Measurement Assignment

When tracking targets using radars and sonars, the number of targets and the origin of data is uncertain. Data may be false measurements or clutter, or they may be detections from an unknown number of targets whose possible trajectories and detection processes can only be described in a statistical manner. Optimal all-neighbor multi-target tracking (MTT) in clutter enumerates all possible joint measurement-to-track assignments and calculates the a posteriori probabilities of each of these joint assignments. The numerical complexity of this process is combinatorial in the number of tracks and the number of measurements. One of the key differences between most MTT algorithms is the manner in which they reduce the computational complexity of the joint measurement-to-track assignment process. We propose an alternative approach, using a form of soft assignment, that enables us to bypass this step entirely. Specifically, our approach treats possible detections of targets followed by other tracks as additional clutter measurements. It starts by approximating the a~priori probabilities of measurement origin. These probabilities are then used to modify the clutter spatial density at the location of the measurements. A suitable single target tracking (STT) filter then uses the modified clutter intensity for updating the track state. In effect, the STT filter is transformed into an MTT filter with a numerical complexity that is linear in the number of tracks and the number of measurements. Simulations show the effectiveness of this approach in a number of different multi-target scenarios.