Measurement matrix optimization based on incoherent unit norm tight frame

This paper considers the problem of measurement matrix optimization for compressed sensing (CS) in which the dictionary is assumed to be given, such that it leads to an effective sensing matrix. Due to important properties of equiangular tight frames (ETFs) to achieve Welch bound equality, the measurement matrix optimization based on ETF has received considerable attention and many algorithms have been proposed for this aim. These methods produce sensing matrix with low mutual coherence based on initializing the measurement matrix with random Gaussian ensembles. This paper, use incoherent unit norm tight frame (UNTF) as an important frame with the aim of low mutual coherence and proposes a new method to construction a measurement matrix of any dimension while measurement matrix initialized by partial Fourier matrix. Simulation results show that the obtained measurement matrix effectively reduces the mutual coherence of sensing matrix and has a fast convergence to Welch bound compared with other methods.     

基于SWCoSaMP算法的稀疏信号重构

压缩感知(compressed sensing, CS)稀疏信号重构本质上是在稀疏约束条件下求解欠定方程组。针对压缩感知匹配追踪(compressed sampling matching pursuit, CoSaMP)算法直接从代理信号中选取非零元素个数两倍作为支撑集,但是不存在迭代量化标准,本文提出了分步压缩感知匹配追踪(stepwise compressed sampling matching pursuit, SWCoSaMP)算法。该算法从块矩阵的逆矩阵定义出发,采用迭代算法得到稀疏信号的支撑集,推出每次迭代支撑集所对应重构误差的L-2范数闭合表达式,从而重构稀疏信号。实验结果表明和原来CoSaMP算法相比,对于非零元素幅度服从均匀分布和高斯分布的稀疏信号,新算法具有更好的重构效果。      

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

压缩感知(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信道模型的仿真结果表明,该算法同随机观测算法的检测结果相比,能够在较低的采样速率下获得更好的误码率性能。     

稀疏L型阵中基于压缩感知的角度估计方法

利用二级Nested阵来构建稀疏L型阵列,针对此阵列,提出了基于压缩感知的角度估计方法。该方法通过计算接收数据的自相关协方差矩阵并向量化,然后进行重排序和去冗余,得到虚拟阵列的入射角信息。该虚拟阵列的长度远远大于实际物理阵列的长度,因而相比同物理阵元的均匀L型阵,阵列孔径和自由度明显增大。最后利用正交匹配追踪技术对虚拟阵列的l1范数约束问题进行求解,并完成二维角度的配对。计算机仿真表明,所提算法具有更高的信源分辨力,并且在高信噪比、高快拍数、大角度间隔条件下,具有更好的估计性能。     

Combined sparsifying transforms for compressed sensing MRI

In traditional compressed sensing MRI methods, single sparsifying transform limits the reconstruction quality because it cannot sparsely represent all types of image features. Based on the principle of basis pursuit, a method that combines sparsifying transforms to improve the sparsity of images is proposed. Simulation results demonstrate that the proposed method can well recover different types of image features and can be easily associated with total variation.     

Improving compressive sensing in MRI with separate magnitude and phase priors

Compressive sampling/compressed sensing (CS) has shown that it is possible to perfectly reconstruct non-bandlimited signals sampled well below the Nyquist rate. Magnetic Resonance Imaging (MRI) is one of the applications that has benefited from this theory. Sparsifying operators that are effective for real-valued images, such as finite difference and wavelet transform, also work well for complex-valued MRI when phase variations are small. As phase variations increase, even if the phase is smooth, the sparsifying ability of these operators for complex-valued images is reduced. If the phase is known, it is possible to remove it from the complex-valued image before applying the sparsifying operator. Another alternative is to use the sparsifying operator on the magnitude of the image, and use a different operator for the phase, i.e., one related to a smoothness enforcing prior. The proposed method separates the priors for the magnitude and for the phase, in order to improve the applicability of CS to MRI. An improved version of previous approaches, by ourselves and other authors, is proposed to reduce computational cost and enhance the quality of the reconstructed complex-valued MR images with smooth phase. The proposed method utilizes \(\ell _1\) penalty for the transformed magnitude, and a modified \(\ell _2\) penalty for phase, together with a non-linear conjugated gradient optimization. Also, this paper provides an extensive set of experiments to understand the behavior of previous methods and the new approach.     

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

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

Compressed sensing based deconvolution algorithm for time-domain UWB channel modeling

Extracting the parameters of the multipath with high accuracy can be achieved by using high-resolution algorithm for time-domain ultra wideband (UWB) channel modeling.The CLEAN algorithm has been used ...     

基于图稀疏正则化多测量向量模型的高光谱压缩感知重建

压缩感知重建是解决高光谱现有成像模式数据量大冗余度高问题的一个有效机制。针对高光谱图像的多通道特性,该文建立了高光谱压缩感知的多测量向量模型,编码端使用随机卷积算子对各通道进行快速采样,生成测量向量矩阵。解码端构建图稀疏正则化的联合重建模型,在稀疏变换域将高光谱图像分解为谱间的关联成分和差异成分,通过图结构化稀疏度量表征关联成分的空谱相关性,并约束谱间差异成分的稀疏性。进一步提出模型求解的交替方向乘子迭代算法,通过引入辅助变量与线性化技巧,使得每一子问题均存在解析解,降低了模型求解的复杂度。对多个实测数据集进行了对比实验,实验结果验证了该文模型与算法的有效性。     

一种用于压缩感知理论的投影矩阵优化算法

考虑到投影矩阵对压缩感知(CS)算法性能的影响,该文提出一种优化投影矩阵的算法。该方法提出可导的阈值函数,通过收缩Gram矩阵非对角元的方法压缩投影矩阵和稀疏字典的相关系数,引入基于沃尔夫条件(Wolfes conditions)的梯度下降法求解最佳投影矩阵,达到提高投影矩阵优化算法稳定度和重构信号精度的目的。通过基追踪(BP)算法和正交匹配追踪(OMP)算法求解l0优化问题,用压缩感知方法实现随机稀疏向量、小波测试信号和图像信号的感知和重构。仿真实验表明,该文提出的投影矩阵优化算法能较大地提高重构信号的精度。