Explicit measurements with almost optimal thresholds for compressed sensing
暂无分享,去创建一个
[1] Martin Vetterli,et al. Sampling and reconstruction of signals with finite rate of innovation in the presence of noise , 2005, IEEE Transactions on Signal Processing.
[2] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[3] Emmanuel J. Candès,et al. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.
[4] Emmanuel J. Candès,et al. Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.
[5] Ron M. Roth,et al. Efficient decoding of Reed-Solomon codes beyond half the minimum distance , 2000, IEEE Trans. Inf. Theory.
[6] Madhu Sudan,et al. Reconstructing curves in three (and higher) dimensional space from noisy data , 2003, STOC '03.
[7] D. Donoho,et al. Thresholds for the Recovery of Sparse Solutions via L1 Minimization , 2006, 2006 40th Annual Conference on Information Sciences and Systems.
[8] R. Tibshirani. Regression Shrinkage and Selection via the Lasso , 1996 .
[9] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[10] David L. Donoho,et al. High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension , 2006, Discret. Comput. Geom..
[11] Vahid Tarokh,et al. Performance Bounds on Sparse Representations Using Redundant Frames , 2007, ArXiv.