期刊文献+

一种基于数据平滑的压缩感知信号重构法

A reconstruction algorithm applicable to compressive sensing by data smoothing
下载PDF
导出
摘要 本文针对压缩感知中低信噪比信号重构问题,提出了一种基于数据平滑的信号重构算法。算法分为两步,第一步将采样值分段,并求出连续若干段采样矢量的算术平均值;第二步针对采样矢量的算术平均值,基于l1-范数最小准则估计其非零系数位置用于构造信号子空间,而后利用获得的信号子空间针对每段采样矢量分别求解非零系数的值,并重构信号。该方法适用于稳定信号,理论分析与仿真都表明本算法的性能优于标准正交匹配追踪方法。 In this paper,a reconstruction algorithm applicable to compressed sensing by data smoothing for stable low SNR signal is proposed.The algorithm is divided into two steps: the first step is to intercept the samples and then get the arithmetic mean of several continuous sections of sample vectors.The second step is to locate the position of the non-zero coefficients according to the mean sample vector based on l1-norm minimization so as to construct the signal subspace.Then,solve the value of the non-zero coefficients according to each sample vector based on l2-norm minimization and reconstruct the signal.This method is suitable for the reconstruction of stable signal.Both the analysis and the simulation show that in the noisy setting,the performance exceeds that of the standard orthogonal matching pursuit algorithm.
作者 李立春 魏峰
出处 《电路与系统学报》 北大核心 2013年第2期97-101,共5页 Journal of Circuits and Systems
关键词 压缩采样 紧支撑 噪声抑制 稀疏信号 compressed sensing tight suport noise suppression sparse signal
  • 相关文献

参考文献15

  • 1Joel A. Tropp, Anna C. Gilbert. Signal recovery from random measurement s Via Orthogonal Matchinh Pursuit [J]. IEEE Trans. Inform. Theory, 2007, 53(12): 4655-4666.
  • 2A Feuer, A Nemirovsky. On sparse representation in pairs of bases [J]. IEEE Trans Inform Theory, 2003, 49(6): 1579.
  • 3D L Donoho, Y Tsaig, I Drori, et al. Sparse solution of under determined linear equations by stagewise orthogonal matching pursuit [R]. Technical Report, 2006.
  • 4D Needell, RVershynin. Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit [OL]. http://www, math. ucdavis, edu/%7Evershynin/papers/ROMP-stability.pdf.
  • 5W Dai, O Milenkovic. Subspace pursuit for compressive sensing: Closing the gap between performance and complexity [J]. IEEE Trans. On Information Theory, 2009, 55(5): 2230-2249:
  • 6T. Bluemensah, M E Davies. Gradient pursuit [J]. IEEE Trans. Signal Processing, 2008, 56(6): 2370-2382.
  • 7S J Kim, K Koh, M Lustig, et al. Gorinevsky. A method for large-scale-regularized least-squares [J]. IEEE Journal on Selected Topics in Signal Processing, 2007, 4(1): 606-617.
  • 8M A T Figueiredo, R D Nowak, S J Wright. Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems [J]. Journal of Selected Topics in Signal Processing: Special Issue on Convex Optimization Methods for Signal Processing, 2007, 1(4): 586-598.
  • 9I Daubechies, M Defrise, C De Mol. An iterative thresholding algorithm for linear inverse problems with a sparsity constraint [J]. Comm. Pure Appl, Math., 2004, 57(11): 1413-1457.
  • 10A CGilbert, S Guha, P Indyk, et al. Near-optimal sparse Fourier representations via sampling [A]. Proceedings of the Annual ACM Symposium on Theory of Computing [C]. Montreal, Que, Canad-a: Association for Computing Machinery. 2002. 152-161.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部