Bearings-only tracking of maneuvering targets using abatch-recursive estimator

We present a new batch-recursive estimator for tracking maneuvering targets from bearings-only measurements in clutter (i.e., for low signal-to-noise ratio (SNR) targets), Standard recursive estimators like the extended Kalman Iter (EKF) suffer from poor convergence and erratic behavior due to the lack of initial target range information, On the other hand, batch estimators cannot handle target maneuvers. In order to rectify these shortcomings, we combine the batch maximum likelihood-probabilistic data association (ML-PDA) estimator with the recursive interacting multiple model (IMM) estimator with probabilistic data association (PDA) to result in better track initialization as well as track maintenance results in the presence of clutter. It is also demonstrated how the batch-recursive estimator can be used for adaptive decisions for ownship maneuvers based on the target state estimation to enhance the target observability. The tracking algorithm is shown to be effective for targets with 8 dB SNR     

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.     

遗传算法在低信噪比图象点目标检测中的应用

将遗传算法用于图象中低信噪比点目标的检测。在分析了点目标及背景特点的基础上,设计了编码方案及遗传操作算子,提出了合格个体保留法。仿真结果表明应用此算法,可实现信噪比为2dB的点目标的检测与跟踪。     

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.     

Radar power multiplier for acquisition of low observables using anESA radar

In this paper the acquisition of a low observable (LO) incoming tactical ballistic missile using the measurements from a surface based electronically scanned array (ESA) radar is presented. We present a batch maximum likelihood (ML) estimator to acquire the missile while it is exo-atmospheric. The proposed estimator, which combines ML estimation with the probabilistic data association (PDA) approach resulting in the ML-PDA algorithm to handle false alarms, also uses target features. The use of features facilitates target acquisition under low signal-to-noise ratio (SNR) conditions. Typically, ESA radars operate at 13-20 dB, whereas the new estimator is shown to be effective even at 4 dB SNR (in a resolution cell, at the end of the signal processing chain) for a Swerling III fluctuating target, which represents a significant counter-stealth capability. That is, this algorithm acts as an effective “power multiplier” for the radar by about an order of magnitude. An approximate Cramer-Rao lower bound (CRLB), quantifying the attainable estimation accuracies and shown to be met by the proposed estimator, is derived as well     

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     

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.     

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     

Peformance of dynamic programming techniques forTrack-Before-Detect

“Track-Before-Detect” (TBD) is a target tracking technique where no threshold is applied at each measurement frame. Instead, data are processed over a number of frames before decisions on target existence are made. The track is returned simultaneously with the detection. A simple algorithm is presented and demonstrated via simulations. A detailed analysis enables detection and tracking performance to be predicted for particular algorithm parameters. Good performance is observed at low signal-to-noise ratio (SNR), with rapid degradation as SNR is reduced further. For some cases the detection performance does not improve regardless of how many frames of data are processed. Tracking performance may also be poor even though detection performance is good     

Multitarget tracking using the joint multitarget probability density

This work addresses the problem of tracking multiple moving targets by recursively estimating the joint multitarget probability density (JMPD). Estimation of the JMPD is done in a Bayesian framework and provides a method for tracking multiple targets which allows nonlinear target motion and measurement to state coupling as well as nonGaussian target state densities. The JMPD technique simultaneously estimates both the target states and the number of targets in the surveillance region based on the set of measurements made. We give an implementation of the JMPD method based on particle filtering techniques and provide an adaptive sampling scheme which explicitly models the multitarget nature of the problem. We show that this implementation of the JMPD technique provides a natural way to track a collection of targets, is computationally tractable, and performs well under difficult conditions such as target crossing, convoy movement, and low measurement signal-to-noise ratio (SNR).     

A novel variable-lag probability hypothesis density smoother for multi-target tracking

It is understood that the forward-backward probability hypothesis density (PHD) smoothing algorithms proposed recently can significantly improve state estimation of targets. However, our analyses in this paper show that they cannot give a good cardinality (i.e., the number of targets) estimate. This is because backward smoothing ignores the effect of temporary track drop- ping caused by forward filtering and/or anomalous smoothing resulted from deaths of targets. To cope with such a problem, a novel PHD smoothing algorithm, called the variable-lag PHD smoother, in which a detection process used to identify whether the filtered cardinality varies within the smooth lag is added before backward smoothing, is developed here. The analytical results show that the proposed smoother can almost eliminate the influences of temporary track dropping and anomalous smoothing, while both the cardinality and the state estimations can significantly be improved. Simulation results on two multi-target tracking scenarios verify the effectiveness of the proposed smoother.     

Low observable target motion analysis using amplitude information

In conventional passive and active sonar system, target amplitude information (AI) at the output of the signal processor is used only to declare detections and provide measurements. We show that the AI can be used in passive sonar system, with or without frequency measurements, in the estimation process itself to enhance the performance in the presence of clutter where the target-originated measurements cannot be identified with certainty, i.e., for “low observable” or “dim” (low signal-to-noise ratio (SNR)) targets. A probabilistic data association (PDA) based maximum likelihood (ML) estimator for target motion analysis (TMA) that uses amplitude information is derived. A track formation algorithm and the Cramer-Rao lower bound (CRLB) in the presence of false measurements, which is met by the estimator even under low SNR conditions, are also given. The CRLB is met by the proposed estimator even at 6 dB in a cell (which corresponds to 0 dB for 1 Hz bandwidth in the case of a 0.25 Hz frequency cell) whereas the estimator without AI works only down to 9 dB. Results demonstrate improved accuracy and superior global convergence when compared with the estimator without AI. The same methodology can be used for bistatic radar     

基于模板匹配的集中式多传感器群内目标精细跟踪算法

为解决多传感器探测下群内目标精细跟踪的难题,基于非机动情况下各探测周期内群内目标真实回波位置相对固定的特性,提出了一种基于模板匹配的集中式多传感器群内目标精细跟踪算法。该算法通过预关联成功的群状态集合与群量测集合分别建立模板形状矩阵和待匹配形状矩阵,利用匹配搜索模型和匹配矩阵确认规则选出代价最小的匹配矩阵,并基于模板和对应的匹配矩阵利用 kalman滤波完成群内各目标航迹的状态更新。仿真表明,与传统多传感器多目标跟踪算法中性能优越的基于数据压缩的集中式多传感器多假设算法相比,该算法在跟踪精度、实时性、有效跟踪率方面的性能明显优越,能很好的满足群内目标精细跟踪的实际工程需求。     

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     

Multi-target state estimation and track continuity for the particle PHD filter

Particle filter approaches for approximating the first-order moment of a joint, or probability hypothesis density (PHD), have demonstrated a feasible suboptimal method for tracking a time-varying number of targets in real-time. We consider two techniques for estimating the target states at each iteration, namely k-means clustering and mixture modelling via the expectation-maximization (EM) algorithm. We present novel techniques for associating the targets between frames to enable track continuity.     

On joint track initiation and parameter estimation under measurement origin uncertainty

The problem of joint detection and estimation for track initiation under measurement origin uncertainty is studied. The two well-known approaches, namely the maximum likelihood estimator with probabilistic data association (ML-PDA) and the multiple hypotheses tracking (MHT) via multiframe assignment, are characterized as special cases of the generalized likelihood ratio test (GLRT) and their performance limits indicated. A new detection scheme based on the optimal gating is proposed and the associated parameter estimation scheme modified within the ML-PDA framework. A simplified example shows the effectiveness of the new algorithm in detection performance under heavy clutter. Extension of the results to state estimation with measurement origin uncertainty is also discussed with emphasis on joint detection and recursive state estimation.     

一种基于模糊遗传算法的多传感器多目标跟踪数据关联算法

基于模糊遗传算法发展了一种新的数据关联算法。数据关联的静态部分靠一个模糊遗传算法来得出量测组合序列和S-D分配的m个最优解。在数据关联的动态部分，将得到的S-D分配的m个最优解在一个基于多种群模糊遗传算法的动态2D分配算法中依靠一个卡尔曼滤波估计器估计出移动目标各个时刻的状态。这一基于分配的数据关联算法的仿真试验内容为被动式传感器的航迹形成和维持的问题。仿真试验的结果表明该算法在多传感器多目标跟踪中应用的可行性。另外，对算法发展和实时性问题进行了简单讨论。     

Multisensor covariance control strategies for reducing bias effects in interacting target scenarios

Algorithms are presented for managing sensor information to reduce the effects of bias when tracking interacting targets. When targets are close enough together that their measurement validation gates overlap, the measurement from one target can be confused with another. Data association algorithms such as the joint probabilistic data association (JPDA) algorithm can effectively continue to track targets under these conditions, but the target estimates may become biased. A modification of the covariance control approach for sensor management can reduce this effect. Sensors are chosen based on their ability to reduce the extent of measurement gate overlap as judged by a set of heuristic parameters derived in this work. Monte Carlo simulation results show that these are effective methods of reducing target estimate bias in the JPDA algorithm when targets are close together. An analysis of the computational demands of these algorithms shows that while they are computationally demanding, they are not prohibitively so.