期刊文献+

基于行列式随机循环的压缩感知测量矩阵研究 被引量:1

Research on Measurement Matrix in Compressed Sensing Based on Random Circulant
下载PDF
导出
摘要 压缩感知理论,从信号的自身特性出发,通过变换作用域和线性投影实现对信号的采样和压缩。测量矩阵是该理论中获得的最优测量,实现精确重构的关键。本文在介绍常用测量矩阵的基础上,重点研究了结构化测量矩阵。鉴于测量矩阵设计的最重要的原则是降低矩阵元素间的相干性,借鉴循环矩阵和广义轮换矩阵的优点,提出了采用均匀随机数对结构化测量矩阵进行随机循环的构造方法。仿真实验表明新矩阵在信号重建上具有更好的性能。 Compressed sensing, depending on the fact that signals are sparsely or compressive in some fixed basis, samples and compresses the signal by linear projection. Measurement matrix plays the positive role in the theory. The common measurement matrix is researched, especially the structured matrix. As minimizing the coherence is an important way to design measurement ma- trix, the advantages of circulant matrix and generalized rotation matrix are learned and a new method to design a measurement matrix which based on random circulant is proposed. The simulation results suggest the new matrix has better performance in signal' s reconstruction.
出处 《电视技术》 北大核心 2015年第19期6-9,共4页 Video Engineering
关键词 压缩感知 测量矩阵 托普利兹矩阵 随机循环 compressed sensing measurement matrix Toeplitz matrix random circulant
  • 相关文献

参考文献12

  • 1DAVID L DONOHO. Compressed Sensing[J]. IEEE Trans. Infor- mation Theory,2006, 52 ( 4 ) : 1289-1306.
  • 2EMMANUEL J CANDE S. Compressive sampling[ J]. Proceedings of the International Congress of Mathematicians, 2006 (3):1433-1452.
  • 3MASOMEH A, AGHAGOLZADEH A,MARVASTI F. Towards opti- mization of toeplitz matrices for compressed sensing [ C ]//Proc. 2013 Iran Workshop on Communication and hfformation Theory (IWCIT). Tehran : IEEE Press, 2013 : 1-5.
  • 4LI K, CRISTIAN R R, SAIKAT C, et al. Piecewise toeplitz matri- ces-based sensing for rank minimization[ C ]//Proc. the 22nd Euro- pean Signal Processing Corfference. Lisbon: IEEE Press ,2014 :1836- 1840.
  • 5WAHEED U B,JARVIS D H,GIL M R, et al. Toeplitz-struetured compressed sensing matrices [ C]//Proc. the IEEE Workshop on Statistical Signal Processing. [ S. 1. ] :IEEE Press,2007:294-298.
  • 6EMMANUEL J C, MICHAEL B W. An introduction to compressive sampling[ J ]. IEEE Signal Processing Magazine, 2008, 25 (2) : 21-30.
  • 7EMMANUEL J C, TERENCE T. Decoding by linear programming[J]. IEEE Trans. Information Theory, 2005, 51 (3) :4023-4215.
  • 8JOEL A T, STEPHEN J W. Computational methods for sparse solu- tion of linear inverse problems[ J ]. Proceedings of the IEEE, 2010,98(16) :948-958.
  • 9EMMANUEL J C, TERENCE T. Near-optimal signal recovery from random projections: universal encoding strategies? [J]. IEEE Trans. Information Theory' ,2006,52 ( 12 ) :5406-5425.
  • 10傅迎华.可压缩传感重构算法与近似QR分解[J].计算机应用,2008,28(9):2300-2302. 被引量:31

二级参考文献15

  • 1方红,章权兵,韦穗.基于非常稀疏随机投影的图像重建方法[J].计算机工程与应用,2007,43(22):25-27. 被引量:27
  • 2CAND~S E, ROMBERG J, TAO T. Robust uncertainty principle: exact signal reconstruction from highly incomplete frequency information[ J]. IEEE Transactions on Information Theory, 2006, 52(2) : 489 - 509.
  • 3BARANIUK R G. Compressive sensing[ J]. IEEE Signal Processing Magazine, 2007, 24(4) : 118 - 121.
  • 4CANDES E, TAO T. Near optimal signal recovery from random matrix projections: universal encoding strategies? [ J]. IEEE Transactions on Information Theory, 2006, 52(2) : 489 - 509.
  • 5DONOHO D, HUO XIAO-MING. Uncertainty principles and ideal atomic decomposition [ J]. IEEE Transactions Information Theory, 2001,47(7) : 2845 - 62.
  • 6CHEN SHAO-BING, DONOHO D, SAUNDERS M. Atomic decomposition by basis pursuit[ R]. Technical Report 479, Department of Statistics, Stanford University, 2001 : 33 -61.
  • 7CANDES E. Compressive sampling[ C]//Proceedings of the International Congress of Mathematicians. Madrid, Spain: [ s. n. ], 2006: 1433 - 1452.
  • 8GOLUB G, LOAN C. Matrix computations[ M]. Johns Hopkins: Baltimore, 1996,
  • 9CHEN S, PURSUIT B, PH D. Thesis, department of Statistics[D]. Stanford, CA: Stanford University, 1995.
  • 10BOYD S, VANDENBERGHE L. Convex optimization[ M]. Cambridge, UK: Cambridge University Press, 2004.

共引文献30

同被引文献3

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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