Active sonar application of a U-D square root PDAF

The probabilistic data association filter (PDAF) is a suboptimal approach to tracking a target in the presence of clutter. In the PDAF implementation, the Kalman measurement update is performed over the set of validated measurements and the Kalman time update is used to propagate the PDAF measurement update. A popular approach to obtaining a numerically stable set of Kalman update equations is to propagate the U-D factors of the covariance in the measurement and time updates. The PDAF measurement update equation is obtained in U-D factored form by applying the modified weighted Gram-Schmidt (MWG-S) algorithm to the three factored terms. The factors of the first two terms are determined from the U-D factors of the a priori and conditional a posteriori covariances. The third term is factored analytically using the Agee-Turner factorization. The resulting U-D square-root PDAF is then applied to the problem of active tracking of a submarine in reverberation using polar coordinates     

Dynamic Cramer-Rao bound for target tracking in clutter

Recently, there have been several new results for an old topic, the Cramer-Rao lower bound (CRLB). Specifically, it has been shown that for a wide class of parameter estimation problems (e.g. for objects with deterministic dynamics) the matrix CRLB, with both measurement origin uncertainty (i.e., in the presence of false alarms or random clutter) and measurement noise, is simply that without measurement origin uncertainty times a scalar information reduction factor (IRF). Conversely, there has arisen a neat expression for the CRLB for state estimation of a stochastic dynamic nonlinear system (i.e., objects with a stochastic motion); but this is only valid without measurement origin uncertainty. The present paper can be considered a marriage of the two topics: the clever Riccati-like form from the latter is preserved, but it includes the IRF from the former. The effects of plant and observation dynamics on the CRLB are explored. Further, the CRLB is compared via simulation to two common target tracking algorithms, the probabilistic data association filter (PDAF) and the multiframe (N-D) assignment algorithm.     

PMHT: problems and some solutions

The probabilistic multihypothesis tracker (PMHT) is a target tracking algorithm of considerable theoretical elegance. In practice, its performance turns out to be at best similar to that of the probabilistic data association filter (PDAF); and since the implementation of the PDAF is less intense numerically the PMHT has been having a hard time finding acceptance. The PMHT's problems of nonadaptivity, narcissism, and over-hospitality to clutter are elicited in this work. The PMHT's main selling-point is its flexible and easily modifiable model, which we use to develop the "homothetic" PMHT; maneuver-based PMHTs, including those with separate and joint homothetic measurement models; a modified PMHT whose measurement/target association model is more similar to that of the PDAF; and PMHTs with eccentric and/or estimated measurement models. Ideally, "bottom line" would be a version of the PMHT with clear advantages over existing trackers. If the goal is of an accurate (in terms of mean square error (MSE)) track, then there are a number of versions for which this is available.     

Multiple model PMHT and its application to the benchmark radar tracking problem

The probabilistic multiple hypothesis tracker (PMHT) uses the expectation-maximization (EM) algorithm to solve the measurement-origin uncertainty problem. Here, we explore some of its variants for maneuvering targets and in particular discuss the multiple model PMHT. We apply this PMHT to the six "typical" tracking scenarios given in the second benchmark problem from W. D. Blair and G. A. Watson (1998). The manner in which the PMHT is used to track the targets and to manage radar allocation is discussed, and the results compared with those of the interacting multiple model probabilistic data association filter (IMM/PDAF) and IMM/MHT (multiple hypothesis tracker). The PMHT works well: its performance lies between those of the IMM/PDAF and IMM/MHT both in terms of tracking performance and computational load.     

PDAF with multiple clutter regions and target models

This paper presents the theory of a new multiple model probabilistic data association filter (PDAF). The analysis is generalized for the case of multiple nonuniform clutter regions within the measurement data that updates each model of the filter. To reduce the possibility of clutter measurements forming established tracks, the solution includes a model for a visible target. That is, a target that gives sensor measurements that satisfy one of the target models. Other features included in the algorithm are the selection of a fixed number of nearest measurements and the addition of signal amplitude to the target state vector. The nonuniform clutter model developed here is applicable to tracking signal amplitude. Performance of this algorithm is illustrated using experimentally recorded over-the-horizon radar (OTHR) data.     

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.     

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

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

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     

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.     

Multiple-Model Probability Hypothesis Density Filter for Tracking Maneuvering Targets

Tracking multiple targets with uncertain target dynamics is a difficult problem, especially with nonlinear state and/or measurement equations. With multiple targets, representing the full posterior distribution over target states is not practical. The problem becomes even more complicated when the number of targets varies, in which case the dimensionality of the state space itself becomes a discrete random variable. The probability hypothesis density (PHD) filter, which propagates only the first-order statistical moment (the PHD) of the full target posterior, has been shown to be a computationally efficient solution to multitarget tracking problems with a varying number of targets. The integral of PHD in any region of the state space gives the expected number of targets in that region. With maneuvering targets, detecting and tracking the changes in the target motion model also become important. The target dynamic model uncertainty can be resolved by assuming multiple models for possible motion modes and then combining the mode-dependent estimates in a manner similar to the one used in the interacting multiple model (IMM) estimator. This paper propose a multiple-model implementation of the PHD filter, which approximates the PHD by a set of weighted random samples propagated over time using sequential Monte Carlo (SMC) methods. The resulting filter can handle nonlinear, non-Gaussian dynamics with uncertain model parameters in multisensor-multitarget tracking scenarios. Simulation results are presented to show the effectiveness of the proposed filter over single-model PHD filters.     

基于混合粒子滤波的激光惯导系统误差的补偿

针对激光陀螺捷联惯导系统在动态尤其是高动态环境下的姿态误差显著增大的问题,提出了一种基于改进高斯混合粒子滤波的纯方位跟踪算法。算法基于混合粒子的卡尔曼滤波和粒子滤波的特点,用有限的高斯模型来近似后验状态密度、系统噪声和观测噪声的分布通过EM的算法设计实现模型的降阶,一定程度上克服了EM算法迭代的结果需要依赖初始值、可能收敛到局部最大点或可能收敛到参数空间边界的缺点,从而改善了粒子携带信息的衰减问题。通过仿真与试验结合,在纯动态应用环境下的姿态与定位精度补偿效果,与传统Kalman滤波相比,算法在保持高精度估计能力的同时,具有较强的鲁棒性,是解决非线性系统状态估计问题的一种有效方法。     

一种基于三维到达角的无偏伪线性卡尔曼滤波

为了解决大场景下基于三维到达角的目标跟踪问题，提出了一种具有无偏性的伪线性卡尔曼滤波。首先，基于三维到达角信息对目标运动模型与量测模型进行建模；之后，对量测模型进行了伪线性化处理，得到了线性形式的目标量测模型。为了解决伪线性卡尔曼滤波存在的有偏性问题，提出了一种结合EKF（extend Kalman filter）的三维伪线性无偏卡尔曼滤波。仿真实验表明，该模型能够对非机动目标与机动目标有效跟踪，对于百公里级别的目标，当角测量误差从0.1°变化到0.5°，算法在仿真时间结束时均能将绝对位置误差降低至10 km以内，且算法的运行速度与EKF为同一个量级，同时兼顾了抗干扰能力、定位跟踪精度、运行效率的要求，能够为大场景下的目标跟踪提供有效方法。     

Design of a practical tracking algorithm with radar measurements

The extended Kalman filter (EKF) has been widely used as a nonlinear filtering method for radar tracking problems. However, it has been found that if cross-range measurement errors of the target position are large, the performance of the conventional EKF degrades considerably due to nonnegligible nonlinear effects. A new filtering algorithm for improving the tracking performance with radar measurements is developed based on the fact that correct evaluation of the measurement error covariance is possible in the Cartesian coordinate system. The proposed algorithm may be viewed as a modification of the EKF in which the variance of the range measurement errors is evaluated in an adaptive manner. The filter structure facilitates the incorporation of the sequential measurement processing scheme, and this makes the resulting algorithm favorable to both estimation accuracy and computational efficiency. Computer simulation results show that the proposed method offers superior performance in comparison to previous methods. Moreover, our developed algorithm provides some useful insight into the radar tracking problem     

Tracking an incoming ballistic missile using an extended interval Kalman filter

The important tracking problem by radar of an incoming ballistic missile system, which contains uncertainty in modeling and noise in both dynamics and measurements, is studied. The classical extended Kalman filter (EKF) is no longer applicable to such an uncertain system, and so a new extended interval Kalman filter (EIKF) is developed for tracking the missile system. Computer simulation is presented to show the effectiveness of the EIKF algorithm for this uncertain and nonlinear ballistic missile tracking problem.     

非线性系统中多传感器目标跟踪融合算法研究

 研究了在非线性系统中 ,基于转换坐标卡尔曼滤波器的多传感器目标跟踪融合算法。通过分析得出 :在非线性系统的多传感器目标跟踪中 ,基于转换坐标卡尔曼滤波器 ( CMKF)的分布融合估计基本可以重构中心融合估计。仿真实验也证明了此结论。由此可见分布的 CMKFA是非线性系统中较优的分布融合算法     

非线性非高斯模型的高斯和PHD滤波算法(英文)

A new multi-target filtering algorithm, termed as the Gaussian sum probability hypothesis density （GSPHD） filter, is proposed for nonlinear non-Gaussian tracking models. Provided that the initial prior intensity of the states is Gaussian or can be identified as a Gaussian sum, the analytical results of the algorithm show that the posterior intensity at any subsequent time step remains a Gaussian sum under the assumption that the state noise, the measurement noise, target spawn intensity, new target birth intensity, target survival probability, and detection probability are all Gaussian sums. The analysis also shows that the existing Gaussian mixture probability hypothesis density （GMPHD） filter, which is unsuitable for handling the non-Gaussian noise cases, is no more than a special case of the proposed algorithm, which fills the shortage of incapability of treating non-Gaussian noise. The multi-target tracking simulation results verify the effectiveness of the proposed GSPHD.     

An improved multiple model GM-PHD filter for maneuvering target tracking

In this paper, an improved implementation of multiple model Gaussian mixture probability hypothesis density (MM-GM-PHD) filter is proposed. For maneuvering target tracking, based on joint distribution, the existing MM-GM-PHD filter is relatively complex. To simplify the filter, model conditioned distribution and model probability are used in the improved MM-GM-PHD filter. In the algorithm, every Gaussian components describing existing, birth and spawned targets are estimated by multiple model method. The final results of the Gaussian components are the fusion of multiple model estimations. The algorithm does not need to compute the joint PHD distribution and has a simpler computation procedure. Compared with single model GM-PHD, the algorithm gives more accurate estimation on the number and state of the targets. Compared with the existing MM-GM-PHD algorithm, it saves computation time by more than 30%. Moreover, it also outperforms the interacting multiple model joint probabilistic data association (IMMJPDA) filter in a relatively dense clutter environment.     

Multiple model particle flter track-before-detect for range ambiguous radar

The middle pulse repetition frequency（MPRF）and high pulse repetition frequency（HPRF）modes are widely adopted in airborne pulse Doppler（PD）radar systems,which results in the problem that the range measurement of targets is ambiguous.The existing data processing based range ambiguity resolving methods work well on the condition that the signal-to-noise ratio（SNR）is high enough.In this paper,a multiple model particle flter（MMPF）based track-beforedetect（TBD）method is proposed to address the problem of target detection and tracking with range ambiguous radar in low-SNR environment.By introducing a discrete variable that denotes whether a target is present or not and the discrete pulse interval number（PIN）as components of the target state vector,and modeling the incremental variable of the PIN as a three-state Markov chain,the proposed algorithm converts the problem of range ambiguity resolving into a hybrid state fltering problem.At last,the hybrid fltering problem is implemented by a MMPF-based TBD method in the Bayesian framework.Simulation results demonstrate that the proposed Bayesian approach can estimate target state as well as the PIN simultaneously,and succeeds in detecting and tracking weak targets with the range ambiguous radar.Simulation results also show that the performance of the proposed method is superior to that of the multiple hypothesis（MH）method in low-SNR environment.     

Novel data association schemes for the probability hypothesis density filter

The probability hypothesis density (PHD) filter is a practical alternative to the optimal Bayesian multi-target Alter based on finite set statistics. It propagates the PHD function, a first-order moment of the full multi-target posterior density. The peaks of the PHD function give estimates of target states. However, the PHD filter keeps no record of target identities and hence does not produce track-valued estimates of individual targets. We propose two different schemes according to which PHD filter can provide track-valued estimates of individual targets. Both schemes use the probabilistic data-association functionality albeit in different ways. In the first scheme, the outputs of the PHD filter are partitioned into tracks by performing track-to-estimate association. The second scheme uses the PHD filter as a clutter filter to eliminate some of the clutter from the measurement set before it is subjected to existing data association techniques. In both schemes, the PHD filter effectively reduces the size of the data that would be subject to data association. We consider the use of multiple hypothesis tracking (MHT) for the purpose of data association. The performance of the proposed schemes are discussed and compared with that of MHT.     

Tracking in clutter with nearest neighbor filters: analysis andperformance

The measurement that is “closest” to the predicted target measurement is known as the “nearest neighbor” (NN) measurement in tracking. A common method currently in wide use for tracking in clutter is the so-called NN filter, which uses only the NN measurement as if it were the true one. The purpose of this work is two fold. First, the following theoretical results are derived: the a priori probabilities of all three data association events (updates with correct measurement, with incorrect measurement, and no update), the probability density functions (pdfs) of the NN measurement conditioned on the association events, and the one-step-ahead prediction of the matrix mean square error (MSE) conditioned on the association events. Secondly, a technique for prediction without recourse to expensive Monte Carlo simulations of the performance of tracking in clutter with the NN filter is presented. It can quantify the dynamic process of tracking divergence as well as the steady-state performance. The technique is a new development along the line of the recently developed general approach to the performance prediction of algorithm with both continuous and discrete uncertainties