一种基于能量的压缩感知稀疏度估计算法

压缩感知理论中,信号稀疏度直接关系到采样速率的设定以及观测矩阵的构造,而该先验信息往往受限.针对这一问题,本文从大维随机矩阵谱分析理论出发,分析了采样协方差矩阵的极限特征值概率分布特征,并结合其与观测信号能量的关系推导得到观测信号能量与压缩率、稀疏度和信噪比之间的对应关系,提出一种基于观测信号能量的稀疏度估计算法.相对于已有算法,该算法计算复杂度较低,且估计精度较好,并可通过增加采样开销进一步提升稀疏度估计精度,仿真实验验证了本文算法的有效性.     

帧间自适应压缩感知算法在视频编码中的应用

阐述了压缩感知的理论框架,分析了视频信号帧间相关性特点,提出了一种帧间自适应压缩感知的视频编码算法。本方法中,利用视频差值信号的特点建立自适应感知模型,自适应的选择稀疏域和重构域对信号进行压缩感知恢复,在空域稀疏度较强的情况下选择空域作为稀疏域和重构域,在空域稀疏度较差的情况下选择小波域作为稀疏域和重构域。用测试视频进行了仿真分析,结果表明该算法能够取得较好的效果。     

基于压缩感知观测序列倒谱距离的语音端点检测算法

本文基于语音信号在离散余弦基上的近似稀疏性,采用稀疏随机观测矩阵和线性规划重构算法对语音信号进行压缩感知与重构。研究了语音信号的压缩感知观测序列特性,根据语音帧和非语音帧压缩感知观测序列频谱幅度分布分散且差异较大的特性,提出基于压缩感知观测序列倒谱距离的语音端点检测算法,并对4dB-20dB下的带噪语音进行端点检测仿真实验。仿真结果显示,基于压缩感知观测序列倒谱距离的语音端点检测算法与奈奎斯特采样下语音的倒谱距离端点检测算法一样具有良好的抗噪性能,但由于采用压缩采样,减少了端点检测算法的运算数据量。      

基于OMP算法的宽带频谱感知

频谱感知是认知无线电的一项关键技术,其能够检测出未被主用户占用的频谱空穴供次用户接入使用,提高频谱利用率.宽带频谱感知要求对数GHz 的带宽进行检测,过高的采样速率、大的数据量对现有的硬件设备提出了巨大的挑战.本文利用宽带频谱的稀疏性提出一种基于OMP算法的宽带频谱感知方法.该方法利用MWC采样实现对宽带模拟信号直接压缩采样;利用自相关矩阵对称分解特性和主用户信号独立性,得到有限维压缩采样信号模型,利用AIC/MDL准则估计稀疏度作为OMP算法迭代停止的条件,大大减少了算法复杂度;该方法不需要重构接收信号的PSD,直接在时域根据低速率采样信号,检测被占用信道.仿真结果表明,当带内信噪比大于9dB时,频谱检测概率高于90％.     

DPSS基下多带流信号的恢复

压缩感知技术是近年来信号处理领域最热门的技术。传统的压缩感知理论并未考虑到稀疏信号本身可能具有的某种结构,块稀疏就是其中的一种。本文针对压缩感知的多带块稀疏流信号,将稀疏信号重构算法与调制的DPSS（Discrete Prolate Spheroidal Sequence ）基扩展相结合,建立了多带块稀疏模型,并利用压缩感知AIC结构,在远低于奈奎斯特速率下对多带宽模拟信号进行采样。结合压缩感知获得的观测方程和利用前后窗内信号的相关性建立的信号状态转移方程,采用降阶的卡尔曼滤波算法恢复原始信号。相对于傅里叶基扩展,DPSS基扩展在降低采样结构复杂度的同时,克服了频谱泄露的问题。仿真结果表明,多带信号在DPSS基下的恢复性能优于多带信号在FFT基下的重构。      

动态稀疏频谱的自适应压缩感知与跟踪算法研究

在宽带频谱感知、通信侦察等应用中信号稀疏度往往是动态变化的。首先证明了重构误差随压缩比的增加单调减小,在此基础上,提出了一种压缩比随频谱稀疏度自适应调整的压缩采样新算法。新算法由压缩采样与压缩比自适应调整两部分组成,其中,压缩采样部分用于恢复原信号,并估计恢复信号与原信号之间的误差;压缩比自适应部分根据误差与压缩比之间的近似线性函数关系,自适应调整下一时刻的压缩比。计算机仿真结果表明:新算法能够以近似“最优”的压缩比对稀疏度慢变的频谱进行有效感知,并跟踪频谱稀疏度的变化;与传统压缩采样方法相比,在保证频谱感知精度的前提下,新算法能够总体上进一步显著降低采样速率。      

基于压缩感知的超宽带信道估计方法的研究

压缩感知(Compressed Sensing, CS)理论可以从较少的观测样本中恢复稀疏信号。针对超宽带(Ultra- WideBand, UWB)信道的稀疏特性,将压缩感知理论应用于UWB系统的信道估计中,能够有效地降低系统的采样速率。该文针对UWB信道的特点对过完备字典库和观测矩阵进行设计,提出了一种滤波矩阵估计算法。然后,分别利用丹茨格选择器(Dantzig Selector, DS),基追踪降噪(Basis Pursuit De-Noising, BPDN)算法和正交匹配跟踪(Orthogonal Matching Pursuit, OMP)算法实现信号检测,进一步给出UWB信道估计中CS重建算法的选择建议。基于IEEE 802.15.4a信道模型的仿真结果表明,该算法同随机观测算法的检测结果相比,能够在较低的采样速率下获得更好的误码率性能。     

基于近似KLT域的语音信号压缩感知

压缩感知是近年来兴起的研究热点,该文基于语音信号在KLT域的稀疏特性,提出了基于模板匹配的近似KLT,并在基于模板匹配近似KLT域上研究了语音信号的压缩感知性能。首先验证语音信号在基于模板匹配近似KLT域上的稀疏性,然后由语音信号与观测矩阵构造相应的观测,采取固定分配每帧观测个数和按帧能量自适应分配每帧观测个数两种方案,再以观测为已知条件利用L1优化算法重构语音信号在基于模板匹配近似KLT域的稀疏系数向量,进而重构原始语音信号。实验表明,语音信号在基于模板匹配的近似KLT域的压缩感知性能较好。     

基于压缩感知的红外与可见光图像融合算法

压缩感知是一种新的信号采样理论,突破了传统的Nyquist采样率须为信号最高频率的2倍以上的定理。对于稀疏信号,它能够以远低于Nyquist采样速率对信号进行采样,并通过重构算法恢复出原信号。提出了一种基于压缩感知的红外与可见光图像融合算法,对图像进行测量,并通过融合算法对测量值进行融合。仿真实验显示,压缩感知能较好地实现图像的融合。     

基于海量物联网数据的压缩感知及其并行处理

物联网是当前人们的研究热点,本文提出使用压缩感知理论处理大规模的物联网中产生的海量数据.压缩感知是一种能够在采样的同时实现数据压缩的采样方法,它可以通过降低采样率显著减少采集的数据量,但压缩感知算法的计算复杂度高、对信号的适应性差.针对压缩感知方法的缺点,本文尝试对压缩感知算法并行处理方法以提高压缩感知的计算速度,同时引入冗余字典构造稀疏变换基以提高压缩感知对信号的适应性.     

Interference suppression for ultra dense network based on compressive sensing framework

Ultra-dense network (UDN) deployment of small cells introduces novel technical challenges, one of which is that the interference levels increase considerably with the network density. This paper proposes interference suppression scheme based on compressive sensing (CS) framework for UDN. Firstly, the measurement matrix is designed by exploiting the sparsity of millimeter wave channels. CS technique is employed to transform the high dimension sparse signal into low dimension signal. Then, the interference is canceled in the compressed domain. Finally, the stagewise weak orthogonal matching pursuit (SWOMP) algorithm is used to reconstruct the useful signal after interference suppression. The analysis and simulation results demonstrate the effectiveness of the algorithm. Simulation results demonstrate that the proposed interference suppression in compressive domain yields performance gains compared to other classical interference suppression schemes. The proposed algorithm can reduce the computational complexity of interference suppression algorithm.     

基于非均匀FFT的压缩感知雷达信号快速重构方法

雷达处理是压缩感知理论重要的应用方向之一,基于压缩感知的雷达处理可以降低对回波信号的采样速率要求,并且在部分应用中也可改善处理性能。然而,压缩感知重构算法的计算复杂性限制了压缩感知理论在实际雷达信号处理中的应用,尤其是大尺度雷达数据的处理。本文提出了一种基于压缩感知的雷达信号快速重构方法,利用均匀和非均匀快速傅里叶变换运算实现了常规压缩感知重构算法中的矩阵-向量乘法运算,有效降低了重构算法的计算复杂度,加快了压缩感知雷达信号的重构速度。同时,由于引入了快速傅里叶变换运算,该方法消除了大多数常规重构算法对感知矩阵的存储需求。仿真实验验证了该方法的可行性和高效性。      

The high resolution MIMO radar system based on minimizing the statistical coherence of compressed sensing matrix

Compressed Sensing (CS) theory is a great breakthrough of the traditional Nyquist sampling theory. It can accomplish compressive sampling and signal recovery based on the sparsity of interested signal, the randomness of measurement matrix and nonlinear optimization method of signal recovery. Firstly, the CS principle is reviewed. Then the ambiguity function of Multiple-Input Multiple- Output (MIMO) radar is deduced. After that, combined with CS theory, the ambiguity function of MIMO radar is analyzed and simulated in detail. At last, the resolutions of coherent and non-coherent MIMO radars on the CS theory are discussed. Simulation results show that the coherent MIMO radar has better resolution performance than the non-coherent. But the coherent ambiguity function has higher side lobes, which caused a deterioration in radar target detection performances. The stochastic embattling method of sparse array based on minimizing the statistical coherence of sensing matrix is proposed. And simulation results show that it could effectively suppress side lobes of the ambiguity function and improve the capability of weak target detection.     

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.     

Compressive Sensing Based Soft Video Broadcast Using Spatial and Temporal Sparsity

Video broadcasting over wireless network has become a very popular application. However, the conventional digital video broadcasting framework can hardly accommodate heterogeneous users with diverse channel conditions, which is called the cliff effects. To overcome this cliff effects and provide a graceful degradation to multi-receivers, in this paper, we use the nonlocal sparsity and hierarchical GOP structure to propose a novel CS based soft video broadcast scheme. CS has properties of minimizing bandwidth consumption and generating measurements with equal importance which are exactly needed by video soft broadcast. In the proposed scheme, the measurement data are generated by block-wise compressive sensing (BCS), and then the measurement data packets are sent over a highly dense constellation though OFDM channel to achieve a simple encoder. Ideally, with the GOP structure, inter frame has lower sampling rate than intra frame to achieve better compression efficiency. At the decoder side, due to equally-important packets and property of soft broadcast, each user can receive the noise-corrupted measurements matching its channel condition and reconstruct video. The hierarchical GOP structure is presented to explode the correlation and non-local sparsity among video frames during the recover process. Additionally, using non-local sparsity, group based CS reconstruction with adaptive dictionaries is proposed to improve decoding quality. The experimental results show that the proposed scheme provides better performance compared with the traditional SoftCast with up to 8 dB coding gain for some channel conditions.     

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

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

压缩感知理论及其应用前景

压缩感知理论是近年来提出的一种基于信号稀疏性的新兴采样理论。与通常的数据采样定理不同,该理论提出可以用远远少于传统采样定理所需的采样点数或观测点数恢复出原信号或图像。本文主要阐述了压缩感知中信号的稀疏表示、测量矩阵的设计及信号的重构算法等基本理论,论述了该理论的广阔应用前景。     

二维稀疏信号的联合压缩感知方法研究

传统的压缩感知理论主要考虑一维稀疏信号的感知和重构。当待处理信号是二维(2 dimension, 2D)或多维时,若直接将信号向量化处理,会造成感知矩阵维度急剧变大,使得存储和后续的重构复杂度大大增加,同时重构性能下降。为实现对2D信号的高效感知和快速重构,本文首先构建一个针对2D信号的模拟信息转换(Analog-to-Information Conversion, AIC)感知框架,通过行、列同时感知的策略实现量测值获取,以达到降低量测值存储维度的目的;其次针对压缩采样后的量测数据,提出一种2D快速迭代收缩阈值算法(2D Fast Iterative Shrinkage-Thresholding Algorithm, 2D-FISTA),并对该算法的基本迭代格式、收敛条件、参数选择以及算法收敛速度等问题进行了详细分析。仿真结果表明,所研究的算法可直接处理2D信号,具有重构速度快和存储量低等优势。      

采用压缩感知的标准测控信号处理

针对测控通信信号接收端存在数据大量冗余的问题,利用标准测控信号在频域上的稀疏性,采用压缩感知的理论进行前期处理。分别考虑了只存在测距音、只存在遥测信号和两类信号都存在等三种条件下的信号处理问题。通过改变稀疏度的大小,可以在不影响解调性能的条件下,大幅度降低接收端所需要的采样率,并且达到消除系统中不需要的谐波的目的。仿真验证了方法的有效性,同时说明利用压缩感知技术,将为测控通信系统的射频直接采样和处理提供一种高效的方式。