基于最近邻的集中式多传感器多目标跟踪算法

经典的集中式多传感器多目标跟踪算法通常计算量较大,经常难以满足系统的实时性要求,工程上实现起来比较困难,为进一步扩大集中式多传感器的应用范围,使其在对算法实时性要求较高、跟踪精度要求较小的实际场合中广泛应用。文章基于最近邻域思想,研究了并行处理结构的集中式多传感器最近邻域算法,并从算法跟踪精度、实时性、有效跟踪率3个方面对其与经典的顺序多传感器联合概率数据互联算法进行了仿真比较。经仿真验证,并行处理结构的集中式多传感器最近邻域算法实时性提高了60%以上,且在跟踪背景杂波适中的情况下能够有效跟踪目标。     

基于神经网络的广义经典分配航迹关联算法

在序贯航迹关联算法的基础上提出了一种广义经典分配航迹关联算法。此算法实际上是求约束条件下的函数最小值问题,属于组合优化问题,其计算复杂度随着目标数的增加而发生爆炸现象。根据Hop field神经网络模型解决此类问题的能力对此广义经典问题进行了求解。仿真实验结果表明,广义经典分配算法能够有效地解决航迹关联问题,而且用神经网络求解此问题降低了计算复杂性,并具有很高的关联正确率。     

神经网络在广义经典分配问题中的应用

在两节点分布式多传感器系统中,一些航迹关联算法可以化为广义经典分配问题。广义经典分配问题是一个组合优化问题。当目标数目较多时,很难得到问题的最优解,而且其计算量容易呈现指数爆炸现象。文章提出了用Hopfield神经网络和平均场网络解决此问题的方法。仿真结果表明,采用文章提出的人工神经网络模型求解广义经典分配问题,不仅使航迹关联具有较高的关联正确率,而且计算时间不会出现指数爆炸现象。仿真结果还表明,平均场网络相比Hopfield神经网络更易于得到问题的最优解。     

A Study on Particle Filters for Single-Tone Frequency Tracking

In this paper, we present an online approach for frequency tracking of a noisy sinusoid using sequential Monte Carlo (SMC) methods, also known as particle filters (PFs). In addition, apart from employing the classical Cartesian formulation model, we also develop two alternative dynamical models, namely, nearly constant frequency (NCF) and Singer, which are adapted from the maneuvering target tracking discipline, to describe the evolution of time-varying frequencies, and investigate their fitness to the frequency tracking application. When compared with conventional techniques whose performance is restricted to linear Gaussian models and/or to slowly varying frequencies, PFs are more flexible to handle situations where these conditions are violated. Extensive evaluations on the proposed new models and PF tracking algorithms are conducted with different sets of frequency inputs and levels of signal-to-noise ratio (SNR). According to the computer simulation results, it is found that PFs under all investigated models consistently outperform and are less sensitive to SNR levels than the extended Kalman filter (EKF). Furthermore, the results suggest that while none of the models perfectly fits all types of frequency inputs, NCF model is more suitable for moderately varying frequencies, whereas the Singer is more suitable for rapidly changing frequencies.     

Test sequencing problem arising at the design stage for reducing life cycle cost

Previous test sequencing algorithms only consider the execution cost of a test at the application stage. Due to the fact that the placement cost of some tests at the design stage is considerably high compared with the execution cost, the sequential diagnosis strategy obtained by previous methods is actually not optimal from the view of life cycle. In this paper, the test sequencing problem based on life cycle cost is presented. It is formulated as an optimization problem, which is non-deterministic polynomial-time hard (NP-hard). An algorithm and a strategy to improve its computational efficiency are proposed. The formulation and algorithms are tested on various simulated systems and comparisons are made with the extant test sequencing methods. Application on a pump rotational speed control (PRSC) system of a spacecraft is studied in detail. Both the simulation results and the real-world case application results suggest that the solution proposed in this paper can significantly reduce the life cycle cost of a sequential fault diagnosis strategy.     

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.     

Adaptive Optical Target Detection Using Correlated Images

A method for target detection that achieves clutter rejection by the use of multiple observations of the same target scene is developed. Multiple scene observations can be obtained by processing separate frequency bands of the same target scene or by recursively processing sequential observations in time. Optimal detection algorithms are developed, based on the assumption that the image intensity can be modeled as a variable mean spatial Gaussian process. Several fast detection algorithms are derived which make use of the fact that the covariance matrices of many optical and infrared (IR) images can be accurately approximated by diagonal matrices. These algorithms provide efficient solutions to the problem of processing multiple correlated scenes or multiple sequential imaging. Computer simulations based on actual optical and IR image data were used for checking the theoretical results. The new detection algorithms achieved performance improvement in detection signal-to-noise ratio of up to 10 dB over conventional target correlation methods.     

一种分散化多站联合目标跟踪算法

 本文基于分散估计理论的基本原理,考虑各子站基于不同坐标系这个一般情形,给出了一种新的分散化多站联合目标跟踪算法。并针对子站间四种不同的通讯方式,对算法进行了仿真。结果表明,本文的最优合成算法即使在各个子站由于缺少足够的信息而得到错误估计的情况下,也能快速地给出正确的估计。     

基于多代理模型的航空发动机建模及优化方法

为了进一步提高航空发动机建模及优化方法的性能,本文提出了一种基于多代理模型技术的建模及优化方法。本文首先提出了一种新的代理模型全局误差估计方法,以此建立了新的多代理模型建模方法。然后提出了一种组合模型预测偏差估计方法,以此发展了一种基于多代理模型技术的优化方法。6个不同维度及不同训练集大小的解析测试算例的结果表明,本文所发展的建模方法相较于现有方法精度更高,本文所发展的优化方法相较于经典代理模型优化方法算法收敛性更强。同时变循环发动机稳态性能建模及加速燃油控制规律优化实例表明,本文所发展的方法在处理实际工程问题时,依旧可以表现出良好的算法性能。     

Performance evaluation for MAP state estimate fusion

This paper presents a quantitative performance evaluation method for the maximum a posteriori (MAP) state estimate fusion algorithm. Under ideal conditions where data association is assumed to be perfect, it has been shown that the MAP or best linear unbiased estimate (BLUE) fusion formula provides the best linear minimum mean squared estimate (LMMSE) given local estimates under the linear Gaussian assumption for a static system. However, for a dynamic system where fusion is recursively performed by the fusion center on local estimates generated from local measurements, it is not obvious how the MAP algorithm will perform. In the past, several performance evaluation methods have been proposed for various fusion algorithms, including simple convex combination, cross-covariance combination, information matrix, and MAP fusion. However, not much has been done to quantify the steady state behavior of these fusion methods for a dynamic system. The goal of this work is to present analytical fusion performance results for MAP state estimate fusion without extensive Monte Carlo simulations, using an approach developed for steady state performance evaluation for track fusion. Two different communication strategies are considered: fusion with and without feedback to the sensors. Analytic curves for the steady state performance of the fusion algorithm for various communication patterns are presented under different operating conditions.     

基于相位相关的部分可辨编队精细起始算法

针对部分可辨条件下编队目标的精细起始难题,提出了一种基于相位相关的部分可辨编队精细起始算法。首先,采用基于坐标映射距离差分的快速群分割与基于编队中心点的预互联对雷达量测进行预处理;然后,利用图像匹配中相位相关特性,将相邻时刻编队结构进行补偿对准,解决了低目标发现概率情况下的编队结构对准问题;最后,采用增加虚拟量测并后验判决的方式,结合最近邻法做编队航迹精细互联,在填补航迹缺失、增加正确航迹的同时抑制虚假航迹的产生。经仿真验证,与修正的逻辑法、基于相对位置矢量的灰色编队精细起始算法相比,本文所提算法在提高航迹正确起始率、抑制虚假航迹方面性能优势显著,且对环境杂波与雷达精度具有较好的鲁棒性,对目标发现概率具有较好的适应性。     

序贯结构的Sage-Husa自适应滤波及其应用

在分析已有的Sage-Husa自适应滤波算法的基础上,本文首先推导了两种量测噪声自适应估计方法的等价性。为充分利用组合系统中已知的部分量测噪声参数,提高滤波稳定性和精度,研究了基于序贯结构的Sage-Husa自适应滤波算法;当组合系统测量噪声参数均为已知时,为降低算法复杂度,提高Sage-Husa自适应滤波的鲁棒性,加入协方差匹配的方法对序贯结构的Sage-Husa自适应滤波算法进行改进;通过在序贯结构下采用相应的信息融合策略,充分利用组合系统的输出信息。将两种算法分别应用于MIMU/GPS/磁强计组合系统中,基于跑车实验的离线数据分析表明,第一种滤波算法的滤波稳定性较标准自适应算法在滤波稳定性上有明显提高;第二种改进的滤波算法既降低了算法复杂度,又提高了抗野值效果,有效保持了组合系统在干扰状态下的导航精度。     

Closed-form posterior Cramer-Rao bounds for bearings-only tracking

We address the classical bearings-only tracking problem (BOT) for a single object, which belongs to the general class of nonlinear filtering problems. Recently, algorithms based on sequential Monte-Carlo methods (particle filtering) have been proposed. As far as performance analysis is concerned, the posterior Cramer-Rao bound (PCRB) provides a lower bound on the mean square error. Classically, under a technical assumption named "asymptotic unbiasedness assumption", the PCRB is given by the inverse Fisher information matrix (FIM). The latter is computed using Tichavsky's recursive formula via Monte-Carlo methods. Two major problems are studied here. First, we show that the asymptotic unbiasedness assumption can be replaced by an assumption which is more meaningful. Second, an exact algorithm to compute the PCRB is derived via Tichavsky's recursive formula without using Monte-Carlo methods. This result is based on a new coordinate system named logarithmic polar coordinate (LPC) system. Simulation results illustrate that PCRB can now be computed accurately and quickly, making it suitable for sensor management applications     

基于分段序列离散度的异步航迹关联算法

为解决异步不等速率航迹关联问题，提出一种基于分段序列离散度的异步航迹关联算法。定义分段混合航迹序列的离散信息度量，给出不等长航迹序列分段划分规则，通过计算离散度，利用经典分配法进行关联判定，并针对多义性问题设置二次检验环节。与传统算法相比，不需要时间对准，且具有不受噪声分布影响的特点。仿真结果表明，算法在航迹异步、传感器采样率不同等条件下均能以较高正确率稳定关联，并可有效分辨航迹交叉、分叉和合并等复杂情况，具有明显的优势。     

基于相对位置矢量的群目标灰色精细航迹起始算法

为解决群内目标精细航迹起始的难题,基于对传统航迹起始算法及现有群目标航迹起始算法优缺点的分析,给出了完整的群目标航迹起始框架,并提出了一种基于相对位置矢量的群目标灰色精细航迹起始算法。首先基于循环阈值模型、群中心点进行群的预分割、预关联,然后对预关联成功的群搜索对应坐标系,建立群中各量测的相对位置矢量,基于灰色精细互联模型完成群内量测的互联,最后基于航迹确认规则得到群目标状态矩阵。经仿真数据验证,与修正的逻辑法、基于聚类和Hough变换的多编队航迹起始算法相比,该算法在起始真实航迹、抑制虚假航迹及杂波鲁棒性等方面综合性能更优。     

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

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

基于序贯关联算法的多目标无源跟踪

基于序贯关联算法,对多目标无源跟踪问题进行了研究。在只有角度信息可以利用的情况下,首先,利用波门技术对各个无源传感器角度测量数据进行关联和滤波,形成参数航迹;然后,将各个无源传感器的参数航迹送到融合中心进行关联配对,并在关联过程中通过构造关联质量函数对参数航迹的关联历史情况进行度量,解决参数航迹关联模糊问题;最后,通过对关联成功的参数航迹进行交叉定位,给出多个不同目标的位置信息,实现分布式无源系统对多目标的数据关联和跟踪,并通过仿真分析,对算法的有效性和可行性进行验证。     

Neural network directed Bayes decision rule for moving targetclassification

In this paper, a new neural network directed Bayes decision rule is developed for target classification exploiting the dynamic behavior of the target. The system consists of a feature extractor, a neural network directed conditional probability generator and a novel sequential Bayes classifier. The velocity and curvature sequences extracted from each track are used as the primary features. Similar to hidden Markov model scheme, several hidden states are used to train the neural network, the output of which is the conditional probability of occurring the hidden states given the observations. These conditional probabilities are then used as the inputs to the sequential Bayes classifier to make the classification. The classification results are updated recursively whenever a new scan of data is received. Simulation results on multiscan images containing heavy clutter are presented to demonstrate the effectiveness of the proposed methods     

Monte Carlo filtering for multi target tracking and data association

We present Monte Carlo methods for multi-target tracking and data association. The methods are applicable to general nonlinear and non-Gaussian models for the target dynamics and measurement likelihood. We provide efficient solutions to two very pertinent problems: the data association problem that arises due to unlabelled measurements in the presence of clutter, and the curse of dimensionality that arises due to the increased size of the state-space associated with multiple targets. We develop a number of algorithms to achieve this. The first, which we refer to as the Monte Carlo joint probabilistic data association filter (MC-JPDAF), is a generalisation of the strategy proposed by Schulz et al. (2001) and Schulz et al. (2003). As is the case for the JPDAF, the distributions of interest are the marginal filtering distributions for each of the targets, but these are approximated with particles rather than Gaussians. We also develop two extensions to the standard particle filtering methodology for tracking multiple targets. The first, which we refer to as the sequential sampling particle filter (SSPF), samples the individual targets sequentially by utilising a factorisation of the importance weights. The second, which we refer to as the independent partition particle filter (IPPF), assumes the associations to be independent over the individual targets, leading to an efficient component-wise sampling strategy to construct new particles. We evaluate and compare the proposed methods on a challenging synthetic tracking problem.     

Detection of Target Maneuver Onset

A classical maneuvering target tracking (MTT) problem (detection of the onset of a target maneuver) is presented in two parts. The first part reviews most traditional maneuver onset detectors and presents results from a comprehensive simulation study and comparison of their performance. Six algorithms for maneuver onset detection are examined: measurement residual chi-square, input estimate chi-square, input estimate significance test, generalized likelihood ratio (GLR), cumulative sum, and marginalized likelihood ratio (MLR) detectors. The second part proposes two novel maneuver onset detectors based on sequential statistical tests. Cumulative sums (CUSUM) type and Shiryayev sequential probability ratio (SSPRT) maneuver onset detectors are developed by using a likelihood marginalization technique to cope with the difficulty that the target maneuver accelerations are unknown. The proposed technique gives explicit solutions for Gaussian-mixture prior distributions, and can be applied to arbitrary prior distributions through Gaussian-mixture approximations. The approach essentially utilizes a~priori information about the maneuver accelerations in typical tracking engagements and thus allows to improve detection performance as compared with traditional maneuver detectors. Simulation results demonstrating the improved capabilities of the proposed onset maneuver detectors are presented.