Automatic target recognition of radar HRRP based on high order central moments features

The paper addresses the problem of target recognition using High-resolution Radar Range Profiles (HRRP). A novel approach of feature extraction and dimension reduction based on extended high order central moments is proposed in order to reduce the dimension of range profiles. Features extracted from radar HRRPs are normalized and smoothed, and then comparative analysis of the similar approaches is done. The range profiles are obtained by step frequency technique using the two-dimensional backscatters distribution data of four different aircraft models. The template matching method by nearest neighbor rules, which is based on the theory of kernel methods for pattern analysis, is used to classify and identify the range profiles from four different aircrafts. Numerical simulation results show that the proposed approach can achieve good performance of stability, shift independence and higher recognition rate. It is helpful for real-time identification and the engineering implements of automatic target recognition using HRRP. The number of required templates could be reduced considerably while maintaining an equivalent recognition rate.     

雷达目标特征提取的一种方法

针对雷达高分辨率距离像（HRRP）方位敏感性和平移敏感性的问题,在对一维距离像进行预处理的基础上,提取两个平移不变特征：中心矩和熵,并将二者形成组合特征,采用Karhunen—Loeve变换进一步进行特征压缩,运用并比较了最大最小距离判别法和SVM分类器的识别性能．实验结果表明中心矩一熵组合特征提取方法能够显著增强目标的可分性,大大提高识别率。     

Efficient radar target classification using adaptive jointtime-frequency processing

This paper presents a new target recognition scheme via adaptive Gaussian representation, which uses adaptive joint time-frequency processing techniques. The feature extraction stage of the proposed scheme utilizes the geometrical moments of the adaptivity spectrogram. For this purpose, we have derived exact and closed form expressions of geometrical moments of the adaptive spectrogram in the time, frequency, and joint time-frequency domains. Features obtained by this method can provide substantial savings of computational resources, preserving as much essential information for classifying targets as possible. Next, a principal component analysis is used to further reduce the dimension of feature space, and the resulting feature vectors are passed to the classifier stage based on the multilayer perceptron neural network. To demonstrate the performance of the proposed scheme, various thin-wire targets are identified. The results show that the proposed technique has a significant potential for use in target recognition     

Moving target feature extraction for airborne high-range resolutionphased-array radar

We study the feature extraction of moving targets in the presence of temporally and spatially correlated ground clutter for airborne high-range resolution (HRR) phased-array radar. To avoid the range migration problems that occur in HRR radar data, we first divide the HRR range profiles into low-range resolution (LRR) segments. Since each LRR segment contains a sequence of HRR range bins, no information is lost due to the division, and hence, no loss of resolution occurs. We show how to use a vector auto-regressive (VAR) filtering technique to suppress the ground clutter, Then, a parameter estimation algorithm is proposed for target feature extraction. From the VAR-filtered data, the target Doppler frequency and the spatial signature vectors are first estimated by using a maximum likelihood (ML) method. The target phase history and direction-of-arrival (DOA) (or the array steering vector for an unknown array manifold) are then estimated from the spatial signature vectors by minimizing a weighted least squares (WLS) cost function. The target radar cross section (RCS)-related complex amplitude and range-related frequency of each target scatterer are then extracted from the estimated target phase history by using RELAX, which is a relaxation-based high-resolution feature extraction algorithm. Numerical results are provided to demonstrate the performance of the proposed algorithm     

Using range profiles as feature vectors to identify aerospaceobjects

The authors use range profiles as the feature vectors for data representation, and they establish a decision rule based on the matching scores to identify aerospace objects. Reasons for choosing range profiles as the feature vectors are explained, and criteria for determining aspect increments for building the database are proposed. Typical experimental examples of the matching scores and recognition rates are provided and discussed. The results demonstrated can be used for comparison with other identification methods     

A new feature vector using selected bispectra for signalclassification with application in radar target recognition

Radially integrated bispectra (RIB), axially integrated bispectra (AIB), and circularly integrated bispectra (CIB) were used as feature vectors of signals, but many bispectra on integration paths may be redundant, and some bispectra are even baneful for signal classification. To avoid these problems, this paper proposes using selected bispectra with the maximum interclass separability as feature vectors of signals. In radar target recognition, range profiles are suitable feature vectors, but they have two main shortcomings: sensitivity to time shift and aspect dependence. Since the selected bispectra of range profiles are translation invariant and can avoid redundant and baneful bispectra as features, they are thus especially suitable for radar target recognition, which is shown by experiments     

基于特征不变矩的签名鉴别方案

脱机手写签名鉴别的主要困难在于有效特征的提取,因此本文主要围绕提取能反映签名本质的特征进行了相关研究。在具体解决签名鉴别时,一方面要考虑签名的静态特征,另一方面寻找动态特征。重点研究了静态特征。提取静态特征时,利用伪Zernike矩的尺度及位移不变性,计算签名图像的0~10阶伪Zernike矩来组成特征向量。在此基础上,对基于上述两种不同特征的加权欧氏距离分类器进行性能比较,并找到了一个有效的数据融合方案。     

Wavelet-based image coding using nonlinear interpolative vectorquantization

We propose a reduced complexity wavelet-based image coding technique. Here, 64-D (for three stages of decomposition) vectors are formed by combining appropriate coefficients from the wavelet subimages, 16-D feature vectors are then extracted from the 64-D vectors on which vector quantization (VQ) is performed. At the decoder, 64-D vectors are reconstructed using a nonlinear interpolative technique. The proposed technique has a reduced complexity and has the potential to provide a superior coding performance when the codebook is generated using the training vectors drawn from similar images.     

基于数学形态学和BP神经网络的足趾形状识别方法

根据足趾二值图像形状特征,提出基于数学形态学消散度技术的足趾形状特征提取及BP神经网络聚类的足趾形状识别方法。该法依据数学形态学理论提取物体形心,仅受较少边界凹点影响,对噪声不敏感,比几何中心稳定。提取边界上距形心距离稳定并能区分不同形状的特征点及相互关系,生成特征向量。此向量在二维连续空间中,具有平移、旋转、尺度不变特征;在二维离散应用环境中,由平移、旋转、尺度变化造成误差小,稳定性强。用训练成功的BP神经网络,对不同质量足趾图像识别,均能达到较高识别率。大量实验表明,该法是满足识别精度要求、识别率高于其它方法的一种行之有效的足趾形状识别方法。     

基于组合矩的激光成像雷达目标识别算法

随着激光技术的发展,激光成像雷达在现代战争复杂战场环境中逐渐获得了广泛的应用,目前激光成像雷达自动目标识别技术已成为国内外研究的热点问题。提出了基于组合矩的激光成像雷达目标识别算法,从激光成像雷达目标的距离像中提取低阶的Zernike矩、Hu矩和中心矩构成组合矩特征,该特征对距离像噪声不敏感,应用径向基函数(RBF)神经网络对三种地面目标进行分类识别。实验结果表明,该算法与应用Zernike矩和Hu矩特征进行分类识别相比,对三种激光成像雷达地面目标的平均识别率在高载噪比(20dB)下分别提高了1.0%和3.7%;在低载噪比(10dB)下分别提高了11.8%和42.5%;当载噪比高于17dB时,该算法的平均识别率达到100%。因此该算法取得了比较好的识别效果。     

Using covariance intersection for change detection in remote sensing images

In this paper, an unsupervised change detection technique for remote sensing images ac-quired on the same geographical area but at different time instances is proposed by conducting Co-variance Intersection (CI) to perform unsupervised fusion of the final fuzzy partition matrices from the Fuzzy C-Means (FCM) clustering for the feature space by applying compressed sampling to the given remote sensing images. The proposed approach exploits a CI-based data fusion of the membership function matrices, which are obtained by taking the Fuzzy C-Means (FCM) clustering of the fre-quency-domain feature vectors and spatial-domain feature vectors, aimed at enhancing the unsuper-vised change detection performance. Compressed sampling is performed to realize the image local feature sampling, which is a signal acquisition framework based on the revelation that a small collection of linear projections of a sparse signal contains enough information for stable recovery. The experi-mental results demonstrate that the proposed algorithm has a good change detection results and also performs quite well on denoising purpose.     

一种有效的遥感图像目标识别方法

本文提出了一种基于矩不变量和支持矢量机对遥感图像中的目标进行识别的方法，该方法提取目标七个Ｈｕ矩不变量作为特征矢量，应用支撑矢量机方法对其进行分类识别，结果表明，这一方法对仅含有目标和背景的遥感图像具有很好的分类识别结果。此外，我们发现对于不同的图像，其二值化取值范围对识别结果有着直接的影响。     

基于HRRP偶数阶中心矩特征的卫星目标识别

针对高分辨距离像(HRRP)的姿态敏感性和平移变化敏感性,提出用HRRP偶数阶中心矩特征进行目标识别.该方法用小波去噪方法提高HRRP的信噪比,在此基础上提取具有平移不变性的中心矩作为特征向量,为了降低特征矢量的维数,可以只把具有较强稳定性的偶数阶中心矩作为特征向量,以适用于组合特征的最近邻模糊分类算法对中心矩特征进行处理.实测卫星数据的验证结果显示,该方法在减少存储量和计算量的同时取得了非常好的识别效果.     

A new Zernike moments based technique for camera identification and forgery detection

In multimedia forensics, it is important to identify those images that were captured by a specific camera from a given set of N data images as well as detecting the tampered region in these images if forged. This paper presents a new technique based on Zernike moments feature extraction for blindly classifying correlated PRNU images as well as locating the tampered regions in image under investigation. The proposed clustering algorithm is based on estimating the Zernike moments and applying a hierarchical clustering for classification. The forgery detection algorithm is based on picking up the peak Euclidean distance between the Zernike moments vector of blocks of the scaled-down forged image and its corresponding ones in the capturing camera PRNU. As Zernike moments are scale and rotational invariant, its feature when computed using scaled-down PRNU images lead to considerable computation time saving. Simulation examples are given to verify the effectiveness of the proposed techniques when compared to other state-of-the-art techniques even in case of very weakly correlated PRNU.     

Diagnostics of Filtered Analog Circuits with Tolerance Based on LS-SVM Using Frequency Features

Most researchers have used the optimal wavelet coefficients or wavelet energy indicators from the time-domain response of analog circuits to train support vector machines (SVMs) to diagnose faults. In this study, we have proposed two kinds of feature vectors from frequency response data of a filter system to train least squares SVM (LS-SVM) to diagnose faults. The first is defined as the conventional frequency feature vector, which includes the center frequency and the maximum frequency response. The second is a new wavelet feature vector that is composed of the mean and standard deviation of wavelet coefficients. Different feature vectors?? combination and normalization are also discussed in the paper. The results from the simulation data and the real data for two filters showed the following: (1) The proposed method has better diagnostic accuracy than the traditional methods that were based only on the optimal wavelet coefficients or wavelet energy indicators. (2) The diagnostic accuracies using the combined feature vectors were better than those using only the conventional frequency feature vectors or wavelet feature vectors. (3) The best accuracy from using the conventional frequency feature vectors was better than that from using wavelet feature vectors. The proposed method can be extended to diagnostics of other analog circuits that are determined by their frequency characteristics.     

Surface Integral Equation Solutions by Hierarchical Vector Basis Functions and Spherical Harmonics Based Multilevel Fast Multipole Method

The method of moments solution of electromagnetic surface integral equation formulations for perfect electric conductors or impedance boundary objects is obtained using hierarchical vector basis functions. The singular and hypersingular integrals involved in the near field coupling matrix are computed fully numerically using adaptive singularity cancellation technique. Multilevel fast multipole method with spherical harmonics expansion of the $k$-space representations of the basis vectors and the incoming waves at the finest level is utilized for its memory and computation time efficient implementation. Improved performance of the proposed techniques in terms of accuracy, computational time, and memory requirements is demonstrated by comparing various results with some of the existing implementations available in the literature.      

A covariance fitting approach to parametric localization of multiple incoherently distributed sources

In this paper, a new algorithm for parametric localization of multiple incoherently distributed sources is presented. This algorithm is based on an approximation of the array covariance matrix using central and noncentral moments of the source angular power densities. Based on this approximation, a new computationally simple covariance fitting-based technique is proposed to estimate these moments. Then, the source parameters are obtained from the moment estimates. Compared with earlier algorithms, our technique has lower computational cost and obtains the parameter estimates in a closed form. In addition, it can be applied to scenarios with multiple sources that may have different angular power densities, while other known methods are not applicable to such scenarios.