期刊文献+

基于稀疏贝叶斯学习的联合平移不变子空间压缩采样

Compressed Sampling in Union of Shift-Invariant Subspace Based on Sparse Bayesian Learning
下载PDF
导出
摘要 针对一类特殊的有效核函数(active kernel)未知的联合平移不变子空间(Union of Shift-Invariant Subspaces,USI)信号,构建了一种压缩采样模型,将信号的重构过程看作一个线性回归问题,利用稀疏贝叶斯学习(sparsebayesian learning,SBL)算法求得该回归模型中的权值参数的最优估计,根据权值参数向量集的支撑集实现信号的稀疏重构。理论分析表明,对于由M个核函数(kernel)以T为周期平移生成的平移不变空间(Shift-InvariantSpaces,SI),若M个核函数中至多有K(1≤K≤M/2)个且未知哪K个有效时,本文构建的压缩采样模型最低采样率能够达到2K/T,这也是利用稀疏度K所能达到的理论上的最低采样率。仿真结果表明,构建的压缩采样模型能够有效降低这类信号的采样率。 For the signals in a special union of shift-invariant subspaces(USI) when the active kernel functions are unknown,a concrete compressed sampling scheme is proposed.We regard the process of signal reconstruction as a lin-ear regression model and acquire the optional weights by sparse bayesian learning,then the signal can be reconstructed accurately from the support of weight vector set.For a continuous-time sparse signal in shift-invariant spaces which is generated by M kernels with period T,however,there are only K out of the M kernels are active and we do not know which K are chosen,we can sample the signal at 2K/T rate by the sampling scheme,which is the minimal sampling rate with exploiting sparsity K.Simulation results are presented to show that our compressed sampling scheme can reduce the sampling rate effectively.
出处 《信号处理》 CSCD 北大核心 2012年第5期680-685,共6页 Journal of Signal Processing
基金 国家自然科学基金(60702015)资助
关键词 联合平移不变子空间 压缩采样 稀疏重构 稀疏贝叶斯学习 union of shift-invariant subspaces compressed sampling sparse reconstruction sparse bayesian learning
  • 相关文献

参考文献11

  • 1BUTZER P L. A survey of the Whittaker-Shannon sam- piing theorem and some of its extensions [ J ]. J. Math. Res. Expo,1983(3) :185-212.
  • 2CHEN W, ITOH S, SHIKI J. On sampling in shift-invar- iant spaces [ J ]. IEEE Trans. Inf..thneory, 2000,10 (2) : 2802-2810.
  • 3ELDAR Y. C, WERTHER T. General framework for con- sistent sampling in Hilbert spaces[ J ]. Int. J. Wavelets, Multiresolution Inf. Process..2005.3 (4) _.497-509.
  • 4SELESNICK I W. Interpolating multiwavelets bases and the sampling theorem [ J ]. IEEE Trans. Signal Process. , 1999,47 (6) : 1615-1621.
  • 5Y. C. Eldar, Compressed sensing of analog signals in shiftinvariant spaces [J ]. IEEE Trans. Signal Process. , Aug. 2009,57 (8) : 2986-2997.
  • 6D. L. Donoho, Compressed sensing [ J ]. IEEE Trans. Inf. Theory, Apr. 2006,52 : 1289-1306.
  • 7D L Donoho, Y Tsaig. Extensions of compressed sensing [ J ]. Signal Processing. 2006,86 ( 3 ) : 533-548.
  • 8M. Mishali and Y. C. Eldar, Reduce and boost: Recove- ring arbitrary sets of jointly sparse vectors [ J ~. IEEE Trans. Signal Process. , Oct. 2008,56(10) :4692-4702.
  • 9J. B. Kruskal, Three-way arrays: Rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics [ J ]. Linear Alg. Applicat. , 1977 ,t8 (2) :95-138.
  • 10S. F. Cotter, B. D. Rao, K. Engan, and K. Kreutz Delgado, Sparse solutions to linear inverse problems with multiple measurement vectors ~ J 3. IEEE Trans. Signal Process. , Jul. 2005,53 (7) :2477-2488.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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