对偶型最大熵概率密度函数模型及其优化解法

针对经典型最大熵概率密度函数模型及其计算目前存在的非线性程度高,优化不收敛,求解效率低等问题,提出了一种对偶型最大熵概率密度函数模型+逐次优化的方法.根据优化过程不稳定,重新推导了拉格朗日系数的线性变换公式.针对几种常见及一种复杂的概率密度函数,采用经典型与对偶型最大熵概率密度函数模型分别计算概率密度及可靠度的对比表明:与经典型最大熵概率密度函数模型相比,对偶型最大熵概率密度函数模型优化函数形式简单,非线性程度低.逐次优化法求解拉格朗日系数不仅克服了初始值敏感性问题,而且计算效率高.对偶型最大熵概率密度函数模型+逐次优化法与其他方法相比,计算精度最高,且能很好的应用于复杂概率分布及可靠性问题.      

Satellite intercept targeting DSP algorithm design and evaluation

A unified processing approach for the detection and localization of satellites or other exoatmospheric targets is presented. Enhanced filtering and centroid determination algorithms were developed based on real-time implementation constraints, mission conditions including accuracy requirements, and signature structure. The signature structure consisted of target returns, high-frequency random noise, low-frequency structured noise, and contamination sources resulting from debris and cosmic events. Detailed signal processing analyses were performed to verify the required subsample accuracy and the sensitivity to hardware and system constraints. The resultant system design was functionally verified in a real-time breadboard processor     

一种新的有效的群签名方案

介绍了一种有效的群签名方案。该方案的安全性是基于译码问题的难度和线性码的纠删特性和ElGamal签名方案的安全性。已知[n,k,d]码和相应的数字签名方案,则签名和群公钥的长度分别是n+5和n2+5。对于方案的计算代价,签名过程除O(n)算术运算外基本上与ElGamal方案相同;打开签名的过程非常有效,只需O(d2)运算量。方案允许新成员加入群时不修改群公钥。通过向某些成员分发新的成员资格证书,可以将成员从群中删除。     

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     

Bayesian gamma mixture model approach to radar target recognition

This paper develops a Bayesian gamma mixture model approach to automatic target recognition (ATR). The specific problem considered is the classification of radar range profiles (RRPs) of military ships. However, the approach developed is relevant to the generic discrimination problem. We model the radar returns (data measurements) from each target as a gamma mixture distribution. Several different motivations for the use of mixture models are put forward, with gamma components being chosen through a physical consideration of radar returns. Bayesian formalism is adopted and we obtain posterior distributions for the parameters of our mixture models. The distributions obtained are too complicated for direct analytical use in a classifier, so Markov chain Monte Carlo (MCMC) techniques are used to provide samples from the distributions. The classification results on the ship data compare favorably with those obtained from two previously published techniques, namely a self-organizing map and a maximum likelihood gamma mixture model classifier.     

Wavelet preprocessing for high range resolution radarclassification

We develop a wavelet denoising scheme to aid an automatic target recognition (ATR) system in recognizing aircraft from high range resolution radar (HRR) signatures. A template matching classification technique is used with templates formed from synthetically generated signatures. The goal of the classification system is to achieve classification accuracy equivalent to that obtained with measured HRR signatures. Results suggest that a large portion of HRR signature content is nondiscriminatory. The wavelet denoising process removes the nondiscriminatory information, thereby leading to remarkable increases in classification accuracy. Results are shown for HRR signatures from six aircraft     

最大熵分位值估计及其对偶型优化解法

针对经典最大熵分位值估计中拉格朗日系数计算目前存在高度非线性、计算结果精度不高或有时难以收敛等问题,提出了一种对偶型 逐次寻优的方法.基于拉格朗日对偶法,推导建立了含有拉格朗日系数优化函数的对偶表达式;在此基础上,基于样本的概率权重矩约束,提出了逐次寻优算法.针对几种常见的概率分布类型和一种较为复杂的概率分布类型,采用对偶型最大熵方法和经典最大熵方法对其概率累积函数和分位值进行计算对比分析表明:对偶型最大熵分位值估计不仅具有非线性程度低、形式简单,而且对偶型 逐次寻优的方法具有比较高的计算精度,优化迭代的收敛性好等特点.      

非线性滤波方法及其在飞行状态及参数估计中的应用

基于非线性系统高阶近似的思想,提出一种比推广卡尔曼滤波（ＥＫＦ）更接近非线性系统本质的近似滤波方法,并应用于飞行状态的参数估计（或称为飞行轨迹重构）问题。仿真和实际飞行数据计算结果表明：提出的非线性近似滤波方法比ＥＫＦ有更高的估计精度和更好的鲁棒性,对飞机机动形状、数据长度要求不高,滤波收敛速度快。利用飞行状态估计数学模型的具体特点,使计算量和存储量大幅度减少。该方法应用于非线性较强的飞行状态及参数估计问题。可得到比ＥＫＦ更好的结果。     

Neural network learning of low-probability events

In the problem of stationary target identification (STI) via millimeter wave (MMW) seeker radars in heavy clutter environments, it is often necessary to use nonparametric identification procedures, as detailed parametric models of clutter and target returns are generally unavailable. Neural networks provide an attractive approach to perform nonparametric identification. However, when identifying low-probability events, the computational overhead associated with training a neural network can become excessive. This is because low-probability events must be adequately represented in the training sample. We present a modified backpropagation training algorithm based on a likelihood ratio weighting function (LRWF) to train the neural network using a much smaller training set than that required using the standard backpropagation algorithm This algorithm is closely related to the importance sampling technique used in digital communication systems to obtain probability of error estimates by using a much smaller number of simulation runs than what is required with standard Monte Carlo simulation. The modified backpropagation technique results in a significant reduction in computational overhead in training the network, resulting from a substantial reduction in the size of the training set required to achieve a given level of performance. We demonstrate the performance of the algorithm on simulated data for the STI problem in MMW radar     

Sequential Monte Carlo methods for multitarget filtering with random finite sets

Random finite sets (RFSs) are natural representations of multitarget states and observations that allow multisensor multitarget filtering to fit in the unifying random set framework for data fusion. Although the foundation has been established in the form of finite set statistics (FISST), its relationship to conventional probability is not clear. Furthermore, optimal Bayesian multitarget filtering is not yet practical due to the inherent computational hurdle. Even the probability hypothesis density (PHD) filter, which propagates only the first moment (or PHD) instead of the full multitarget posterior, still involves multiple integrals with no closed forms in general. This article establishes the relationship between FISST and conventional probability that leads to the development of a sequential Monte Carlo (SMC) multitarget filter. In addition, an SMC implementation of the PHD filter is proposed and demonstrated on a number of simulated scenarios. Both of the proposed filters are suitable for problems involving nonlinear nonGaussian dynamics. Convergence results for these filters are also established.     

Track monitoring when tracking with multiple 2D passive sensors

A fast method of track monitoring is presented which determines what tracks are good and what tracks have had data association problems and should be eliminated. The philosophy of tracking in a dense target environment with limited central processing unit (CPU) time is to acquire the targets, track them with as simple a filter as will meet requirements, and monitor the tracks to determine if they are still tracking a target or are tracking incorrect returns and should be terminated. After termination the true targets are reacquired. However, it is difficult to determine from simple track monitoring the correct interpretation of a poor track. Poor tracks can be a result of a sensor failure, target maneuver, or incorrect data association. The author describes track monitoring and provides a solution to this dilemma when tracking with multiple two-dimensional passive sensors. The method is much faster than other monitoring methods.<>     

短波信道多普勒扩展仿真与实现

针对直接FIR滤波和多级内插滤波生成衰落因子的算法中存在算法复杂度高、计算效率低、存储空间大等问题,文章研究了一种多级迭代滤波的算法,以降低算法复杂度和减少存储空间,实时生成衰落因子;并进行了算法的复杂度分析和仿真实现,验证了算法的有效性.     

Evaluating a multiple-hypothesis multitarget tracking algorithm

The performance evaluation of multiple-hypothesis, multitarget tracking algorithm is presented. We are primarily interested in target-detection/track-initiation capabilities as measures of performance. Through Monte Carlo simulations, a multiple-hypothesis tracking algorithm was evaluated in terms of 1) probability of establishing a track from target returns and 2) false track density. A radar was chosen as the sensor, and a general multiple-hypothesis, multitarget tracking algorithm was used in the Monte Carlo simulations. The simulation results predict the probability of establishing a track from returns of a target as well as the false track density per scan volume per unit time. The effects of the target radar cross section and the radar power, measured through the mean signal-to-noise ratio (SNR) were studied, as were the effects of detection threshold and track quality threshold. Computational requirements were also investigated     

Calculation of Probability of Detection with Target Scintillation

This paper presents a computational method for the calculation of probability of detection using measured radar target cross-section data. The described method can also be used for probability of detection calculations when the radar target cross section follows a specified probability density function. Using the computational procedure of the paper, a number of curves are generated which can be used for probability of detection calculations with exponential and Gaussian radar target cross-section distributions. The results obtained using theoretical distributions are compared with the corresponding results using actual target cross-section measurements. The results of computer runs are compared to the corresponding values in the literature where available.     

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

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

Multi-EAP:Extended EAP for multi-estimate extraction for SMC-PHD filter

The ability to extract state-estimates for each target of a multi-target posterior, referred to as multi-estimate extraction (MEE), is an essential requirement for a multi-target filter, whose key performance assessments are based on accuracy, computational efficiency and reliability. The probability hypothesis density (PHD) filter, implemented by the sequential Monte Carlo approach, affords a computationally efficient solution to general multi-target filtering for a time-varying num-ber of targets, but leaves no clue for optimal MEE. In this paper, new data association techniques are proposed to distinguish real measurements of targets from clutter, as well as to associate par-ticles with measurements. The MEE problem is then formulated as a family of parallel single-estimate extraction problems, facilitating the use of the classic expected a posteriori (EAP) estima-tor, namely the multi-EAP (MEAP) estimator. The resulting MEAP estimator is free of iterative clustering computation, computes quickly and yields accurate and reliable estimates. Typical sim-ulation scenarios are employed to demonstrate the superiority of the MEAP estimator over existing methods in terms of faster processing speed and better estimation accuracy.     

基于自适应粒子滤波的涡扇发动机故障诊断

针对涡扇发动机非线性、非高斯的特点,提出了一种自适应的粒子滤波算法用于涡扇发动机气路部件突变故障的诊断.为了减小算法的计算量并且保证滤波精度,分析了滤波精度和样本数目的关系,提出根据滤波过程中状态的方差自适应地调整粒子数,在保证一定的滤波精度下可以有效地减少滤波过程中使用的粒子数,提高了算法的实时性.同时,引入扩展卡尔曼滤波(EKF)用于更新粒子,产生重要概率密度函数,在一定程度上避免了粒子的退化.通过某型涡扇发动机的仿真分析表明:改进的算法相比标准粒子滤波算法用于涡扇发动机气路部件故障诊断时,参数估计的方均根误差减小了50%左右,且算法的计算量减小了30%.     

Adaptive learning approach to landmine detection

We consider landmine detection using forward-looking ground penetrating radar (FLGPR). The two main challenging tasks include extracting intricate structures of target signals and adapting a classifier to the surrounding environment through learning. Through the time-frequency (TF) analysis, we find that the most discriminant information is TF localized. This observation motivates us to use the over-complete wavelet packet transform (WPT) to sparsely represent signals with the discriminant information encoded into several bases. Then the sequential floating forward selection method is used to extract these components and thereby a neural network (NNW) classifier is designed. To further improve the classification performance and deal with the problem of detecting mines in an unconstraint environment, the AdaBoost algorithm is used. We integrate the feature selection process into the original AdaBoost algorithm. In each iteration, AdaBoost identifies the hard-to-learn examples and a new set of features which provide the specific discriminant information for these hard samples is extracted adaptively and a new classifier is trained. Experimental results based on measured data are presented, showing that a significant improvement on the classification performance can be achieved.     

Detection of Changes in the Characteristics of a Gauss-Markov Process

By an extension to the theory of sequential detection with dependent measurements, it is possible to develop a sequential probability ratio test (SPRT) to detect changes in regime in a Gauss-Markov process rather than detecting which of the two regimes exists. It is shown how a posterior form of this extended SPRT may be simplified to reduce computational complexity. The simplified SPRT's are in fact modifications of the original SPRT detecting the regime and not the change. The tests are applied to the problem of fault detection in a gyro navigational system; the results of a detailed computer simulation are given.