期刊文献+

压缩感知框架下非均匀信息采集及重构 被引量:2

Non-uniform information acquisition and reconstruction within compressed sensing framework
下载PDF
导出
摘要 为提高现有直接信息均匀压缩采样(Analog to information conversion,AIC)的观测效率和性能,在能量准则下,提出非均匀信息采集(Non-uniform information acquisition,NUIA),充分利用信息的重要性先验,即对信号随机调制后,依据能量进行变速率的采集,能量越大的信号段采样速率越高,反之亦然。结合支撑域扩充、剪枝的思路提出变速匹配追踪(Variable rate matching pursuit,VRMP)算法,通过引入非均匀观测的先验支撑集,并在追踪过程中将其与迭代估计出的支撑集相并,提高了重构精度。理论分析和实验结果表明了NUIA-VRMP的有效性。特别地,相比于常规AIC的子空间追踪重构,NUIA-VRMP的组合能在低采样速率条件(如20%的Nyquist速率)下获得50dB的重构增益。 The existing Analog information measurement, and Under the energy criterion, a After random modulation, the higher Variabl the sampling rate is an to Information Conversation (AIC) is based on uniform-low-rate the importance prior information contained in the signal is underused. Non-Uniform Information Acquisition (NUIA) method is proposed. signal is sampled at non-uniform-rate that the bigger the energy is the d vice versa. Combing the idea of support merger with pruning, a e Rate Matching Pursuit (VRMP) algorithm is pr united with the set of Compared with the Subs NUIA-VRMP can obtain signal appropriation support, pace Pursuit (SP) reconstruc 50dB reconstruction gain at ultra oposed. The prior support set, which is able to promote the recovery accuracy. of conventional AIC, the combination of low-rate, (e. g. 20% Nyquist Rate).
出处 《吉林大学学报(工学版)》 EI CAS CSCD 北大核心 2014年第4期1209-1214,共6页 Journal of Jilin University:Engineering and Technology Edition
基金 '泰山学者'建设工程专项经费资助项目
关键词 信息处理技术 直接信息采样 压缩感知 重构算法 非均匀采样 information processing technology analog to information conversion compressed sensing reconstruction algorithm non-uniform sampling
  • 相关文献

参考文献16

  • 1Cand6s E J, Wakin M B. An introduction to com- pressive sampling[J]. IEEE Signal Processing Mag- azine,2008,25(2) : 21-30.
  • 2Donoho D L. Compressed sensing[J]. IEEE Trans on Information Theory,2006,52(4) : 1289-1306.
  • 3Strohmer T. Measure what should be measured: progress and challenges in compressive sensing[J]. IEEE Signal Processing Letters, 2012,19(12) : 887- 893.
  • 4Laska J, Kirolos S, Massoud Y, et al. Random sam- pling for analog-to-information conversion of wide- band signals[C]//IEEE Dallas Circuits and Systems Workshop ( DCAS), Richardson, TX, 2006.
  • 5Kirolos S, Laska J, Wakin M, et al. Analog-to-information conversion via random demoduIa- tion[C]//IEEE Dallas Circuits and Systems Work- shop (DCAS), Richardson, TX, 2006.
  • 6Laska J, Kirolos S, Duarte M, et al. Theory and im- plementation of an analog-to-information converter using random demodulation[C]//IEEE International Sympo- sium on Circuits and Systems, ISCAS, New Orleans, LA, 2007.
  • 7Tropp J A, Laska J N, Duarte M F, et al. Beyond Nyquist: efficient sampling of sparse bandlimited sig- nals[J]. IEEE Trans on Information Theory, 2010,56 (1) : 520-544.
  • 8Taheri O, Vorobyov S A. Segmented compressed sam- pling for analog-to-information conversion: method and performance analysis[J]. IEEE Trans on Signal Pro- cessing,2011,59(2) :554 572.
  • 9Tropp J A, Gilbert A C. Signal recovery from random measurements via orthogonal matching pursuit [J]. IEEE Transactions on Information Theory, 2007, 53 (12) : 4655-4666.
  • 10Dai W, Milenkovic O. Subspace pursuit for compressive sensing signal reconstruction[J]. IEEE Trans on Infor- mation Theory, 2009,55 (5) : 2230-2249.

二级参考文献52

  • 1D Donoho. Compressed sensing[ J]. IEEE Trans Inform Theory,2006,52(4) : 1289 - 1306.
  • 2M A T Figueiredo, R D Nowak, S J Wright. Gradient projection for sparse reconstruction: Appfication to compressed sensing and other inverse problems [ J ]. IEEE J Selected Topics in Signal Processing: Special Issue on Convex Optimization Methods for Signal Processing, 2007,1(4) :586 - 598.
  • 3I Daubechies, M Defrise, C De Mol. An iterative thresholding algorithm for finear inverse problems with a sparsity constraint [ J]. Comm Pure Appl Math,2004,57( 11 ):1413 - 1457.
  • 4T Blumensath, M Davies. Iterative hard thresholding for compressed sensing[ J]. Appl Comput Harmon Anal, 2009, 27 ( 3 ) : 265 - 274.
  • 5A C Gilbert, S Guha, P Indyk, S Muthukrishnan, M J Strauss. Near-optimal sparse Fourier representations via sampling[ A]. Proc. of the 2002 ACM Symposium on Theory of Computing STOC[C]. Montreal, Quebec, Canada, 2002. 152 - 161.
  • 6E Candbs, J Romberg, T Tao. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information [ J]. IEEE Trans Inform Theory ,2006,52(2) :489- 509.
  • 7E Candes, T Tao. Error correction via linear programming [A]. Proc. of 46th Annual IEEE Symposium on Foundations of Computer Science FOCS [ C ] . Pittsburgh, Pennsylvania, USA. 2005.295 - 308.
  • 8S Mallat, Z Zhang. Matching pursuit in a time-frequency dictionary[ J]. IEEE Trans Singal Processing, 1993,41 (12) : 3397 - 3415.
  • 9E J Candes, T Tao. Decoding by linear programming [ J ]. IEEE Trans Inform Theory,2005,51 (12):4203- 4215.
  • 10S J Kim, K Koh, M Lustig, S Boyd, D Gorinevsky. A interiorpoint method for large-scale ly-regularized least-squares problems with applications in signal processing and statistics[J]. Journal of Machine Learning Research, 2007,7 ( 8 ) : 1519 - 1555.

共引文献132

同被引文献14

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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