基于压缩感知信道能量观测的协作频谱感知算法

压缩感知为认知无线电宽带频谱感知提供了一种新思路。基于压缩感知原理,该文提出一种不需要重构宽带频谱本身,而是直接重构各信道能量的协作频谱感知方法。多个次用户使用宽带随机滤波器组获取信道能量的观测值。融合中心同步接收多个用户的能量观测,并利用同步稀疏自适应匹配追踪协作重构算法重构所有次用户的信道能量。仿真结果表明加性高斯白噪声环境下该协作感知方法所需的滤波器数目仅为传统方法的20%左右,瑞利衰落信道下也仅需传统方法的40%,有效降低了系统复杂度并改善感知性能。同时,该文提出的同步稀疏自适应匹配追踪算法对比经典的同步正交匹配追踪算法在重构精度及算法复杂度两方面都有所提升。     

压缩感知自适应观测矩阵设计

稀疏表示、不相关观测和重构是影响压缩感知性能的三大要素,本文设计的自适应观测矩阵以高斯随机观测阵为初始矩阵,利用信号稀疏域系数的部分先验信息进行自适应变换,形成新的观测阵,当压缩感知矩阵对信号的稀疏系数进行投影时,可使得稀疏系数中的小系数更接近于零;同时,通过减少观测阵行向量的方式来减少观测值,从而应用自适应观测阵后的数据传输量与用高斯随机矩阵的数据传输量相差不大。自适应观测矩阵对压缩感知的性能改进体现在重构精度上,用迭代硬阈值算法作为重构算法,我们从理论和实验仿真两方面验证了自适应观测阵的性能要优于高斯随机矩阵。     

行阶梯观测矩阵、对偶仿射尺度内点重构算法下的语音压缩感知

基于语音信号在离散余弦域上的近似稀疏性,针对采用随机高斯观测矩阵及线性规划方法进行语音压缩感知与重构时,重构零(近似零)系数定位能力差而导致重构效果不好的缺点,本文提出一种新的行阶梯矩阵做观测矩阵,用对偶仿射尺度内点重构算法对语音进行压缩感知与重构,并对该算法下的重构性能进行理论分析.语音压缩感知仿真结果表明,在离散余弦基下,压缩比(观测序列与原始序列样值数之比)为1∶4时,行阶梯观测矩阵下的平均重构信噪比比随机高斯观测矩阵下提高9.73dB,平均MOS分比随机高斯观测矩阵下提高1.22分.     

基于OMP-SVD的多分量单频信号频率估计

压缩感知(CS)是稀疏信号处理的有力工具。研究了多分量单频信号经过压缩采样以及信号重构后的频率估计问题。首先以一个随机高斯矩阵对信号进行观测测量,得到观测值;然后基于正交匹配追踪(OMP)和奇异值分解(SVD)算法,利用这些观测值对原信号进行高精度重构;最后利用重构中得到的非零元素的位置信息估计了原信号频率,并与基于Levinson-Durbin的AR参数模型频率估计算法进行了性能对比。仿真证明了算法能够高效重构原信号,并精确估计原信号频率。     

基于能量均衡的无线传感器网络压缩感知算法

无线传感器网络在探测目标源时会碰到处理能力不足和能量缺乏的问题。为了克服这些问题,该文提出了基于能量均衡的自适应压缩感知算法。与传统自适应压缩感知算法不同,所提出的算法在选择观测向量时不仅考虑了重构性能,还考虑了节点的能量均衡,防止某些节点过快消耗能量而导致整体网络结构的破坏。同时为了适应不同应用场景的需求,将自适应压缩感知算法和能量均衡压缩感知算法相结合,通过门限值的选择达到灵活配置的目的。仿真实验的结果表明,该文所提出的算法能够有效延长网络生存时间,同时能够实现能耗和收敛性的兼顾。     

基于二维压缩感知的定向遥感和变化检测

基于高斯测量矩阵的一维压缩感知测量数据不仅能很好地保持稀疏信号的能量信息, 也能够很好地继承稀疏信号的方向信息.但是在一维压缩感知模型中方向信息无法应用于稀疏信号的重构和检验.针对遥感影像中变化区域稀疏的特点提出了二维压缩感知模型.并利用能量和方向信息构建了基于二维压缩感知的稀疏信号重构算法(2DOMP).理论分析和实验结果证明, 2DOMP算法的信号重构能力更强.同时根据压缩感知恢复稀疏信号只需要很少测量数据的特性提出了定向遥感和定向变化检测的概念.     

基于压缩感知的信号重构

压缩感知是针对稀疏或可压缩信号,在采样的同时即可对信号数据进行适当压缩的新理论,采用该理论,可以仅需少量信号的观测值来实现精确重构信号。文中概述了CS理论框架及关键技术问题,介绍了信号稀疏表示、观测矩阵和重构算法。最后仿真实现了基于压缩感知的信号重构,并对正交匹配追踪(OMP)重构算法性能作了分析。     

能量约束贝叶斯压缩感知检测算法

为了解决无线传感器网络在监测区域内遇到处理能力不足和能量受限问题,提出了一种能量约束贝叶斯压缩感知检测算法。算法在选择观测向量时不仅考虑了重构效果,同时还考虑了节点的能量,并利用改进的分簇算法选择最佳传输路径,以均衡整个网络的能量,防止某些节点由于能量消耗过快导致整个网络失效。实验表明,与传统的贝叶斯压缩感知直接检测相比,能量约束贝叶斯压缩感知检测算法在网络生存时间上有了很大的提高。     

无线传感器网络中基于压缩感知和GM(1,1)的异常检测方案

针对现有的异常事件检测算法准确率低和能量开销较大等问题,该文提出一种基于压缩感知(CS)和GM(1,1) 的异常事件检测方案。首先,基于分簇的思想将传感器节点的数据进行压缩采样后传输至Sink,针对传感器网络中数据稀疏度未知的特点,提出一种基于步长自适应的块稀疏信号重构算法。然后,Sink基于CM(1,1)对节点发生的异常进行预测,并对节点的工作状态进行自适应调整。仿真实验结果表明,相比于其它异常检测算法,该算法的误警率和漏检率较低,在保证异常事件检测可靠性的同时,有效地节省了节点能量。     

基于压缩感知理论的稀疏孔径ISAR成像

在基于压缩感知理论的逆合成孔径雷达成像过程中,利用正交匹配追踪算法进行信号重构时存在重构精度较低、运算速度较慢的缺点,针对上述问题,提出了一种利用改进正交匹配追踪算法进行信号重构的稀疏孔径高分辨成像方法。首先,构造数据选择矩阵作为测量矩阵模拟回波缺失情况,然后利用稀疏基矩阵对回波信号进行稀疏表示,最后采取一种改进正交匹配追踪算法进行图像重构,相比于正交匹配追踪算法同时提高了运算速度和成像质量。通过仿真实验,在稀疏孔径数据随机缺失的情况下,改变数据缺失率,将该算法与距离-多普勒算法和正交匹配追踪算法的成像结果进行对比,验证了该算法的有效性和优越性。     

An adaptive measurement scheme based on compressed sensing for wideband spectrum detection in cognitive WSN

An Adaptive Measurement Scheme (AMS) is investigated with Compressed Sensing (CS) theory in Cognitive Wireless Sensor Network (C-WSN). Local sensing information is collected via energy detection with Analog-to-Information Converter (AIC) at massive cognitive sensors, and sparse representation is considered with the exploration of spatial temporal correlation structure of detected signals. Adaptive measurement matrix is designed in AMS, which is based on maximum energy subset selection. Energy subset is calculated with sparse transformation of sensing information, and maximum energy subset is selected as the row vector of adaptive measurement matrix. In addition, the measurement matrix is constructed by orthogonalization of those selected row vectors, which also satisfies the Restricted Isometry Property (RIP) in CS theory. Orthogonal Matching Pursuit (OMP) reconstruction algorithm is implemented at sink node to recover original information. Simulation results are performed with the comparison of Random Measurement Scheme (RMS). It is revealed that, signal reconstruction effect based on AMS is superior to conventional RMS Gaussian measurement. Moreover, AMS has better detection performance than RMS at lower compression rate region, and it is suitable for large-scale C-WSN wideband spectrum sensing.     

Image representation by compressive sensing for visual sensor networks

This paper addresses the image representation problem in visual sensor networks. We propose a new image representation method for visual sensor networks based on compressive sensing (CS). CS is a new sampling method for sparse signals, which is able to compress the input data in the sampling process. Combining both signal sampling and data compression, CS is more capable of image representation for reducing the computation complexity in image/video encoder in visual sensor networks where computation resource is extremely limited. Since CS is more efficient for sparse signals, in our scheme, the input image is firstly decomposed into two components, i.e., dense and sparse components; then the dense component is encoded by the traditional approach (JPEG or JPEG 2000) while the sparse component is encoded by a CS technique. In order to improve the rate distortion performance, we leverage the strong correlation between dense and sparse components by using a piecewise autoregressive model to construct a prediction of the sparse component from the corresponding dense component. Given the measurements and the prediction of the sparse component as initial guess, we use projection onto convex set (POCS) to reconstruct the sparse component. Our method considerably reduces the number of random measurements needed for CS reconstruction and the decoding computational complexity, compared to the existing CS methods. In addition, our experimental results show that our method may achieves up to 2 dB gain in PSNR over the existing CS based schemes, for the same number of measurements.     

基于自相关观测的语音信号压缩感知

本文基于压缩感知技术,根据语音信号的特点,提出了一种基于自相关特性的截断循环自相关矩阵作为观测矩阵,并在此基础上,从实用的角度出发,提出了基于模板匹配的近似截断循环自相关矩阵作为观测矩阵,并证明其满足RIP特性。由语音信号与截断循环自相关矩阵、近似截断循环自相关矩阵和高斯随机矩阵分别构造相应的观测,采用BP算法来重构原始语音信号。实验表明,由2个模板元素线性组合而成的近似截断循环自相关矩阵重构原始语音信号的性能与截断循环自相关矩阵的重构性能相当,且优于经典高斯随机矩阵,而且在相同的重构性能下,其压缩比远大于高斯随机观测矩阵,对语音信号的压缩性能有了明显地提高。      

An algorithm for dictionary generation in sparse representation

The K-COD (K-Complete Orthogonal Decomposition) algorithm for generating adaptive dic-tionary for signals sparse representation in the framework of K-means clustering is proposed in this paper, in which rank one approximation for components assembling signals based on COD and K-means clustering based on chaotic random search are well utilized. The results of synthetic test and empirical experiment for the real data show that the proposed algorithm outperforms recently reported alternatives: K-Singular Value Decomposition (K-SVD) algorithm and Method of Optimal Directions (MOD) algorithm.     

基于压缩感知理论的随机噪声雷达目标检测算法研究

随机噪声雷达通常利用时域相关完成脉冲压缩从而进行目标检测。该文根据压缩感知理论提出一种适用于噪声雷达目标检测的新算法,它用低维投影测量和信号重建取代了传统的相关操作和压缩处理,将大量运算转移到后期处理。该算法以噪声雷达所检测的目标空间分布满足稀疏性为前提;利用发射信号形成卷积矩阵,然后通过随机抽取卷积矩阵的行构建测量矩阵;并采用迭代收缩阈值算法实现目标信号重建。该文对算法作了详细的理论推导,形成完整的实现框架。仿真实验验证了算法的有效性,并分析了对处理结果影响较大的因素。该算法能够有效地重建目标,具有良好的运算效率。与时域相关法相比,大幅度减小了目标检测误差,有效抑制了输出旁瓣,并保持了信号的相位特性。     

混沌模拟信息转换——基于多射法的稀疏信号重构

混沌压缩采样是应用混沌系统实现非线性测量的压缩采样理论。该文研究模拟信号的混沌压缩采样-混沌模拟信息转换。该转换通过稀疏信号激励混沌系统,低速采样系统输出实现;信号重构则以混沌系统参数估计理论为基础,通过稀疏正则化的非线性最小二乘问题进行求解。该文将多射法(MS)与迭代再加权非线性最小二乘算法(IRNLS)结合,给出混沌模拟信息转换的MS-IRNLS信号重构算法。文中以Lorenz系统为例,仿真验证了MS-IRNLS算法的重构性能,结果表明方法的有效性。     

Generalized compressive detection of stochastic signals using Neyman–Pearson theorem

Compressive sensing (CS) enables reconstructing a sparse signal from fewer samples than those required by the classic Nyquist sampling theorem. In general, CS signal recovery algorithms have high computational complexity. However, several signal processing problems such as signal detection and classification can be tackled directly in the compressive measurement domain. This makes recovering the original signal from its compressive measurements not necessary in these applications. We consider in this paper detecting stochastic signals with known probability density function from their compressive measurements. We refer to it as the compressive detection problem to highlight that the detection task can be achieved via directly exploring the compressive measurements. The Neyman–Pearson (NP) theorem is applied to derive the NP detectors for Gaussian and non-Gaussian signals. Our work is more general over many existing literature in the sense that we do not require the orthonormality of the measurement matrix, and the compressive detection problem for stochastic signals is generalized from the case of Gaussian signals to the case of non-Gaussian signals. Theoretical performance results of the proposed NP detectors in terms of their detection probability and the false alarm rate averaged over the random measurement matrix are established. They are verified via extensive computer simulations.     

基于联合稀疏谱重构的PPG信号降噪算法

针对光电容积脉搏波（Photoplethysmography,PPG）传感器数据采集降噪问题,本文提出一种基于联合稀疏重构的PPG信号运动噪声降噪算法.该算法通过构建同时间段内PPG信号和加速度信号的频谱矩阵,提取频谱矩阵稀疏特征和该矩阵行稀疏特征,利用压缩感知方法,将PPG信号运动噪声去除过程建模为联合稀疏信号重构过程,并将该过程进一步建模为最优化模型,通过迭代寻优来获得该模型的最优解,结合谱减法,从而有效去除PPG信号中的运动噪声,降低噪声对PPG信号的影响.仿真分析表明,本文提出的算法能有效去除PPG信号中的运动噪声,获得较好的降噪效果.     

基于压缩感知的BOTDA性能增强方法

为了提高布里渊光时域分析系统(BOTDA)在长距离监测应用中的实时性,提出了一种基于压缩感知的布里渊光时域系统实时性增强方法。该方法包含稀疏表示、随机采样和信号重构三个部分。首先采用K-均值奇异值分解算法获得布里渊增益谱的稀疏表示,然后通过高斯随机采样和正交匹配追踪算法进行布里渊增益谱重构。为了验证所提方法的性能,仿真生成了不同信噪比水平的布里渊增益谱,搭建了45 km的布里渊光时域系统进行温度传感实验。仿真和实验结果表明:在累加平均次数为100时,所提算法将信噪比提升了6.37 dB,优于累加平均次数3000时的10.13 dB,对应测量时间减少了1/30;采用8 MHz步长数据重构布里渊增益谱,该方法的重构结果与4 MHz步长数据的相关系数为0.9992,对应扫频时间减少了一半。所提算法在保证测量精度的同时提升了测量实时性。     

基于随机滤波的探地雷达成像方法

探地雷达是一种超宽带雷达系统,若按传统的奈奎斯特采样,雷达回波信号需要大量空间存储。压缩感知可以实现利用少量的测量值对稀疏信号进行重构,其中最为关键的是测量矩阵和重构算法的选择。本文将压缩感知应用于探地雷达成像,并利用随机滤波的思想选择测量矩阵,可以有效减少测量矩阵中非零值的个数。利用正交匹配追踪算法对信号进行重构,算法简单,降低了数据的存储量和运算复杂度,该算法同样可以对时间和空间上同时压缩的数据进行成像。最后,本文给出基于时间连续信号的GPR接收机一种CS实现方案。仿真结果表明,本文提出的成像方法可以以少量数据精确地对信号进行重构,并且运算量少。