一种改进的稀疏自适应压缩感知重构算法

为了优化贪婪匹配追踪算法的性能,文中基于稀疏自适应两阶段回溯型贪婪算法-前后追踪算法,提出了一种改进的线性变步长前后追踪算法。该算法结合稀疏自适应追踪算法的分阶段、变步长的思想,将迭代过程分为两个阶段,采用线性变步长进行迭代,大步长较少运行时间,小步长提升重构精度,从而减少了运行开销的同时,提升了算法的重构精度,通过仿真实验对其进行了验证,线性变步长前后追踪算法能够明显减少算法的运行时间,且提升了重构精度。     

基于压缩感知OMP改进算法的图像重构

正交匹配追踪(OMP)算法中迭代次数严格依赖信号的稀疏度K值,迭代次数选取适当会重构出高精确的图像,反之则会对图像重构质量造成严重影响.针对这一问题,提出了一种根据残差值的相对极差来确定最佳迭代次数的新方法.该方法要求在同一次迭代中对一幅图像的所有列同时进行迭代计算,根据极差的相对差值与门限值比较来确定最佳迭代次数,从而达到提高重构精度,消除对稀疏度K值依赖的目的.理论分析和仿真结果表明,改进的OMP算法比原有算法有更理想的重构效果,有更高的重构精度.     

基于压缩感知的OMP图像重构算法改进

阐述了压缩感知相关理论以及信号的重构算法,围绕其中的匹配追踪系列算法展开研究,同时在正交匹配追踪算法(OMP算法)的基础上引入了几种改进算法,并结合OMP算法本身耗时长、速度慢的问题,给出了一种OMP的改进方案,该方案将图像进行分块再处理,从而大幅降低了OMP算法迭代的矩阵规模。在相同条件下该算法的主客观重建效果均优于原来的算法。     

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

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

基于矩阵分解的压缩感知算法研究

奈奎斯特采样定律是长久以来具有指导意义的经典信号处理技术,它提出信号在采样过程中,当且仅当采样率大于信号带宽的2倍时,才能精确重构信号。压缩感知理论突破了奈奎斯特采样定理对信号采样率的限制,以更低采样率采样信号,并通过适当的重构算法恢复信号。文中以压缩感知理论为基础,结合目前广泛采用的正交匹配追踪算法,基于矩阵分解思想,提出2种改进算法,在运算复杂度方面取得优化,并且满足信号处理时对重构精度的要求。     

基于压缩感知的信号重构

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

一种改进的压缩感知重构算法

压缩感知理论提供了一种全新的信号获取方式:引入信号的稀疏性,利用少量观测值,通过重构算法实现信号的高精度重构.构建快速、稳定的重构算法是压缩感知理论的主要研究方向之一.为了解决子空间追踪算法依赖于稀疏度的先验信息和重构质量较差的问题,提出一种改进的自适应子空间追踪算法.算法在选择原子的过程中,引入弱选择标准自适应地选择初始候选集,接着通过正则化过程对初始候选集中的原子进行筛选,算法在选择最终支撑集过程中,可以自适应调节支撑集原子个数.应用一维随机信号和二维图像进行重构实验,测试算法的稳定性、重构精度和重构时间,与正交匹配追踪算法、子空间追踪算法、正则化正交匹配追踪算法和稀疏度自适应匹配追踪算法进行对比实验,实验结果表明所提算法可以实现信号的高精度重构,重构稳定性和重构精度与同类算法相比有明显提升.     

一种压缩感知重构算法

为提高压缩感知重构精度,该文提出一种分段弱阈值修正共轭梯度追踪算法。该算法修正了方向追踪算法的方向,明确给出了搜寻原子下标的停止迭代准则,利用搜寻所得下标集通过最小二乘法得到稀疏信号的估计值。仿真结果表明在同等稀疏的条件下实现精确重构,该算法与匹配追踪(MP)算法和分段正交匹配追踪FDR阈值算法(StOMP-FDR)相比,所需的观测值个数少20%;在处理2维图像信号时,其重构精度比分段正交匹配追踪FAR阈值算法(StOMP-FAR)和贝叶斯算法(BCS)高1%。     

压缩感知重构算法研究

压缩感知技术突破了奈奎斯特准则的局限性,在图像处理方面有着广泛的应用。在精典TV重构算法的基础上通过对测量矩阵与迭代过程加以改进,以测量值基本逆变换(IY)作为迭代初值的IY-TV重构算法;TV算法有利于去除信号的中噪声,在迭代过程中与IY变换图像差值相联合重建原始信号。测量矩阵直接影响图像的重构质量,设计与该算法相适应的测量矩阵以提取更多的基本信息。实验表明,该算法可以在较低采样率时,同样重构出较高的图像质量。     

一种稀疏重构的相关干涉仪测向算法

针对基于凸优化模型的相关干涉仪测向算法计算量过大的问题,提出了一种基于稀疏度自适应匹配追踪算法的相关干涉仪测向算法.该算法首先根据压缩感知原理利用传统相关干涉仪算法的测向数据库作为基底将入射信号稀疏表示;接着,根据贪婪算法对信号进行重构,估计入射信号的方位.该算法的优点在于在迭代过程中引入回溯思想,自动调整估计步长,实...     

改进的压缩感知测量矩阵优化方法

压缩感知理论中,测量矩阵优化是一类通过减小测量矩阵与稀疏字典的互相关性来改善测量矩阵性能的方法。本文提出一种能够同时降低整体相关系数和最大值相关系数的测量矩阵优化算法,该算法分为两步:一是通过平均化Gram矩阵特征值来降低测量矩阵的整体相关系数;二是利用阈值函数收缩Gram矩阵非对角线上较大值。两个步骤交替执行,直到解出符合优化要求的测量矩阵。该算法在保证整体相关系数降到最低的同时,又使最大值相关系数显著降低。实验结果表明,与现有算法进行对比,本文方法在降低相关系数和重构成功率上都有一定优势。      

一种基于压缩感知的信号重建新算法

在求解基追踪问题的线性化Bregman迭代方法基础上，结合了广义逆的迭代技术得到一种稀疏信号重构的新算法。该算法在计算Moore-Penrose广义逆时，采用了迭代计算的方式，与算法本身相结合使得仅有矩阵向量乘积运算，避免了奇异值分解的较大工作量。通过数值试验可知，新算法相对线性化Bregman算法在计算时间上约减少了2/3，同时信号的恢复效果也是稳定有效的。因此，新算法是一种有效可行的信号重建算法。     

基于小波基的压缩感知重构算法设计

针对传统重构理论下对硬件设备的高要求和高损耗问题,提出基于小波基的压缩感知重构算法,利用小波变换在图像压缩重构上的优势,选取合适的小波基作为稀疏基,对一维信号和二维图像采用正交匹配追踪(OMP)算法,进行信号的压缩和重构,并对算法进行相应的改进。实验表明,压缩感知理论用于数字信号和数字图像处理有着显著的优势。     

Optimal-correlation-based reconstruction for distributed compressed video sensing

Distributed compressed video sensing (DCVS) is a framework that integrates both compressed sensing and distributed video coding characteristics to achieve a low-complexity video coding. However, how to design an efficient joint reconstruction by leveraging more realistic signal models is still an open challenge. In this paper, we present a novel optimal-correlation-based reconstruction method for compressively sampled videos from multiple measurement vectors. In our method, the sparsity is mainly exploited through inter-signal correlations rather than the traditional frequency transform, wherein the optimization is not only over the signal space to satisfy data consistency but also over all possible linear correlation models to achieve minimum-l₁-norm correlation noise. Additionally, a two-phase Bregman iterative based algorithm is outlined for solving the optimization problem. Simulation results show that our proposal can achieve an improved reconstruction performance in comparison to the conventional approaches, and especially, offer a 0.7–9.9 dB gain in the average PSNR for DCVS.     

基于压缩感知的图像压缩抗干扰重构算法

针对传统图像变换压缩方法压缩的图像经无线信道传输时受高斯随机干扰导致重要变换系数失真出现重构图像局部内容缺失的现象,本文根据压缩感知(CS)信号分量具有同等重要性的特性,理论分析了去除失真CS信号分量以抵御干扰的可行性,提出一种基于CS的图像压缩抗干扰重构算法。算法首先假定已知受高斯随机干扰的比特所对应的CS信号分量的位置,然后根据这些位置确定新的CS信号和重构矩阵,再进行阈值迭代重构。仿真结果表明,本文算法在低误码率(BER)下得到精确重构的图像,在高BER下得到图像内容无缺失仅全局质量小幅下降的重构图像。因此,基于CS的图像压缩抗干扰重构算法能够较好地克服变换压缩方法以及阈值迭代重构算法抗干扰能力低的不足,从而为图像无线传输抗高斯随机干扰问题提供一种可行的解决方案。     

Energy-based adaptive matching pursuit algorithm for binary sparse signal reconstruction in compressed sensing

Compressed sensing gains great attention in the field of signal reconstruction. In order to deal with some practical cases in which the sparsity levels are unknown, this paper proposes an energy-based adaptive matching pursuit (EAMP) algorithm for binary sparse signal reconstruction in the compressed sensing framework. The EAMP algorithm inherits the feature of the sparsity adaptive matching pursuit algorithm, which increases the estimated sparsity level when the energy of the observation residue increases. Meanwhile, the proposed algorithm introduces the measurement vector into the signal reconstruction process. It uses two kinds of step sizes to increase the estimated sparsity level when the energy of the estimated candidate signal is less than half of that of the measurement vector. The experimental results indicate that the proposed EAMP algorithm provides better reconstruction performance than other greedy algorithms.     

Sampling adaptive block compressed sensing reconstruction algorithm for images based on edge detection

In this paper, a sampling adaptive for block compressed sensing with smooth projected Landweber based on edge detection （SA-BCS-SPL-ED） image reconstruction algorithm is presented. This algorithm takes full advantage of the characteristics of the block compressed sensing, which assigns a sampling rate depending on its texture complexity of each block. The block complexity is measured by the variance of its texture gradient, big variance with high sampling rates and small variance with low sampling rates. Meanwhile, in order to avoid over-sampling and sub-sampling, we set up the maximum sampling rate and the minimum sampling rate for each block. Through iterative algorithm, the actual sampling rate of the whole image approximately equals to the set up value. In aspects of the directional transforms, discrete cosine transform （DCT）, dual-tree discrete wavelet transform （DDWT）, discrete wavelet transform （DWT） and Contourlet （CT） are used in experiments. Experimental results show that compared to block compressed sensing with smooth projected Landweber （BCS-SPL）, the proposed algorithm is much better with simple texture images and even complicated texture images at the same sampling rate. Besides, SA-BCS-SPL-ED-DDWT is quite good for the most of images while the SA-BCS-SPL-ED-CT is likely better only for more-complicated texture images.     

改进的多尺度压缩感知方案

传统多尺度压缩感知方案只对设定的小波变换系数采样,不用于采样的小波系数直接置零,造成重建图像边缘粗糙,影响图像重建质量。针对该问题,提出了一种改进的多尺度压缩感知方案。新方案在原方案获得的重建图像基础上,通过轮廓波变换对重建图像进行图像插值,在保持重建得到的小波系数不变的同时估计出原来被直接置零的小波系数,从而改进了图像重建质量。通过仿真实验证明了改进的多尺度压缩感知方案的有效性,并且与传统多尺度压缩感知方案相比能得到效果更好的重建图像。     

一种基于压缩传感和SART的图像重建迭代算法

滤波反投影算法已被广泛应用到CT图像重建领域,但由于算法需要大量的投影数据,会延长扫描时间和累积高剂量的辐射。为了降低辐射的剂量,文中提出一种基于压缩传感和联合代数重建方法 (SART)的迭代算法,将图像的梯度稀疏性与SART图像重建相结合,减小梯度图像的l1范数直至算法迭代结束。实验结果表明,文中算法能利用少量的投影数据准确地重建出图像,减少了由于投影数据不充分而造成的条状伪影。     

Dictionary learning based reconstruction for distributed compressed video sensing

Distributed compressed video sensing (DCVS) is a framework that integrates both compressed sensing and distributed video coding characteristics to achieve a low-complexity video coding. However, how to design an efficient reconstruction by leveraging more realistic signal models that go beyond simple sparsity is still an open challenge. In this paper, we propose a novel “undersampled” correlation noise model to describe compressively sampled video signals, and present a maximum-likelihood dictionary learning based reconstruction algorithm for DCVS, in which both the correlation and sparsity constraints are included in a new probabilistic model. Moreover, the signal recovery in our algorithm is performed during the process of dictionary learning, instead of being employed as an independent task. Experimental results show that our proposal compares favorably with other existing methods, with 0.1–3.5 dB improvements in the average PSNR, and a 2–9 dB gain for non-key frames when key frames are subsampled at an increased rate.