一种混合的多机动目标跟踪算法研究

提出了一种混合的多机动目标跟踪算法:交互多模型模糊联合概率数据关联算法(IMM-FJPDA),该算法将交互多模型算法(IMM)和模糊联合概率数据关联算法(FJPDA)相结合,它克服了IMM-JPDA算法计算量大和IMM-FDA算法在强杂波环境中跟踪精度差的问题.给出了基于模糊C均值(FCM)算法的多机动目标跟踪步骤.仿真结果表明IMM-FJPDA算法跟踪精度与IMM-JPDA算法相当,但计算量明显减小,提高了跟踪实时性.     

基于视觉注意机制的认知雷达数据关联算法

针对传统关联波门设计方法在应用于机动目标跟踪时容易引起失跟、以及概率数据关联算法不适于多交叉目标跟踪的问题,提出了一种基于人类视觉选择性注意机制和知觉客体的"特征整合"理论的认知雷达数据关联算法。算法以综合交互式多模型概率数据关联算法为基础,采取假设目标最大机动水平已知的"当前"统计模型和匀速运动模型作为模型集,通过实时交互使关联波门能够随目标机动动态调整,较好地兼顾了雷达计算耗时和跟踪成功率。在利用目标位置特征的基础上,进一步提取、整合目标运动特征,对关联波门交叉区域公共量测进行分类,使多交叉目标跟踪问题转化为多个单目标跟踪问题,优化了传统概率数据关联算法。仿真结果表明：与传统关联波门设计方法相比,算法跟踪失败率和计算耗时明显降低;而且在计算资源增加不大的情况下,杂波环境适应性也得到了显著增强。     

一种改进的直方图概率多假设多目标跟踪方法

直方图概率多假设跟踪（H-PMHT）方法及其变形泊松分布直方图概率多假设跟踪（P-HPMHT）方法的一个主要缺点是其量测模型仅考虑了背景杂波而没有考虑传感器噪声,从而导致在低信噪比条件下检测概率较低。针对这一问题,提出了一种带传感器噪声模型的H-PMHT方法,通过将传感器噪声引入量测模型,从而明显提高了对低信噪比目标的跟踪检测能力。该方法的计算量与目标数保持线性关系,仍然适用于目标数目较多的情况。仿真实验表明：该方法在误跟踪比率为1‰,信噪比为6 dB时,检测比率可提升近20%,信噪比为3 dB时,可提升近10%。     

基于标签多伯努利滤波的衍生目标跟踪算法

针对现有随机有限集(RFS)滤波器在低信噪比环境下对衍生目标跟踪性能严重下降的问题,提出了一种基于Delta扩展标签多伯努利(δ-GLMB)滤波器的改进算法。基于随机集理论和伯努利衍生模型,推导了新的预测方程,并采用了假设裁剪及分组手段和多伯努利近似技术以降低算法的计算量。针对假设增多引起的虚警问题,将多帧平滑思想和算法相结合,利用标签信息对新目标进行回溯处理。仿真结果表明,所提算法能对目标数目进行无偏估计,在低探测概率和强杂波环境下性能明显优于概率假设密度(PHD)算法,计算开销在衍生初始阶段增长快于PHD,目标较分散时低于PHD。     

基于模板匹配的集中式多传感器群内目标精细跟踪算法

为解决多传感器探测下群内目标精细跟踪的难题,基于非机动情况下各探测周期内群内目标真实回波位置相对固定的特性,提出了一种基于模板匹配的集中式多传感器群内目标精细跟踪算法。该算法通过预关联成功的群状态集合与群量测集合分别建立模板形状矩阵和待匹配形状矩阵,利用匹配搜索模型和匹配矩阵确认规则选出代价最小的匹配矩阵,并基于模板和对应的匹配矩阵利用 kalman滤波完成群内各目标航迹的状态更新。仿真表明,与传统多传感器多目标跟踪算法中性能优越的基于数据压缩的集中式多传感器多假设算法相比,该算法在跟踪精度、实时性、有效跟踪率方面的性能明显优越,能很好的满足群内目标精细跟踪的实际工程需求。     

空间多分辨率模糊目标跟踪

提出了一种新的模糊目标跟踪算法--CPDA算法。这个算法在空间多分辨率框架下应用概率数据互联算法,在粗分辨率上实现模糊目标跟踪。在不同虚警密度的模糊目标环境下,利用仿真实验分析了CPDA算法的跟踪性能,同时将其与单分辨率上的联合概率数据互联方法进行了性能比较。仿真结果表明,CPDA算法的跟踪性能在达到与单分辨率上JPDA算法同样性能的条件下,能够以较小的计算量跟踪模糊目标。     

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

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

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

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

区域杂波估计的多目标跟踪方法

高斯粒子概率假设密度（PHD）滤波往往假定杂波密度参数已知,这种做法对于实际应用是不现实的。此外,杂波的参数值通常依赖于环境条件,可能随时间发生变化。因此,多目标跟踪算法中需要实时准确估计杂波密度的参数。基于此,提出了一种多目标跟踪的区域杂波估计方法。首先根据量测信息在线估计出场景中的杂波数目,然后估计落入目标附近感兴趣区域的杂波数,并估计每个目标感兴趣区域杂波强度。仿真结果表明,在复杂场景下算法的跟踪性能明显优于未进行杂波估计的多目标跟踪算法,提高了跟踪的实时性和跟踪精度。     

未知测量噪声分布下的多目标跟踪算法

 粒子概率假设密度滤波(SMC-PHDF)在进行粒子更新时需要知道测量噪声的概率分布以计算似然函数,这使得SMC-PHDF依赖于测量噪声的概率模型。针对这一点不足,提出一种未知测量噪声分布下的多目标跟踪算法——基于风险评估的概率假设密度滤波(RE-PHDF)。该算法在SMC-PHDF进行概率假设密度(PHD)粒子更新时采用风险函数计算每个PHD粒子的风险值,并通过一个风险评估函数评估每个PHD粒子,然后用评估后的结果更新粒子的权值。由于粒子更新时避免了在多维测量空间中计算似然函数,算法不仅不依赖于测量噪声的概率分布,还可以节省大量计算时间。仿真结果表明：和SMC-PHDF相比,RE-PHDF在未知的复杂测量噪声环境下具有更高的鲁棒性和稳定性;同时,在两种算法跟踪精度接近的情况下,所提算法节省了50%的运行时间。     

Integrated track maintenance for the PMHT via the hysteresis model

Unlike other tracking algorithms the probabilistic multi-hypothesis tracker (PMHT) assumes that the true source of each measurement is an independent realisation of a random process. Given knowledge of the prior probability of this assignment variable, data association is performed independently for each measurement. When the assignment prior is unknown, it can be estimated provided that it is either time independent, or fixed over the batch. This paper presents a new extension of the PMHT, which incorporates a randomly evolving Bayesian hyperparameter for the assignment process. This extension is referred to as the PMHT with hysteresis. The state of the hyperparameter reflects each model's contribution to the mixture, and thus can be used to quantify the significance of mixture components. The paper demonstrates how this can be used as a method for automated track maintenance in clutter. The performance benefit gained over the standard PMHT is demonstrated using simulations and real sensor data     

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.     

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.     

The turbo PMHT

The PMHT (probabilistic multihypothesis tracker) uses "soft" a posteriori probability associations between measurements and targets. Its implementation is a straightforward iterative application of a Kalman smoother operating on "synthetic" (i.e., modified) measurements, and of recalculation of these synthetic measurements based on the current track estimate. In this correspondence, we first discuss the basic PMHT and some of the older PMHT variants that have been used to enhance convergence. We then introduce the new turbo PMHT, which is informed by the recent success of turbo decoding in the digital communication context. This new PMHT has performance substantially improved versus any of the previous versions.     

Uniform versus nonuniform sampling when tracking in clutter

Many target tracking subsystems have the ability to schedule their own data rates; essentially they can "order" new information whenever they need it, and the cost is in terms of the sensor resource. But among the unmanaged schemes, uniform sampling, in which a new measurement is requested periodically and regularly, is the most commonly-used sampling scheme; deliberately nonuniform schemes are seldom given serious consideration. In this paper, however, we show that such schemes may have been discarded prematurely: a nonuniform sampling can have its benefits. Specifically, the nonuniform and uniform sampling schemes are compared for two kind of trackers: the probabilistic data association filter (PDAF), which updates its track based on a single scan of information at a time; and N-D assignment (an optimization-based implementation of the multi-hypothesis tracker (MHT)), in which the sliding window involves many scans of observations. We find that given the ground rule of maintenance of the same overall scan rate (i.e., the same sensor effort) uniform sampling is always optimal for the single-scan tracker in the sense of track life. However, nonuniform sampling can outperform uniform sampling if a more sophisticated multi-scan tracker is used, particularly when 1) the target has a high process noise, and/or 2) the false alarm density is high, and/or 3) the probability of detection is high.     

基于Python的激光跟踪仪设站优化系统的开发

采用Python语言结合DAKOTA优化平台的方案,按照面向对象的编程思想,成功地开发了激光跟踪仪设站优化系统。实现了在使用激光跟踪仪对飞机装配型架测量安装前,预先对设站位置优化,找出最佳设站位置。从而避免因设站位置不佳而造成不必要的转站,提高了测量安装精度。     

一种密集多回波环境下的机动多目标跟踪起始算法

 本文研究密集多回波环境下的机动多目标跟踪起始问题。文中首先提出主跟踪子空间和边缘跟踪子空间的定义与性质,接着修正Bayes轨迹确定方法BTC,并将其与具有残差滤波的修正概率数据关联滤波算法MPDAF-RF有机地结合起来,提出一种适合高密集多回波环境的机动多目环跟踪起始方法——“全邻”Bayes跟踪起始算法ABTI。Monte Carlo仿真表明,本文所给出的算法不仅克服了一类概率数据关联滤波方法没有跟踪起始机理的缺陷,而且辨别目标与虚警的能力很强,不失为解决高密集多回波环境下机动多目标跟踪起始的有效方法。     

残差滤波及其在密集多回波环境下机动多目标跟踪中的应用

 修正概率数据关联滤波（MPDAF）是目前解决密集多回波环境下机动多目标跟踪较为有效的方法,但当回波密度增高时,该方法容易失跟。本文针对此特点,在MPDAF基础上,提出了残差滤波（RF）方法,分别从理论和Monte carlo仿真两方面揭示了RF与数据关联的内在机理,结果表明该方法能大幅度提高跟踪滤波器捕捉目标和剔除关联域内多余回波的能力以及跟踪的性能,是一种解决高密集多回波环境下机动多目标跟踪的有效方法。     

Precession–nutation correction for star tracker attitude measurement of STECE satellite

Space Technology Experiment and Climate Exploration(STECE) is a small satellite mission of China for space technology experiment and climate exploration. A new test star tracker and one ASTRO 10 star tracker have been loaded on the STECE satellite to test the new star tracker's measurement performance. However,there is no autonomous precession–nutation correction function for the test star tracker,which causes an apparent periodic deflection in the inter-boresight angle between the two star trackers with respect to each other of up to ±500 arcsec,so the precession and nutation effect needs to be considered while assessing the test star tracker. This paper researches on the precession–nutation correction for the test star tracker's attitude measurement and presents a precession–nutation correction method based on attitude quaternion data. The periodic deflection of the inter-boresight angle between the two star trackers has been greatly eliminated after the precession and nutation of the test star tracker's attitude data have been corrected by the proposed method and the validity of the proposed algorithm has been demonstrated. The in-flight accuracy of the test star tracker has been assessed like attitude noise and low-frequency errors after the precession–nutation correction.     

Data Association and Track Management for the Gaussian Mixture Probability Hypothesis Density Filter

The Gaussian mixture probability hypothesis density (GM-PHD) recursion is a closed-form solution to the probability hypothesis density (PHD) recursion, which was proposed for jointly estimating the time-varying number of targets and their states from a sequence of noisy measurement sets in the presence of data association uncertainty, clutter, and miss-detection. However the GM-PHD filter does not provide identities of individual target state estimates, that are needed to construct tracks of individual targets. In this paper, we propose a new multi-target tracker based on the GM-PHD filter, which gives the association amongst state estimates of targets over time and provides track labels. Various issues regarding initiating, propagating and terminating tracks are discussed. Furthermore, we also propose a technique for resolving identities of targets in close proximity, which the PHD filter is unable to do on its own.