改进的MMPHD机动目标跟踪方法

基于序列蒙特卡罗方法的经典多模概率假设密度滤波方法及其各种衍生方法,在预测过程中依据多个并行的状态转移模型,通过将大量粒子散布到下一时刻目标所有可能出现的状态空间实现目标状态的捕获,造成计算量大、目标跟踪精度差。为此,提出一种改进的多模粒子概率假设密度机动目标跟踪方法。该方法利用最新量测信息估计目标运动模型概率及模型参数,并将估计得到的目标模型应用到粒子概率假设密度滤波方法的预测过程中生成预测粒子,从而将大部分粒子聚合在目标最可能出现的状态空间邻域中,实现粒子的有效利用。数值仿真表明,所提方法不仅显著地减少了目标丢失个数,而且提高了目标跟踪精度。     

Geometrical entropy approach for variable structure multiple-model estimation

The variable structure multiple-model(VSMM) estimation approach, one of the multiple-model(MM) estimation approaches, is popular in handling state estimation problems with mode uncertainties.In the VSMM algorithms, the model sequence set adaptation(MSA) plays a key role.The MSA methods are challenged in both theory and practice for the target modes and the real observation error distributions are usually uncertain in practice.In this paper, a geometrical entropy(GE) measure is proposed so that the MSA is achieved on the minimum geometrical entropy(MGE) principle.Consequently, the minimum geometrical entropy multiple-model(MGEMM) framework is proposed, and two suboptimal algorithms, the particle filter k-means minimum geometrical entropy multiple-model algorithm(PF-KMGEMM) as well as the particle filter adaptive minimum geometrical entropy multiple-model algorithm(PF-AMGEMM), are established for practical applications.The proposed algorithms are tested in three groups of maneuvering target tracking scenarios with mode and observation error distribution uncertainties.Numerical simulations have demonstrated that compared to several existing algorithms, the MGE-based algorithms can achieve more robust and accurate estimation results when the real observation error is inconsistent with a priori.     

Track-before-detect for Infrared Maneuvering Dim Multi-target via MM-PHD

In this paper, we present a novel and efficient track-before-detect (TBD) algorithm based on multiple-model probability hypothesis density (MM-PHD) for tracking infrared maneuvering dim multi-target. Firstly, the standard sequential Monte Carlo probability hypothesis density (SMC-PHD) TBD-based algorithm is introduced and sequentially improved by the adaptive process noise and the importance re-sampling on particle likelihood, which result in the improvement in the algorithm robustness and convergence speed. Secondly, backward recursion of SMC-PHD is derived in order to ameliorate the tracking performance especially at the time of the multi-target arising. Finally, SMC-PHD is extended with multiple-model to track maneuvering dim multi-target. Extensive experiments have proved the efficiency of the presented algorithm in tracking infrared maneuvering dim multi-target, which produces better performance in track detection and tracking than other TBD-based algorithms including SMC-PHD, multiple-model particle filter (MM-PF), histogram probability multi-hypothesis tracking (H-PMHT) and Viterbi-like.     

Tracking with classification-aided multiframe data association

In most conventional tracking systems, only the target kinematic information from, for example, a radar or sonar or an electro-optical sensor, is used in measurement-to-track association. Target class information, which is typically used in postprocessing, can also be used to improve data association to give better tracking accuracy. The use of target class information in data association can improve discrimination by yielding purer tracks and preserving their continuity. In this paper, we present the simultaneous use of target classification information and target kinematic information for target tracking. The approach presented integrates target class information into the data association process using the 2-D (one track list and one measurement list) as well as multiframe (one track list and multiple measurement lists) assignments. The multiframe association likelihood is developed to include the classification results based on the "confusion matrix" that specifies the accuracy of the target classifier. The objective is to improve association results using class information when the kinematic likelihoods are similar for different targets, i.e., there is ambiguity in using kinematic information alone. Performance comparisons with and without the use of class information in data association are presented on a ground target tracking problem. Simulation results quantify the benefits of classification-aided data association for improved target tracking, especially in the presence of association uncertainty in the kinematic measurements. Also, the benefit of 5-D (or multiframe) association versus 2-D association is investigated for different quality classifiers. The main contribution of this paper is the development of the methodology to incorporate exactly the classification information into multidimensional (multiframe) association.     

Multiple-model estimation with variable structure- part VI: expected-mode augmentation

A new class of variable-structure (VS) algorithms for multiple-model (MM) estimation is presented, referred to as expected-mode augmentation (EMA). In the EMA approach, the original set of models is augmented by a variable set of models intended to match the expected value of the unknown true mode. These models are generated adaptively in real time as (globally or locally) probabilistically weighted sums of mode estimates over the model set. This makes it possible to cover a large continuous mode space by a relatively small number of models at a given accuracy level. The paper presents new theoretical results for model-set design, a general formulation of the EMA approach, along with theoretical analysis and justification, and three algorithms for its practical implementation. The performance of the proposed EMA algorithms is evaluated via simulation of a generic maneuvering target tracking problem.     

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.     

一种基于最小二乘拟合的数据关联算法

针对点航关联在多目标跟踪中精度与实时性难兼顾的问题,提出了一种基于最小二乘拟合的点航关联算法。首先采用滑窗将历史航迹截断,采用最小二乘法在不同维度分别拟合、外推融合航迹历史信息条件下的航迹点,增加外推点的多样性及信息量。同时定义了5种全概率关联事件,提取传统滤波方法的预测点,将拟合外推点与滤波预测点融合,使归属判决更加准确。最后分别推导了不同事件发生时的状态更新方程与误差协方差更新方程,给出了其中参数的确定方法。经仿真数据验证,与经典的最近邻域法和联合概率数据互联算法相比,所提算法能够更好地兼顾精度与实时性,且计算复杂度较低,易于工程实现。     

基于CPHD的双层粒子滤波目标跟踪算法

常规基于势概率假设密度滤波(Cardinalized Probability Hypothesis Density,CPHD)的粒子滤波(Particle Fil? ter,PF)跟踪算法应用于多目标跟踪时,容易遇到因粒子数量增加而带来的运算效率下降、目标数目估计不准的问题。文章基于常规粒子滤波 CPHD跟踪算法,通过部署双层粒子,提出基于势概率假设密度滤波的双层粒子滤波 (Two-Layer Particle Filter-CPHD,TLPF-CPHD)算法,以便提高目标数目及状态估计精度。仿真实验结果证明,相比于常规 PF-CPHD算法,新算法具有更好的目标数目和状态估计准确性。     

一种基于修正Hough变换的航迹起始算法

为了在重杂波区内检测出运动的目标,提出了一种修正的Hough变换算法用于初始航迹的建立。与传统的算法相比,修正算法充分利用目标的运动学信息,选取了更为合适的变换参量,仅利用较少拍数的量测就可以完成起始,能够在检测概率较高的环境下具有良好的起始性能。计算机仿真结果表明,算法能够克服传统算法的多拍扫描,大大缩短实际的计算量和起始时间,实现对航迹起始的在线改进。     

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.     

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     

Multiple-model estimation with variable structure. IV. Design andevaluation of model-group switching algorithm

For pt. III see ibid., vol. 35, pp. 225-41 (1999). A variable-structure multiple-model (VSMM) estimator, called model-group switching (MGS) algorithm, has been presented in Part III, which is the first VSMM estimator that is generally applicable to a large class of problem with hybrid (continuous and discrete) uncertainties. In this algorithm, the model-set is made adaptive by switching among a number of predetermined groups of models. It has the potential to be substantially more cost-effective than fixed-structure MM (FSMM) estimators, including the Interacting Multiple-Model (IMM) estimator. A number of issues of major importance in the application of this algorithm are investigated here, including the model-group adaptation logic and model-group design. The results of this study are implemented via a detailed design for a problem of tracking a maneuvering target using a time-varying set of models, each characterized by a representative value of the expected acceleration of the target. Simulation results are given to demonstrate the performance (based on more reasonable and complete measures than commonly used rms errors alone) and computational complexity of the MGS algorithm, relative to the fixed-structure IMM (FSIMM) estimator using all models, under carefully designed and fair random and deterministic scenarios     

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     

Bayesian Approach to Extended Object and Cluster Tracking using Random Matrices

In algorithms for tracking and sensor data fusion the targets to be observed are usually considered as point source objects; i.e., compared with the sensor resolution their extension is neglected. Due to the increasing resolution capabilities of modern sensors, however, this assumption is often no longer valid as different scattering centers of an object can cause distinct detections when passing the signal processing chain. Examples of extended targets are found in short-range applications (littoral surveillance, autonomous weapons, or robotics). A collectively moving target group can also be considered as an extended target. This point of view is the more appropriate, the smaller the mutual distances between the individual targets are. Due to the resulting data association and resolution conflicts any attempt of tracking the individual objects within the group seems to be no longer reasonable. With simulated sensor data produced by a partly unresolvable aircraft formation the addressed phenomena are illustrated and an approximate Bayesian solution to the resulting tracking problem is proposed. Ellipsoidal object extensions are modeled by random matrices, which are treated as additional state variables to be estimated or tracked. We expect that the resulting tracking algorithms are also relevant for tracking large, collectively moving target swarms.     

A Sequential Approach to Target Discrimination

The Wald sequential probability ratio test is applied to the discrimination of targets observed by a radar or other sensor and a form for the classifier involving linear predictive filtering is developed. In this sequential approach, a target is illuminated with consecutive pulses until a classification of the target can be made to within a prescribed probability of error. Because of the linear-predictive formulation, the computational and storage requirements for the classifier are related only to the number of returns necessary to predict the target signature and not to the length of signature observed; a classifier with modest storage and computational requirements can be employed to process signatures consisting of an arbitrarily large number of returns. The classifier is based on some well-known results in mean-square filtering theory and has a simple intuitive interpretation. The classifier structure can also be related to autoregressive time series analysis and innovations process concepts and has an interpretation in the frequency domain in terms of the maximum entropy and maximum likelihood spectral estimates for the target signatures.     

基于IMMKF算法的ADS-B监视应用目标跟踪

目标跟踪是机载广播式自动相关监视（ADS-B）应用的基础功能,对提升航空器周边的弱机动民航飞机目标跟踪性能具有重要意义。提出一种基于交互式多模型卡尔曼滤波（IMMKF）算法的ADS-B 监视应用目标跟踪方法。首先,针对弱机动背景下的民航飞机的飞行特点,建立包含匀速模型和标准协同转弯模型的运动模型集,并对模型进行线性化近似;然后,将模型预测和ADS-B 状态矢量量测数据作为IMMKF 算法中多个并行卡尔曼滤波器的输入,进行并行滤波;最后,计算得到目标状态矢量的估计和模型近似概率,并作为下一次迭代的输入。结果表明：相比于基于匀速模型的卡尔曼滤波目标跟踪方法,IMMKF 方法的位置跟踪误差降低了59%,速度跟踪误差降低了77%,显著提升了状态估计性能,具备较高的跟踪精度、稳健性与计算效率,在ADS-B 监视应用中具有实际应用价值与借鉴意义。     

Shifted Rayleigh filter: a new algorithm for bearings-only tracking

A new algorithm, the "shifted Rayleigh filter," is introduced for two- or three-dimensional bearings-only tracking problems. In common with other "moment matching" tracking algorithms such as the extended Kalman filter and its modern refinements, it approximates the prior conditional density of the target state by a normal density; the novel feature is that an exact calculation is then performed to update the conditional density in the light of the new measurement. The paper provides the theoretical justification of the algorithm. It also reports on simulations involving variants on two scenarios, which have been the basis of earlier comparative studies. The first is a "benign" scenario where the measurements are comparatively rich in range-related information; here the shifted Rayleigh filter is competitive with standard algorithms. The second is a more "extreme" scenario, involving multiple sensor platforms, high-dimensional models and noisy measurements; here the performance of the shifted Rayleigh filter matches the performance of a high-order bootstrap particle filter, while reducing the computational overhead by an order of magnitude.     

Superimposed HMM transient detection via target tracking ideas

The quickest detection of superimposed hidden Markov model (HMM) transient signals is addressed. It is assumed that a known HMM is always extant but at an unknown time a second known HMM may also be present, and overlapped with the previous. Two approaches are proposed. The first treats the superimposed HMMs as a unit with an expanded state space, thus converting the problem of detecting superimposed HMMs into detection of a change in HMM, this being readily solved using a previously proposed procedure. Such an approach, though excellent in terms of performance, is not suitable for the superposition of multiple HMMs with large state dimensions due to computational complexity. A second detection scheme (based on multiple target tracking ideas) with much lower computational needs but little loss in terms of performance, is therefore developed     

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

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

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.