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     

Modeling and parameter optimization of agile beam radar tracking

In the work presented here, we address parameter optimization for agile beam radar tracking to minimize the radar resources that are required to maintain a target under track. The parameters to be optimized include the track-revisit interval as well as the sequence of pairs of target signal strengths and detection thresholds associated with successive illumination attempts in each track-revisit. The effects of false alarms and clutter interference are taken into account in the modeling of target detection and in the characterization of tracking performance. Based on the detection model and tracker characterization, the parameter optimization problem is formulated. Typical examples of the optimization problem are numerically solved. The optimal solution gives an off-line scheduling of the parameter set. It also provides insight into the selection of a near-optimal parameter set that is appropriate for real-time implementation.     

Detection threshold selection for tracking performance optimization

A technique for the evaluation of the track loss probability and the estimation error during track maintenance in clutter has been developed recently by the authors. This work overcomes the limitation of an earlier technique that does not handle the transient process of tracking divergence. Track loss, being a “runaway” phenomenon, clearly requires transient evaluation capability. The new technique provides, without the need for expensive Monte Carlo simulations, the probability that a hack is maintained in the presence of all sources of uncertainty encountered In a tracking process. This technique is of a hybrid nature; it involves explicit probabilistic accounting of both the continuous and the discrete uncertainties. Here it is demonstrated how this technique can be used for the selection of the detection threshold to optimize the overall performance of a detection-trading system     

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

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

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.     

基于量测一致性的分布式多传感器多目标跟踪算法

针对无线传感器网络跟踪多目标过程中传感器能搭载的计算负荷有限,不宜采用复杂算法实现数据处理的问题,提出了一种基于量测一致性的分布式多传感器多目标跟踪算法。算法采用计算相对简易的最近邻域法处理多目标跟踪中的数据互联问题,针对最近邻域法容易受杂波干扰的情况,通过量测的平均一致性迭代来改进算法的性能。仿真结果证明,算法具备有效抑制因误判产生的错误量测对跟踪过程干扰的性能,实现了良好的传感器网络跟踪精度和估计信息一致性。     

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.     

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     

NONLINEAR PREDICTIVE CONTROL FOR TERRAIN FOLLOWING

ＮＯＮＬＩＮＥＡＲＰＲＥＤＩＣＴＩＶＥＣＯＮＴＲＯＬＦＯＲＴＥＲＲＡＩＮＦＯＬＬＯＷＩＮＧＣｕｉＨｕｔａｏ（崔祜涛），ＧｅｎｇＹｕｎｈａｉ（耿云海），ＹａｎｇＤｉ（杨涤）（ＨａｒｂｉｎＩｎｓｔｉｔｕｔｅｏｆＴｅｃｈｎｏｌｏｇｙ，Ｐ．Ｏ．Ｂｏｘ１３７，...     

密集杂波背景下的水下多目标跟踪方法

水下多目标跟踪是水声信号处理领域研究的热点和难点问题。高斯混合概率假设密度(Gaussian mixture probability hypothesis density, GM-PHD)滤波器以其高效的计算效率为解决水下多目标跟踪问题提供了保证。然而,GM-PHD滤波器在跟踪目标时需要先验已知新生目标的强度,否则其性能会出现严重退化。针对该问题,提出一种滑动窗两步初始化高斯混合概率假设密度(sliding window two step initialization GM-PHD, SWTSI-GMPHD)滤波器。将提出的滑动窗两步初始化方法嵌入GM-PHD滤波器,利用滑动窗两步初始化方法估计新生目标强度,减少杂波干扰导致跟踪结果中出现的虚假目标。仿真实验表明,在杂波密集环境下,相较于其他跟踪方法,提出方法将跟踪精度提高69.84%,52.62%和41.05%。     

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     

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     

Waveform selective probabilistic data association

An adaptive, waveform selective probabilistic data association (WSPDA) algorithm for tracking a single target in clutter is presented. The assumption of an optimal receiver allows the inclusion of transmitted waveform specification parameters in the tracking subsystem equations, leading to a waveform selection scheme where the next transmitted waveform parameters are selected so as to minimize the average total mean-square tracking error at the next time step. Semiclosed form solutions are given to the local (one-step-ahead) adaptive waveform selection problem for the case of one-dimensional target motion. A simple simulation example is given to compare the performance of a tracking system using a WSFDA based tracking filter with that of a conventional system with a fixed waveform shape and probabilistic data association (PDA) tracking filter.     

基于改进多元优化算法的动态路径规划

为满足动态路径规划实时性强和动态跟踪精度高的需求,提出一种基于能够同时发现并追踪多条最优以及次优路径的改进多元优化算法(IMOA)的求解方法。首先,通过利用贝赛尔曲线描述路径的方法把动态路径规划问题转化为动态优化问题;然后,把相似性检测操作引入到多元优化算法(MOA)中,增加算法同时跟踪多个不同最优以及次优解的概率;最后,用IMOA对贝赛尔曲线的控制点进行寻优。实验结果表明:当最优路径由于环境变化而变为非优或者不可行时,利用IMOA对多个最优以及次优解动态跟踪的特点,能够快速调整寻优策略对其他次优路径进行寻优以期望再次找到最优路径;其综合离线性能较其他方法也有一定的提高。因此,IMOA满足动态路径规划的实际需求,适用于解决动态环境中的路径规划问题。     

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.     

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     

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     

The Tracking Index: A Generalized Parameter for ? ? ? and ? ? ? ? Target Trackers

A generalized, optimal filtering solution is presented for the target tracking problem. Applying optimal filtering theory to the target tracking problem, the tracking index, a generalized parameter proportional to the ratio of the position uncertainty due to the target maneuverability to that due to the sensor measurement, is found to have a fundamental role not only in the optimal steady-state solution of the stochastic regulation tracking problem, but also in the track initiation process. Depending on the order of the tracking model, the tracking index solution yields a closed form, consistent set of generalized tracking gains, relationships, and performances. Using the tracking index parameter, an initializing and tracking procedure in recursive form, realizes the accuracy of the Kalman filter with an algorithm as simple as the well-known ? ? ? filter or ? ? ? ? ? filter depending on the tracking order.     

Tracking of Spawning Targets with Multiple Finite Resolution Sensors

In this paper the problem of tracking multiple spawning targets with multiple finite-resolution sensors is considered and a new algorithm for measurement-to-track association with possibly unresolved measurements is presented. The goal is to initialize new tracks of spawned targets before they are resolved from the mother platform so that one has the ability to carry out early discrimination when they become resolved. The multiple scan data association problem is first formulated as a multidimensional assignment problem with explicit new constraints for the unresolved measurements. Then the top M hypotheses tracking (TMHT) is presented where the state estimates and their covariances are modified based on the M best hypotheses through the assignment solutions. A modification to the assignment problem is developed that leads to a linear programming (LP) where the optimal solution can be a noninteger in [0,1]. The fractional optimal solution is interpreted as (pseudo) probabilities over the N - 1 frame sliding window. The best hard (binary) decision assignment solution and the M best via TMHT are compared with the soft decision solution for 2-D tracking scenarios with various sensor configurations. Based on the simulation results, the soft assignment approach has better track maintenance capability than the single best hard assignment and a performance nearly as good as the TMHT. Its computational load is slightly higher than the single best hard assignment but much lighter than TMHT.