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     

A tracking approach for targets with measurements containingjamming or clutter signals

The concept of maneuvering target tracking which is presented by K. Demirbas, (see ibid., vol.AES-23, p.757-66, 1987) is used to track maneuvering targets whose observations contain interference representing jamming or clutter signals. The resulting tracking approach produces state estimates that closely follow the actual state values, as in target tracking in a clear environment     

Tracking of multiple maneuvering targets using multiscan JPDA and IMM filtering

The paper considers the problem of tracking multiple maneuvering targets in the presence of clutter using switching multiple target motion models. A novel suboptimal filtering algorithm is developed by applying the basic interacting multiple model (IMM) approach and the joint probabilistic data association (JPDA) technique. Unlike the standard single-scan JPDA approach, the authors exploit a multiscan joint probabilistic data association (mscan-JPDA) approach to solve the data association problem. The algorithm is illustrated via a simulation example involving tracking of four maneuvering targets and a multiscan data window of length two     

Multisensor tracking of a maneuvering target in clutter

An algorithm is presented for tracking a highly maneuvering target using two different sensors, a radar and an infrared sensor, assumed to operate in a cluttered environment. The nonparametric probabilist data association filter (PDAF) has been adapted for the multisensor (MS) case, yielding the MSPDAF. To accommodate the fact that the target can be highly maneuvering, the interacting multiple model (IMM) approach is used. The results of single-model-based filters and of the IMM/MSPDAF algorithm with two and three models are presented and compared. The IMM has been shown to be able to adapt itself to the type of motion exhibited by the target in the presence of heavy clutter. It yielded high accuracy in the absence of acceleration and kept the target in track during the high acceleration periods     

A Gaussian Mixture PHD Filter for Jump Markov System Models

The probability hypothesis density (PHD) filter is an attractive approach to tracking an unknown and time-varying number of targets in the presence of data association uncertainty, clutter, noise, and detection uncertainty. The PHD filter admits a closed-form solution for a linear Gaussian multi-target model. However, this model is not general enough to accommodate maneuvering targets that switch between several models. In this paper, we generalize the notion of linear jump Markov systems to the multiple target case to accommodate births, deaths, and switching dynamics. We then derive a closed-form solution to the PHD recursion for the proposed linear Gaussian jump Markov multi-target model. Based on this an efficient method for tracking multiple maneuvering targets that switch between a set of linear Gaussian models is developed. An analytic implementation of the PHD filter using statistical linear regression technique is also proposed for targets that switch between a set of nonlinear models. We demonstrate through simulations that the proposed PHD filters are effective in tracking multiple maneuvering targets.     

Extended solution to multiple maneuvering target tracking

An improved algorithm for tracking multiple maneuvering targets is presented. This approach is implemented with an approximate adaptive filter consisting of the one-step conditional maximum-likelihood technique together with the extended Kalman filter and an adaptive maneuvering compensator. In order to avoid the extra computational burden of considering events with negligible probability, a validation matrix is defined in the tracking structure. With this approach, data-association and target maneuvering problems can be solved simultaneously. Detailed Monte Carlo simulations of the algorithm for many tracking situations are described. Computer simulation results indicate that this approach successfully tracks multiple maneuvering targets over a wide range of conditions     

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.     

Application of Three-Dimensional Filtering to Moving Target Detection

The standard approach to the detection of a stationary target immersed within an optically observed scene is to use integration to separate the target energy from the background clutter. When the target is nonstationary and moves with fixed velocity relative to the clutter, the procedure for integrating the target signal is no longer obvious. In this paper it is shown that the problem of tracking a target having a fixed velocity can be cast into a general framework of three-dimensional filter theory. From this point of view, the target detection problem reduces to the problem of finding optimal three-dimensional filters in the three-dimensional transform domain and processing the observed scene via this filtering. The design of these filters is presented, taking into account the target, clutter, and optical detection models. Performance is computed for a basic clutter model, showing the effective increase in detectability as a function of the target velocity. The three-dimensional transform approach is readily compatible with VLSI array processing technology.     

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     

Maneuvering Target Tracking in Dense Clutter Based on Particle Filtering

An improved particle filtering(IPF) is presented to perform maneuvering target tracking in dense clutter.The proposed filter uses several efficient variance reduction methods to combat particle degeneracy,low mode prior probabilities and measure-ment-origin uncertainty.Within the framework of a hybrid state estimation,each particle samples a discrete mode from its poste-rior distribution and the continuous state variables are approximated by a multivariate Gaussian mixture that is updated by an unscented Ka...     

Minimal submodel-set algorithm for maneuvering target tracking

The variable structure multiple model (VSMM) approach to the maneuvering target tracking problem is considered. A new VSMM design, the minimal submodel-set switching (MSMSS) algorithm for tracking a maneuvering target is presented. The MSMSS algorithm adaptively determines the minimal set of models from the total model set and uses this to perform multiple models (MM) estimation. In addition, an iterative MSMSS algorithm with improved maneuver detection and termination properties is developed. Simulations results demonstrate that, compared with a standard interacting MM (IMM), the proposed algorithms require significantly lower computation while maintaining similar tracking performance. Alternatively, for a computational load similar to IMM, the new algorithms display significantly improved performance.     

Filtering of moving targets using SBIR sequential frames

In this paper three-dimensional (3-D) finite-impulse response (FIR) filters are proposed for moving target detection and tracking from multiframe space-based infrared (SBIR) data. An optimal, in the l_p sense, 3-D FIR filter design technique is proposed which is suitable for the above application. This technique is the first 3-D FIR design of its kind presented in the open literature. Directional, matched, and adaptive 3-D filtering techniques are proposed. Prior to the filtering, clutter mean estimation and mean subtraction are required. Real time implementation of directional and/or matched filters for processing maneuvering targets is discussed and filter design methods are proposed. Finally, performance comparisons of the proposed and other available 3-D FIR and infinite-impulse response (IIR) filters, on real SBIR data, are presented in which the advantages of the proposed 3-D filters are shown     

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     

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.     

Survey of maneuvering target tracking. Part V. Multiple-model methods

This is the fifth part of a series of papers that provide a comprehensive survey of techniques for tracking maneuvering targets without addressing the so-called measurement-origin uncertainty. Part I and Part II deal with target motion models. Part III covers measurement models and associated techniques. Part IV is concerned with tracking techniques that are based on decisions regarding target maneuvers. This part surveys the multiple-model methods $the use of multiple models (and filters) simultaneously - which is the prevailing approach to maneuvering target tracking in recent years. The survey is presented in a structured way, centered around three generations of algorithms: autonomous, cooperating, and variable structure. It emphasizes the underpinning of each algorithm and covers various issues in algorithm design, application, and performance.     

Data fusion and tracking using HMMs in a distributed sensor network

This work deals with the problem of multiple target tracking, from the measurements made on a field of passive sonars activated by an active sonar (multistatic network). The difficulties encountered then are of two kinds: each sensor alone does not provide full observability of a target, and multiple, possibly maneuvering targets moving in a cluttered environment must be dealt with. The algorithm presented here is based on a discrete Markovian modelization of the targets evolution in time. It starts with a fusion of the detections obtained at each measurement time. Tracking and target motion analysis (TMA) are next achieved thanks to dynamic programming (DP). This approach leads to multiple and maneuvering target tracking, with few assumptions; for instance, the use of deterministic target state models are avoided. Simulation results are presented and discussed.     

基于先验门限优化准则的探测阈值自适应选择

针对 2维测量和 4 -sigma确认门 ,把先验检测门限优化准则和修正 Riccati方程的解析近似表示相结合 ,得到了在瑞利起伏环境下使跟踪性能优化的信号探测阈值解析表示式 ,从而使在线求解自适应信号探测阈值能比较容易地实现。通过研究和仿真发现 :在滤波稳定阶段 ,本文给出的自适应信号检测门限方法的跟踪性能优于固定虚警率方法的跟踪性能 ;基于先验检测门限优化准则实现检测 -跟踪的联合优化要求信噪比要大于一定的门限 ,在瑞利起伏环境下 ,对 2维测量和 4 -sigma确认门 ,该门限为 1 .57     

一种新的基于机动检测的机动目标跟踪算法

针对Kalman滤波跟踪机动目标发散和目前多数自适应Kalman滤波算法对运动模型适应性不强的问题,提出了一种新的基于机动检测的机动目标跟踪算法,通过实时自适应的改变滤波模型提高对机动目标跟踪精度。对这种方法与Kalman滤波算法进行了计算机仿真比较,结果表明,该方法计算量小,可实时精确地自适应匹配目标的运动模型,可实现对机动目标稳定可靠的跟踪。