Tree Structure Based Analyses on Compressive Sensing for Binary Sparse Sources
暂无分享,去创建一个
[1] Richard G. Baraniuk,et al. Compressive Sensing , 2008, Computer Vision, A Reference Guide.
[2] Richard Baraniuk,et al. Compressed Sensing Reconstruction via Belief Propagation , 2006 .
[3] Joel A. Tropp,et al. Algorithmic linear dimension reduction in the l_1 norm for sparse vectors , 2006, ArXiv.
[4] J. Tropp,et al. SIGNAL RECOVERY FROM PARTIAL INFORMATION VIA ORTHOGONAL MATCHING PURSUIT , 2005 .
[5] Feng Wu,et al. Analysis on Rate-Distortion Performance of Compressive Sensing for Binary Sparse Source , 2009, 2009 Data Compression Conference.
[6] Emmanuel J. Candès,et al. Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.
[7] A. Robert Calderbank,et al. Efficient and Robust Compressed Sensing using High-Quality Expander Graphs , 2008, ArXiv.
[8] Weiyu Xu,et al. Efficient Compressive Sensing with Deterministic Guarantees Using Expander Graphs , 2007, 2007 IEEE Information Theory Workshop.
[9] Joel A. Tropp,et al. Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.
[10] Richard G. Baraniuk,et al. Bayesian Compressive Sensing Via Belief Propagation , 2008, IEEE Transactions on Signal Processing.
[11] Richard G. Baraniuk,et al. Sudocodes ߝ Fast Measurement and Reconstruction of Sparse Signals , 2006, 2006 IEEE International Symposium on Information Theory.
[12] Vahid Tarokh,et al. A Frame Construction and a Universal Distortion Bound for Sparse Representations , 2008, IEEE Transactions on Signal Processing.