强鲁棒性和高锐化聚集度的BGabor-NSPWVD时频分析算法

针对短时傅里叶变换（Short-time Fourier transform，STFT）、Gabor变换和魏格纳-维尔分布（Wigner-Ville distribution，WVD）出现的时频分辨率模糊和交叉项干扰，以及目前一些主流改进算法如STFT-WVD和Gabor-WVD存在的频率分量三维幅度失真，且抗噪性能及鲁棒性能不理想等问题，提出基于局部二值化、归一化处理再结合的二值化Gabor-归一化WVD（Binarized Gabor-normalized WVD，BGabor-NWVD）和二值化Gabor-归一化伪平滑WVD（Binarized Gabor-normalized smoothed pseudo WVD，BGabor-NSPWVD）算法.数值仿真实验结果表明，BGabor-NWVD和BGabor-NSPWVD算法较好地抑制了交叉项干扰，具有较高的时频锐化聚集度，且两种算法的抗噪性能和鲁棒性也较为理想.基于本文方法对硬质合金顶锤工作时产生的疑似破裂信号进行时频分析，在抑制噪声和交叉项的同时能够较为准确地寻找传感器的频率判别窗口，为金属破裂监测设备数据采集卡提供有效的阈值参考.     

基于STFT和FrFT的连续波雷达参数估计

连续波雷达的回波信号由目标进行调制,对回波参数的估计是雷达信号处理的主要任务.本文从短时傅里叶变换(STFT)和分数阶傅里叶变换(FrFT)的基本特点入手,介绍了他们进行雷达回波信号参数估计时的优缺点.针对这些特点,提出了一种基于两种方法的混合算法.混合算法分两步:首先,混合算法运用STFT进行速度粗测;然后,用FrFT对加速度进行估计同时进行速度的精测.最后本文进行蒙特卡罗仿真实验,实验结果证明,即使在较低信噪比下该算法依然有效.     

基于改进WVD的跳频信号参数估计方法

为了克服传统的平滑伪魏格纳分布(SPWVD)在跳频信号参数估计中分辨率降低的问题,提出基于改进WVD算法的跳频信号参数估计新方法。通过分析跳频信号WVD的性质和特点,构造出与跳频信号WVD自项支撑区重合的时频窗,用其与信号WVD相乘进行加窗,有效抑制交叉干扰项的同时保持了WVD良好的时频分辨率,得到了清晰的跳频信号时频分布,基于此分布给出跳频信号参数估计的具体步骤。仿真实验结果表明,该方法有效可行且具有很好的整体性能。     

Hilbert-Huang变换在语音信号精细时频分析中的应用

语音信号是一种典型的非平稳信号,其特性及表征本质特征的参数均是随时间变化的,而时频分析是分析时变谱的有力工具,Hilbert-Huang变换是一种新型的具有自适应性的时频分析方法,对于非线性、非平稳信号有清晰的物理意义,通过HHT变换,能够得到信号的时间-频率-振幅三维分布特征。分析了HHT算法的原理,采用了合适的端点效应处理方法提高了EMD的分解精度,通过仿真实验得到了语音信号更加精细的时频结构,并与STFT、WVD及Choi-Williams分布进行了对比,显示了HHT算法的优越性。     

基于NGWarblet-WVD的高质量时频分析方法

针对高聚集度Wigner-Ville distribution (WVD)时频分析方法存在严重的交叉项干扰问题, 利用广义Warblet变换(Generalized Warblet transform, GWT)不产生虚假频率分量的特点, 提出了WVD与GWT相结合的归一化广义Warblet-WVD (Normalized generalized Warblet-WVD, NGWT-WVD)算法. 该算法将GWT与WVD进行矩阵运算, 实现滤波效应, 抑制WVD产生的新交叉项以及混入自项的交叉项, 提高WVD的时频分析质量. 实验结果表明, NGWT-WVD方法有效地去除了多分量信号的交叉项干扰, 提高信号分析结果的时频聚集度, 还原多分量信号的真实时频分布. 采用NGWT-WVD方法处理金属疑似破裂样本信号, 获取破裂发生区间的时间和频率标志段, 为监测传感器设置有效门限值提供判据, 取得了良好效果.     

基于重排SPWVD的跳频信号参数提取方法

提出了一种基于重排平滑伪Wigner-Ville分布（SPWVD）的未知跳频信号参数盲估计方法。在未知任何先验条件情况下,能够从截获信号中提取并估计出非合作跳频信号的跳频信号驻留时间、跳变时刻和跳频频率。介绍了重排时频分析原理,比较了跳频信号的WVD分布、平滑伪WVD分布和重排平滑伪WVD分布（MSPWVD）,设计了基于MSPWVD分布的跳频信号参数盲提取算法,通过计算机仿真得到了较为准确的提取结果,并对算法的性能进行了分析。     

CUDA架构下的改进多谱图WVD算法

多谱图WVD算法在计算自项支撑域时需要估计噪声的方差,且由于WVD是二次型运算,当强弱信号共存时,弱信号将被淹没.针对此问题,通过利用所处理信号的双音动态范围来确定支撑域的阈值,并对支撑域的幅度进行修正,避免了对噪声方差的估计,改善了信号时频图的聚集性.仿真实验表明,改进算法在抑制交叉项的同时,很好地保留了弱信号的细节,提高了多谱图WVD算法所处理信号的双音动态范围.最后利用计算机统一设备架构的高强度并行能力实现了该算法,加速比达到50倍左右.     

频域盲源分离的邻频幅角比排序算法

频域盲源分离方法通过STFT变换将时域的线性卷积模型转化为频域的瞬时混合模型,可以利用瞬时混合的成熟算法,然而缺点是存在排列和尺度的不确定性,会使逆STFT变换后的信号发生再次混叠。对分离矩阵内部结构进行研究,提出邻频幅角比的概念,通过纠正图样中发生排列错误频点处的分离矩阵结构,达到正确拟合已分离信号的目的。仿真结果表明,邻频幅角比排序算法可以纠正大多数频点上的排序错误,正确进行盲源分离。     

天然气压气机械设备故障信号时频分析特征提纯

天然气压气站压气机械设备工作环境恶劣,故障多发,而机械设备的故障状态下的振动噪声信号是研究机械设备故障诊断的有效载体。为有效进行故障诊断,需要对机械设备的故障信号进行提纯分析和特征提取等研究。提出基于时频分析技术的WVD和Hough变换结合的方法对低信噪比的故障信号进行提纯算法。首先分析了非平稳信号处理技术的基本原理,对原始信号的滤波和检测、频谱分析等处理,分析了时频分析特性和对应的条件,提出采用时间均值、频率均值、时间散布和频率散布四个特征值作为时频分析的特征提取量。仿真实验以某天然气压气站某型压缩机故障振动下采集信号样本为研究对象,进行提纯滤波和特征提取仿真,仿真实验得到降噪滤波和WVD及Hough变换算法下的检测结果,表明在强干扰背景SNR为-8dB下,有卓越的滤波降噪和检测性能,特征提纯检测性能相比传统算法提高18％以上。为天然气压缩机故障诊断奠定了可靠的理论基础。     

基于信号先验知识的几种时频分析法

时频分析方法分为线性、二次型和自适应等多种方法,它们提供了在时频二维平面上,分析信号时变功率谱的有效手段。由于这些方法各有优缺点,因此在实际应用中应根据被分析信号的先验知识,对不同类型的信号采用不同的时频分析方法,以取得对时频分辨率的均衡,并尽可能抑制交叉项干扰。根据对一些典型信号模型,分别按不同的时频分析方法进行的分析,找出了适合于各信号模型的不同时频分析法。模拟分析结果证明,对于时频汇聚性能较好的高斯类信号和跳频信号,采用自适应方法可以取得较好的分析效果;而对于频率随时间变化较大的调频类信号,则采用STFT或WVD效果较好。同时还讨论了时频分析方法在图象分析与处理中的应用。     

Data‐aware task scheduling on heterogeneous hybrid memory multiprocessor systems

In this paper, we propose a method about task scheduling and data assignment on heterogeneous hybrid memory multiprocessor systems for real‐time applications. In a heterogeneous hybrid memory multiprocessor system, an important problem is how to schedule real‐time application tasks to processors and assign data to hybrid memories. The hybrid memory consists of dynamic random access memory and solid state drives when considering the performance of solid state drives into the scheduling policy. To solve this problem, we propose two heuristic algorithms called improvement greedy algorithm and the data assignment according to the task scheduling algorithm, which generate a near‐optimal solution for real‐time applications in polynomial time. We evaluate the performance of our algorithms by comparing them with a greedy algorithm, which is commonly used to solve heterogeneous task scheduling problem. Based on our extensive simulation study, we observe that our algorithms exhibit excellent performance and demonstrate that considering data allocation in task scheduling is significant for saving energy. We conduct experiments on two heterogeneous multiprocessor systems. Copyright © 2016 John Wiley & Sons, Ltd.     

Hough变换在中文名片图像倾斜校正中的应用

近来,文档图像的计算机自动理解已取得很多进展。但是,对于具有倾斜的图像的理解仍然存在许多困难。这种困难在中文名片图像自动识别与理解系统中尤为突出。必须在系统的输入端对图像作有效的倾斜校正以保证系统的性能。由于中文名片版面复杂,名片中文字行以及每行字符较少,使得现有的倾斜校正算法在处理名片图像时效果很不理想。Hough变换可用于一般文档图像的倾斜校正。但是,Hough变换在名片图像中的应用还有待研究。本文提出一种二级Hough变换算法,并应用于名片图像理解系统,利用名片图像自身的特点提高Hough变换的精确度和速度。这一方法的效果已被实验结果所证实。     

建筑电气系统故障诊断综述

从建筑电气系统研究现状、应用前景以及故障诊断方法等方面进行阐述;介绍信号分析、解析模型和人工智能算法三大类中用于解决建筑电气系统故障诊断的典型算法;综述三类方法在故障诊断中的模型选择、学习算法和实际应用等方面的研究进展;探讨信号分析、解析模型和人工智能算法在建筑电气系统故障诊断中的理论分析,以及待解决的问题和未来的发展前景等。     

Fast parallel algorithms for discrete Gabor expansion and transform based on multirate filtering

The Gabor transform has long been recognized as a very useful tool for the joint time and frequency analysis in signal processing.Its real time applications,however,were limited due to the high computational complexity of the Gabor transform algorithms.In this paper,some novel and fast parallel algorithms for the finite discrete Gabor expansion and transform are presented based on multirate filtering.An analysis filter bank is designed for the finite discrete Gabor transform(DGT)and a synthesis filter bank is designed for the finite discrete Gabor expansion(DGE).Each of the parallel channels in the two filter banks has a unified structure and can apply the FFT and the IFFT to reduce its computational load.The computational complexity of each parallel channel does not change as the oversampling rate increases.In fact,it is very low and depends only on the length of the input discrete signal and the number of the Gabor frequency sampling points.The computational complexity of the proposed parallel algorithms is analyzed and compared with that of the major existing parallel algorithms for the finite DGT and DGE.The results indicate that the proposed parallel algorithms for the finite DGT and DGE based on multirate filtering are very attractive for real time signal processing.     

一种小波混合优化算法用于脑MR图像配准

优化算法是脑磁共振(MR)图像配准方法中的重要组成部分。针对目前已有的优化算法,提出了采用小波混合优化算法应用于脑MR图像配准。该优化算法采用小波分解技术实现脑MR图像的高低分辨率分解,在低分辨率图像上采用PSO(粒子群算法)进行优化获得初步配准参数,然后再采用Powell算法进一步精细优化,获得最终配准参数。实验比较结果表明,该优化算法相对于目前一些主流优化算法来说,具有较低的时间代价,较高的优化精度,以及较好的优化稳定性。     

Application Layer Scheduling in Cloud: Fundamentals,Review and Research Directions

The cloud computing paradigm facilitates a finite pool of on-demand virtualized resources on a pay-per-use basis. For large-scale heterogeneous distributed systems like a cloud, scheduling is an essential component of resource management at the application layer as well as at the virtualization layer in order to deliver the optimal Quality of Services (QoS). The cloud scheduling, in general, is an NP-hard problem due to large solution space, thus, it is difficult to find an optimal solution within a reasonable time. In application layer scheduling, the tasks are mapped to logical resources (i.e., virtual machines), aiming to optimize one or more QoS parameters, and conforming to several constraints. Various algorithms have been proposed in the literature for application layer scheduling, where each of them is based on some fundamental design techniques like simple heuristics, meta-heuristics, and most recently hybrid heuristics. Although ample literature survey exists for cloud scheduling algorithms, none of them present their study exclusively for the application layer. In this survey paper, we present a study on task scheduling algorithms used only at the application layer of the cloud. We classify our study according to various fundamental techniques used in designing such scheduling algorithms. One of the main features of our study is that it covers numerous application type e.g., a set of independent tasks, simple workflow, scientific workflow, and MapReduce jobs. We also provide a comparative analysis of existing algorithms on various parameters like makespan, cost, resource utilization, etc. In the end, research directions for future work have been provided.     

基于提升方案的冗余Haar小波变换与时间序列预测

针对小波分析存在的边界问题，提出一种基于提升方案的冗余Haar小波变换(Haar_RLWT)。使用该方法得到的系数序列，在具备时移不变性的同时，消除了右侧边界存在数据畸变的现象，使小波分析技术结合神经网络等传统预测模型的方法应用于时间序列预测任务具备可行性。同时为进一步提高预测效果，引入神经网络集成技术以改善网络泛化能力。实验表明，该综合预测模型预测效果与稳定性优于传统预测模型。     

应用主成分分析和KL变换的体育视频压缩算法

当前体育视频压缩算法存在压缩率低,丢失信息严重等缺陷,为了获得理想的体育视频压缩效果,提出了基于主成分分析和KL变换的体育视频压缩算法。首先分析当前体育视频压缩的研究现状,找到各种体育视频压缩算法的不足,然后采用主成分分析算法对体育视频关键帧投影,得到多个子空间,并采用KL变换对体育视频关键帧的子空间进行编码,使子空间的KL变换系数相关性最小,从而最大限度的实现体育视频压缩,最后与其它体育视频压缩算法进行仿真测试,测试结果表明,主成分分析和KL变换提升了体育视频压缩率,不仅能够去掉体育视频关键帧之间的冗余信息,而且体育视频压缩效率高,获得了比传统算法更好的体育视频压缩效果,具有更加广泛的实际应用价值。     

Parallel computation of the Euclidean distance transform on a three-dimensional image array

In a two- or three-dimensional image array, the computation of Euclidean distance transform (EDT) is an important task. With the increasing application of 3D voxel images, it is useful to consider the distance transform of a 3D digital image array. Because the EDT computation is a global operation, it is prohibitively time consuming when performing the EDT for image processing. In order to provide the efficient transform computations, parallelism is employed. We first derive several important geometry relations and properties among parallel planes. We then, develop a parallel algorithm for the three-dimensional Euclidean distance transform (3D-EDT) on the EREW PRAM computation model. The time complexity of our parallel algorithm is O(log/sup 2/ N) for an N/spl times/N/spl times/N image array and this is currently the best known result. A generalized parallel algorithm for the 3D-EDT is also proposed. We implement the proposed algorithms sequentially, the performance of which exceeds the existing algorithms (proposed by Yamada, 1984). Finally, we develop the corresponding parallel programs on both the emulated EREW PRAM model computer and the IBM SP2 to verify the speed-up properties of the proposed algorithms.     

利用多抽样率滤波实现DHT的实值离散Gabor变换

基于多抽样率滤波原理,设计了分析和综合滤波器组,分别用于实现（基于DHT核函数的）离散Gabor展开与变换,提出了新的实值离散Gabor展开与变换快速并行算法。在并行算法中,由于总计算复杂性分摊于多个结构一致并能够利用快速一维离散快速Hartley变换（N点1-D DHT）的并行通道,因此并行算法的计算时间取决于单个并行通道的计算复杂性。而每一并行通道的计算复杂性非常小,所以分析和综合滤波器组的处理速度是相当快的。将所提出的算法与当前最快的并行算法进行了比较,结果表明基于多抽样率滤波实现的实值离散Gabor展开与变换快速并行算法对实时信号处理十分有利。