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

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

False alarm effects on estimation in multitarget trackers

An analysis of false alarm effects on tracking filter performance in multitarget track-while-scan radars, using variable correlation gates, is presented. The false alarms considered originate from noise, clutter, and crossing targets. The dimensions of the correlation gates are determined by filter prediction and measurement error variances. Track association is implanted either by means of a distance weighted average of the observations or by the nearest neighbor rule. State estimation is performed by means of a second-order discrete Kalman filter, taking into consideration random target maneuvers. Measurements are made in polar coordinates, while target dynamics are estimated in Cartesian coordinates, resulting in coupled linear filter equations. the effect of false alarms on the observation noise covariance matrix, and hence on state estimation errors, is analyzed. A computer simulation example, implementing radar target tracking with a variable correlation gate in the presence of false alarms, is discussed     

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.     

Mixture Reduction Algorithms for Point and Extended Object Tracking in Clutter

The Bayesian solution to the problem of tracking a target with measurement association uncertainty gives rise to mixture distributions, which are composed of an ever increasing number of components. To produce a practical tracking filter, the growth of components must be controlled by approximating the mixture distribution. Two mixture reduction schemes (a joining algorithm and a clustering algorithm) have been derived for this purpose. If significant well spaced mixture components are present, these techniques can provide a useful improvement over the probabilistic data association filter (PDAF) approach, which reduces the mixture to a single Gaussian component at each time step. For the standard problem of tracking a point target in uniform random clutter, a Monte Carlo simulation study has been employed to identify the region of the problem parameter space where significant performance improvement is obtained over the PDAF. In the second part of this paper, the formal Bayesian filter is derived for an extended target consisting of an array of measurement sources with association uncertainty. A practical multiple hypothesis filter is implemented using mixture reduction and simulation results are presented.     

A Probabilistic Strongest Neighbor Filter Algorithm for m Validated Measurements

A new form of the probabilistically strongest neighbor filter (PSNF) algorithm taking into account the number of validated measurements is proposed. The probabilistic nature of the strongest neighbor (SN) measurement in a cluttered environment is shown to be varied with respect to the number of validated measurements. Incorporating the number of validated measurements into design of the PSNF produces a consistent and cost effective data association method. Simulation studies show that the new filter is less sensitive to the unknown spatial clutter density and is more reliable for practical target tracking in nonhomogeneous clutter than the existing PSNF. It has similar performances to the probabilistic data association filter amplitude information (PDAF-AI) with much less computational complexities.     

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.     

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.     

Manoeuvring target tracking in clutter using particle filters

A particle filter (PF) is a recursive numerical technique which uses random sampling to approximate the optimal solution to target tracking problems involving nonlinearities and/or non-Gaussianity. A set of particle filtering methods for tracking and manoeuvering target in clutter from angle-only measurements is presented and evaluated. The aim is to compare PFs to a well-established tracking algorithm, the IMM-PDA-EKF (interacting multiple model, probabilistic data association, extended Kalman filter), and to provide an insight into which aspects of PF design are of most importance under given conditions. Monte Carlo simulations show that the use of a resampling scheme which produces particles with distinct values offers significant improvements under almost all conditions. Interestingly, under all conditions considered here,using this resampling scheme with blind particle proposals is shown to be superior, in the sense of providing improved performance for a fixed computational expense, to measurement-directed particle proposals with the same resampling scheme. This occurs even under conditions favourable to the use of measurement-directed proposals. The IMM-PDA-EKF performs poorly compared with the PFs for large clutter densities but is more effective when the measurements are precise.     

密集杂波环境下的数据关联快速算法

基于联合概率数据互联（JPDA）的思想,提出了一种新的数据关联快速算法（Fast Al-gorithm for Data Association,简称FAFDA算法）.该方法不需象在最优JPDA算法中那样生成所有可能的联合互联假设,因而具有计算量小,易于工程实现的特点。仿真结果表明,与最优JPDA算法相比,FAFDA算法的跟踪性能令人满意,并且在密集杂波环境下可实时、有效地跟踪100批次以上的目标。     

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.     

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.     

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.     

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

水下多目标跟踪是水声信号处理领域研究的热点和难点问题。高斯混合概率假设密度(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%。     

Multiassignment for tracking a large number of overlapping objects[and application to fibroblast cells]

In this paper we present a new technique for data association using multiassignment for tracking a large number of closely spaced (and overlapping) objects. The algorithm is illustrated on a biomedical problem, namely the tracking of a group of fibroblast (tissue) cells from an image sequence, which motivated this work. Because of their proximity to one another and due to the difficulties in segmenting the images accurately from a poor-quality image sequence, the cells are effectively closely spaced objects (CSOs). The algorithm presents a novel dichotomous, iterated approach to multiassignment using successive one-to-one assignments of decreasing size with modified costs. The cost functions, which are adjusted depending on the “depth” of the current assignment level and on the tracking results, are derived. The resulting assignments are used to form, maintain and terminate tracks with a modified version of the probabilistic data association (PDA) filter, which can handle the contention for a single measurement among multiple tracks in addition to the association of multiple measurements to a single track. Estimation results are given and compared with those of the standard 2D one-to-one assignment algorithm. It is shown that iterated multiassignment results in superior measurement-to-track association. The algorithms presented can be used for other general tracking problems, including dense air traffic surveillance and control     

Optimization of point target tracking filters

We review a powerful temporal-based algorithm, a triple temporal filter (TTF) with six input parameters, for detecting and tracking point targets in consecutive frame data acquired with staring infrared (IR) cameras. Using an extensive data set of locally acquired real-world data, we used an iterative optimization technique, the Simplex algorithm, to find an optimum set of input parameters for a given data set. Analysis of correlations among the optimum filter parameters based on a representative subset of our database led to two improved versions of the filter: one dedicated to noise-dominated scenes, the other to cloud clutter-dominated scenes. Additional correlations of filter parameters with measures of clutter severity and target velocity as well as simulations of filter responses to idealized targets reveal which features of the data determine the best choice of filter parameters. The performance characteristics of the filter is detailed by a few example scenes and metric plots of signal to clutter gains and signal to noise gains over the total database     

A measurement-driven adaptive probability hypothesis density filter for multitarget tracking

This paper studies the dynamic estimation problem for multitarget tracking. A novel gating strategy that is based on the measurement likelihood of the target state space is proposed to improve the overall effectiveness of the probability hypothesis density(PHD) filter. Firstly, a measurement-driven mechanism based on this gating technique is designed to classify the measurements. In this mechanism, only the measurements for the existing targets are considered in the update step of the existing targets while the measurements of newborn targets are used for exploring newborn targets. Secondly, the gating strategy enables the development of a heuristic state estimation algorithm when sequential Monte Carlo(SMC) implementation of the PHD filter is investigated, where the measurements are used to drive the particle clustering within the space gate.The resulting PHD filter can achieve a more robust and accurate estimation of the existing targets by reducing the interference from clutter. Moreover, the target birth intensity can be adaptive to detect newborn targets, which is in accordance with the birth measurements. Simulation results demonstrate the computational efficiency and tracking performance of the proposed algorithm.     

幅度及多普勒信息辅助的多目标跟踪算法

针对现有的多目标跟踪（MTT）算法在强杂波环境下会出现严重的性能衰退,利用目标的幅度及多普勒特征,基于随机有限集（RFS）理论,提出了一种幅度及多普勒信息辅助的δ广义标签多伯努利（ADI-δ-GLMB）滤波器。首先,利用幅度及多普勒信息对目标状态进行扩展,在此基础上建立了新的量测似然函数。然后,基于δ-GLMB滤波器框架推导了新的更新方程。最后,进行仿真验证,结果表明：强杂波下,ADI-δ-GLMB滤波器跟踪性能明显优于δ-GLMB滤波器,估计精度及稳定性更高,且计算量更低;同信息辅助的概率假设密度（PHD）、多目标多伯努利（MeMBer）滤波器相比,ADI-δ-GLMB滤波器状态估计精度更高。     

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     

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     

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