Sequence comparison techniques for multisensor data fusion andtarget recognition

A new class of techniques for multisensor fusion and target recognition is proposed using sequence comparison by dynamic programming and multiple model estimation. The objective is to fuse information on the kinematic state and “nonkinematic” signature of unclassified targets, assessing the joint likelihood of all observed events for recognition. Relationships are shown to previous efforts in pattern recognition and state estimation. This research applies “classical” speech processing-related and other sequence comparison methods to moving target recognition, extends the efforts of previous researchers through improved fusion with kinematic information, relates the proposed techniques to Bayesian theory, and applies parameter identification methods to target recognition for improved understanding of the subject in general. The proposed techniques are evaluated and compared with existing approaches using the method of generalized ambiguity functions, which lends to a form of Cramer-Rao lower bound for target recognition     

基于证据理论的模糊信息融合及其在目标识别中的应用

信息融合系统中的不确定性信息常常表现为模糊性和随机性信息。提出了一种在证据理论框架下实现模糊信息融合的方法。该方法首先基于随机集理论刻画模糊信息的隶属函数,获得了模糊观测下具有概然特性的似然函数,该似然函数表示在收集的模糊信息下确定为某一目标的可能性,在数值上表示了传感器信息对某一命题支持的程度,利用似然函数确定传感器输出的基本概率指派,最后利用Dempster-Shafer组合规则实现多传感器信息融合。     

Multi-aspect radar target recognition method based on scattering centers and HMMs classifiers

A hidden Markov model (HMM)-based method for recognizing aerial targets according to the sequential high-range-resolution (HRR) radar signature is presented. Its recognition features are the location information of scattering centers extracted from the HRR radar echoes by the relax algorithm. The HMM is used to characterize the spatio-temporal information of a target. Several HMMs are cascaded in a chain to model the variation in the target orientation and used as classifiers. Computer simulations with the inverse synthetic aperture radar (ISAR) data are given to demonstrate that for an open-set recognition, average class-recognition rates of 84.50% and 89.88% are achieved, respectively, under two given conditions.     

海天背景舰船红外目标识别技术研究

通过对舰船红外目标特性与识别方法的讨论,给出了图像序列目标识别算法流程以及仿真实验的结果,并对工程实现自动目标识别的硬件、算法和软件设计进行了讨论,具有较好的理论和应用价值。     

Efficient particle filtering for road-constrained target tracking

The variable-structure multiple-model particle filtering approach for state estimation of road-constrained targets is addressed. The multiple models are designed to account for target maneuvers including "move-stop-move" and motion ambiguity at an intersection; the time-varying active model sets are adaptively selected based on target state and local terrain condition. The hybrid state space is partitioned into the mode subspace and the target subspace. The mode state is estimated based on random sampling; the target state as well as the relevant likelihood function associated with a mode sample sequence is approximated as Gaussian distribution, of which the conditional mean and covariance are deterministically computed using a nonlinear Kalman filter which accounts for road constraints in its update. The importance function for the sampling of the mode state approximates the optimal importance function under the same Gaussian assumption of the target state.     

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.     

Predicting an upper bound on SAR ATR performance

We present a method for predicting a tight upper bound on performance of a vote-based approach for automatic target recognition (ATR) in synthetic aperture radar (SAR) images. In such an approach, each model target is represented by a set of SAR views, and both model and data views are represented by locations of scattering centers. The proposed method considers data distortion factors such as uncertainty, occlusion, and clutter, as well as model factors such as structural similarity. Firstly, we calculate a measure of the similarity between a given model view and each view in the model set, as a function of the relative transformation between them. Secondly we select a subset of possible erroneous hypotheses that correspond to peaks in similarity functions obtained in the first step. Thirdly, we determine an upper bound on the probability of correct recognition by computing the probability that every selected hypothesis gets less votes than those for the model view under consideration. The proposed method is validated using MSTAR public SAR data, which are obtained under different depression angles, configurations, and articulations     

Maximum likelihood track-before-detect with fluctuating targetamplitude

An important problem in target tracking is the detection and tracking of targets in very low signal-to-noise ratio (SNR) environments. In the past, several approaches have been used, including maximum likelihood. The major novelty of this work is the incorporation of a model for fluctuating target amplitude into the maximum likelihood approach for tracking of constant velocity targets. Coupled with a realistic sensor model, this allows the exploitation of signal correlation between resolution cells in the same frame, and also from one frame to the next. The fluctuating amplitude model is a first order model to reflect the inter-frame correlation. The amplitude estimates are obtained using a Kalman filter, from which the likelihood function is derived. A numerical maximization technique avoids problems previously encountered in “velocity filtering” approaches due to mismatch between assumed and actual target velocity, at the cost of additional computation. The Cramer-Rao lower bound (CRLB) is derived for a constant, known amplitude case. Estimation errors are close to this CRLB even when the amplitude is unknown. Results show track detection performance for unknown signal amplitude is nearly the same as that obtained when the correct signal model is used     

Performance complexity study of several approaches to automatictarget recognition from SAR images

A framework which allows for the direct comparison of alternate approaches to automatic target recognition (ATR) from synthetic aperture radar (SAR) images is described and applied to variants of several ATR algorithms. This framework allows comparisons to be made on an even footing while minimizing the impact of implementation details and accounts for variation in image sizes, in angular resolution, and in the sizes of orientation windows used for training. Alternate approaches to ATR are characterized in terms of the best achievable performance as a function of the complexity of the model parameter database. Several approaches to ATR from SAR images are described and the performance achievable by each for a range of database complexities is studied and compared. These approaches are based on a likelihood test under a conditionally Gaussian model, log-magnitude least squared error, and quarter power least squared error. All approaches are evaluated for a wide range of parameterizations and the dependence on these parameters of both the resulting performance and the resulting database complexity is explored. Databases for all of the approaches are trained using identical sets of images and their performance is assessed under identical testing scenarios in terms of probability of correct classification, confusion matrices, and orientation estimation error. The results indicate that the conditionally Gaussian approach outperforms the other two approaches on average for both target recognition and orientation estimation, that accounting for radar power fluctuation improves performance for all three methods, and that the conditionally Gaussian approach normalized for power delivers average performance that is equal or superior to all other considered approaches     

基于深度学习的突防控制博弈对象匹配方法CSCD

针对基于博弈理论设计应对多枚拦截弹的协同突防控制方案时需要确定博弈对象的问题,提出了一种基于长短时记忆(LSTM)网络的拦截弹攻击对象匹配方法。基于传统防空导弹飞行时序与流程构建拦截弹飞行轨迹库,以轨迹库为训练样本对LSTM网络进行训练,并以此为基础构建航迹预测模型与对象匹配模型,实现对拦截弹攻击对象的识别。仿真结果表明,该方法能够有效识别拦截弹拦截目标,为后续的巡航弹突防研究提供支撑。     

Bias and Standard Deviation of the Estimator for the Underlying Probability in a Sequence of Bernoulli Trials with Preselected Number of Successes

In a sequence of Bernoulli trials which stops after a preselected number M of successes, the maximum likelihood estimator of the underlying probability is given by the ratio of M and the required number of observations. Closed-form expressions for the bias and standard deviation of this estimator are developed.     

探测点序列的最优化与简化计算方法

在搜索状态建模和求解一阶搜索状态方程的特征迹线解的基础上,建立了对随机运动进行离散时间探测的发现概率最优控制模型,结合动态规划原理给出一种最优探测点序列的逼近算法,并给出了短时计算的算法简化形式。在满足一阶搜索状态方程的随机恒速目标条件以及有限指数探测函数条件下,将给出的算法及其简化形式应用到算例。算例表明,当随机恒速运动目标初始位置和速度均服从圆正态分布时,该算法及其简化形式均能够由任意给定的初始探测点序列优化收敛到满足精度要求的最优探测点序列。     

An online ensemble semi-supervised classification framework for air combat target maneuver recognition

Online target maneuver recognition is an important prerequisite for air combat situation recognition and maneuver decision-making. Conventional target maneuver recognition methods adopt mainly supervised learning methods and assume that many sample labels are available. However, in real-world applications, manual sample labeling is often time-consuming and laborious. In addition, airborne sensors collecting target maneuver trajectory information in data streams often cannot process information in real time. To solve these problems, in this paper, an air combat target maneuver recognition model based on an online ensemble semi-supervised classification framework based on online learning, ensemble learning, semi-supervised learning, and Tri-training algorithm, abbreviated as Online Ensemble Semi-supervised Classification Framework (OESCF), is proposed. The framework is divided into four parts: basic classifier offline training stage, online recognition model initialization stage, target maneuver online recognition stage, and online model update stage. Firstly, based on the improved Tri-training algorithm and the fusion decision filtering strategy combined with disagreement, basic classifiers are trained offline by making full use of labeled and unlabeled sample data. Secondly, the dynamic density clustering algorithm of the target maneuver is performed, statistical information of each cluster is calculated, and a set of micro-clusters is obtained to initialize the online recognition model. Thirdly, the ensemble K-Nearest Neighbor (KNN)-based learning method is used to recognize the incoming target maneuver trajectory instances. Finally, to further improve the accuracy and adaptability of the model under the condition of high dynamic air combat, the parameters of the model are updated online using error-driven representation learning, exponential decay function and basic classifier obtained in the offline training stage. The experimental results on several University of California Irvine (UCI) datasets and real air combat target maneuver trajectory data validate the effectiveness of the proposed method in comparison with other semi-supervised models and supervised models, and the results show that the proposed model achieves higher classification accuracy.     

三维模型在SAR图像自动目标识别中的应用

提高高分辨率SAR图像在复杂战场环境中的目标识别能力,对防御未来战争中来自地面目标的威胁具有重要意义。针对地面特定目标的大小、方位、旋转等变化以及强杂波背景给目标识别带来的严重影响,提出将目标的三维模型投影到二维平面,采用余弦傅里叶矩和瑞利分布的CFAR检测方法分别对其矩特征和峰值特征进行提取,利用级联组合分类器对目标识别进行建模分析,并通过试验验证该方法的有效性。结果表明:该方法实现了在特征维数高和姿态变化下的目标识别,而且无需额外增加对制导控制系统的开销。     

基于动态贝叶斯网络的弹头目标融合识别方法

通过分析导弹目标识别问题的特殊性,设计了适用于导弹目标识别的动态贝叶斯网络。根据导弹目标的特点,选取了几种具有较好普适性的目标特征,并给出了每种目标特征的条件概率。通过分析导弹目标识别流程,提出了合理的贝叶斯网络模型。最后经过仿真试验,证明该模型相比单特征识别模型识别概率有明显提高,并且具备较好的稳健性。     

EM-ML algorithm for track initialization using possibly noninformative data

Initializing and maintaining a track for a low observable (LO) (low SNR, low target detection probability and high false alarm rate) target can be very challenging because of the low information content of measurements. In addition, in some scenarios, target-originated measurements might not be present in many consecutive scans because of mispointing, target maneuvers, or erroneous preprocessing. That is, one might have a set of noninformative scans that could result in poor track initialization and maintenance. In this paper an algorithm based on the expectation-maximization (EM) algorithm combined with maximum likelihood (ML) estimation is presented for tracking slowly maneuvering targets in heavy clutter and possibly noninformative scans. The adaptive sliding-window EM-ML approach, which operates in batch mode, tries to reject or weight down noninformative scans using the Q-function in the M-step of the EM algorithm. It is shown that target features in the form of, for example, amplitude information (AI), can also be used to improve the estimates. In addition, performance bounds based on the supplemented EM (SEM) technique are also presented. The effectiveness of new algorithm is first demonstrated on a 78-frame long wave infrared (LWIR) data sequence consisting of an Fl Mirage fighter jet in heavy clutter. Previously, this scenario has been used as a benchmark for evaluating the performance of other track initialization algorithms. The new EM-ML estimator confirms the track by frame 20 while the ML-PDA (maximum likelihood estimator combined with probabilistic data association) algorithm, the IMM-MHT (interacting multiple model estimator combined with multiple hypothesis tracking) and the EVIM-PDA estimator previously required 28, 38, and 39 frames, respectively. The benefits of the new algorithm in terms of accuracy, early detection, and computational load are illustrated using simulated scenarios as well.     

A tracking algorithm for maneuvering targets

A methodology for the tracking of maneuvering targets is presented. A quickest-detection scheme based on the innovation sequence is developed for a prompt detection of target maneuvers. The optimal length of a sliding window that minimizes the maneuver detection delay for a given false-alarm rate is determined. After maneuver detection, the system model is modified by adding a maneuver term. A recursive algorithm is proposed to estimate the maneuver magnitude. With this estimate, a modified Kalman filter is used for tracking. Simulation results demonstrate the superior performance of the algorithm, especially during target maneuvers     

空间进动目标动态散射特性的实验研究

研制了进动目标模型,构建了紧凑场微波暗室动态测量系统,通过暗室实验的方法研究了空间进动目标的动态散射特性,给出了若干典型条件下的全极化宽带测量结果。通过实验可以观察到目标进动引起的多普勒频移,证明了微波雷达对进动目标微多普勒的可观测性,同时观察到弹头常见结构引起的非理想点散射现象。实验结果的分析表明,该实验系统能够有效地揭示进动目标的目标特性和回波调制特性,从而为弹道中段目标的动态电磁散射特性、目标结构反演、运动参数提取和逆合成孔径雷达(ISAR)成像的研究奠定了基础,对于弹道中段目标识别的研究具有重要的意义。     

SAR ATR performance using a conditionally Gaussian model

A family of conditionally Gaussian signal models for synthetic aperture radar (SAR) imagery is presented, extending a related class of models developed for high resolution radar range profiles. This signal model is robust with respect to the variations of the complex-valued radar signals due to the coherent combination of returns from scatterers as those scatterers move through relative distances on the order of a wavelength of the transmitted signal (target speckle). The target type and the relative orientations of the sensor, target, and ground plane parameterize the conditionally Gaussian model. Based upon this model, algorithms to jointly estimate both the target type and pose are developed. Performance results for both target pose estimation and target recognition are presented for publicly released data from the MSTAR program     

Estimation of singularities for intercept point forecasting

In this paper, a recursive approach (an algorithm for estimation of singularity (AES)) is proposed to forecast the intercept point of a target and the pursuing interceptor recognized as the estimated singularity of a nodal cubic curve fitted to the data. The data comprises direction of arrival (DOA) estimates of both target and interceptor obtained at regular intervals of time using the maximum likelihood (ML) DOA estimation method. The estimates of coefficients of the cubic polynomial are given by a recursive least squares solution. From these coefficients, closed-form solutions for angle of interception and intercept time are obtained which are the forecasted coordinates of the intercept point. Experimental results demonstrate performance of the proposed algorithm