含噪混合盲扰信分离中联合降噪技术研究

针对盲扰信分离技术在含噪混合条件下分离效果差的问题,文章采用经验模态分解和小波变换联合的降噪技术进行分离前的消噪预处理,研究了联合降噪的三种模式,分别对其降噪效果进行了仿真分析,得到了一种较好的联合降噪模式。将该模式与无噪环境下的盲分离算法相结合,弥补了经典盲源分离算法处理含噪混合盲扰信分离的不足。仿真结果表明该算法在一定范围的低信噪比条件下,能够从含噪的混合信号中恢复出通信信号源。     

基于极化分解的目标识别方法研究

在全极化、高距离分辨力雷达体制背景下，研究了光学区雷达目标极化特性。利用极化分解将复杂目标分解为三个简单目标， 并提取描述三目标关系的特征参数对四类军用飞机目标进行了识别实验研究， 获得了良好的目标分类识别效果。     

一种新的二维谐波估计方法

研究了二维谐波信号相关矩阵后 ,提出了一种称之为“矩阵束的二维谐波估计 (MP2D)”算法 ,该算法既不需要求解二维特征多项式的根 ,也不需要在二维频率空间搜索谱峰 ,算法具有高效性。仿真实验表明 ,该算法在白噪声条件下对二维谐波频率估计具有高的精度和强的抗干扰能力。     

Recent progress on transition metal oxides and carbon-supported transition metal oxides as catalysts for thermal decomposition of ammonium perchlorate

As a main oxidizer in solid composite propellants, ammonium perchlorate (AP) plays an important role because its thermal decomposition behavior has a direct influence on the characteristic of solid com-posite propellants. To improve the performance of solid composite propellant, it is necessary to take measures to modify the thermal decomposition behavior of AP. In recent years, transition metal oxides and carbon-supported transition metal oxides have drawn considerable attention due to their extraor-dinary catalytic activity. In this review, we highlight strategies to enhance the thermal decomposition of AP by tuning morphology, varying the types of metal ion, and coupling with carbon analogue. The enhanced catalytic performance can be ascribed to synergistic effect, increased surface area, more exposed active sites, and accelerated electron transportation and so on. The mechanism of AP decom-position mixed with catalyst has also been briefly summarized. Finally, a conclusive outlook and possible research directions are suggested to address challenges such as lacking practical application in actual formulation of solid composite propellant and batch manufacturing.     

A novel signal feature extraction technology based on empirical wavelet transform and reverse dispersion entropy

Feature extraction is an important part of signal processing, which is significant for signal detection, classification, and recognition. The nonlinear dynamic analysis method can extract the nonlinear characteristics of signals and is widely used in different fields. Reverse dispersion entropy (RDE) proposed by us recently, as a nonlinear dynamic analysis method, has the advantages of fast computing speed and strong anti-noise ability, which is more suitable for measuring the complexity of signal than traditional permutation entropy (PE) and dispersion entropy (DE). Empirical wavelet transform (EWT), based on the theory of wavelet analysis, can decompose a complex non-stationary signal into a number of empirical wavelet functions (EWFs) with compact support set spectrum, which has better decomposition performance than empirical mode decomposition (EMD) and its improved algorithms. Considering the advantages of RDE and EWT, on the one hand, we introduce EWT into the field of underwater acoustic signal processing and fault diagnosis to improve the signal decomposition accuracy; on the other hand, we use RDE as the features of EWFs to improve the signal separability and stability. Finally, we propose a novel signal feature extraction technology based on EWT and RDE in this paper. Experimental results show that the proposed feature extraction technology can effectively extract the complexity features of actual signals. Moreover, it also has higher distinguishing ability for different types of signals than five latest feature extraction technologies.     

基于探索性分析法仿真的建模方法研究

针对探索性分析法的主要特点,探讨建立适合探索性分析法仿真的模型问题.提出了通过分解和校准建立多分辨率模型的方法,该方法包括对低分辨率模型的校准、对高分辨率模型的分解以及输入参数的取值方法,很好地解决了模型的实用以及模型的有效性问题,为探索性分析法仿真的应用提供了具体的方法指导.     

基于VMD和SVM的舰船辐射噪声特征提取及分类识别

针对复杂海洋背景下舰船声频辐射噪声特征提取困难的问题,提出一种基于变分模态分解、中心频率、复杂度特征和支持向量机的舰船辐射噪声特征提取及分类识别方法。对四类舰船辐射噪声信号使用变分模态方法分解,得到一定数量的固有模态函数。通过比较提取能量最大的固有模态函数中心频率和排列熵作为特征参数,并利用支持向量机方法对四类舰船信号样本进行分类识别。实验结果表明,该方法可以实现对舰船辐射噪声的特征提取,与已有方法对比,该方法具有较高的识别率。     

基于不同能量值特征优选的水声目标识别

采用Bartlet平均周期图、小波变换和经验模态分解方法分别提取信号的频段能量值特征、IMF能量值特征,重点对IMF能量值特征进行特征优选。通过设计BP神经网络分类器,对实测的四类舰船目标的辐射噪声信号进行测试,取得了较好的识别效果。     

An eikonal equation based path planning method using polygon decomposition and curve evolution

Path planning is a key technique of autonomous navigation for robots, and the velocity field is an important part. Constructing velocity field in a complex workspace is still challenging. In this paper, an inner normal guided segmentation algorithm in a complex polygon is proposed to decompose the complex workspace in this paper. The artificial potential field model based on probability theory is then used to calculate the potential field of the decomposed workspace, and the velocity field is obtained by utilizing the potential field of this workspace. Path optimization is implemented by curve evolution, during which the internal force generated in the smoothing process of the initial path by a mean filter and the external force is obtained from the gradient of the workspace potential field. The parameter selection principle is deduced by analyzing the influence of several parameters on the path length and smoothness. Simulation results show that the designed polygon decomposition algorithm can effectively segment complex workspace and that the path optimization algorithm can shorten and smoothen paths.     

A nested benders decomposition approach for telecommunication network planning

Despite its ability to result in more effective network plans, the telecommunication network planning problem with signal‐to‐interference ratio constraints gained less attention than the power‐based one because of its complexity. In this article, we provide an exact solution method for this class of problems that combines combinatorial Benders decomposition, classical Benders decomposition, and valid cuts in a nested way. Combinatorial Benders decomposition is first applied, leading to a binary master problem and a mixed integer subproblem. The subproblem is then decomposed using classical Benders decomposition. The algorithm is enhanced using valid cuts that are generated at the classical Benders subproblem and are added to the combinatorial Benders master problem. The valid cuts proved efficient in reducing the number of times the combinatorial Benders master problem is solved and in reducing the overall computational time. More than 120 instances of the W‐CDMA network planning problem ranging from 20 demand points and 10 base stations to 140 demand points and 30 base stations are solved to optimality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010