Compressive Sampling
暂无分享,去创建一个
[1] W. Steiger,et al. Least Absolute Deviations: Theory, Applications and Algorithms , 1984 .
[2] A. Pinkus. n-Widths in Approximation Theory , 1985 .
[3] D. Donoho,et al. Uncertainty principles and signal recovery , 1989 .
[4] Stanislaw J. Szarek,et al. Condition numbers of random matrices , 1991, J. Complex..
[5] B. Logan,et al. Signal recovery and the large sieve , 1992 .
[6] Yishay Mansour,et al. Randomized Interpolation and Approximation of Sparse Polynomials , 1992, SIAM J. Comput..
[7] Noga Alon,et al. The space complexity of approximating the frequency moments , 1996, STOC '96.
[8] R. Tibshirani. Regression Shrinkage and Selection via the Lasso , 1996 .
[9] Martin Vetterli,et al. Data Compression and Harmonic Analysis , 1998, IEEE Trans. Inf. Theory.
[10] Michael A. Saunders,et al. Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..
[11] S. Mallat. A wavelet tour of signal processing , 1998 .
[12] Xiaoming Huo,et al. Uncertainty principles and ideal atomic decomposition , 2001, IEEE Trans. Inf. Theory.
[13] Thierry Blu,et al. Sampling signals with finite rate of innovation , 2002, IEEE Trans. Signal Process..
[14] Michael Elad,et al. Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization , 2003, Proceedings of the National Academy of Sciences of the United States of America.
[15] Rémi Gribonval,et al. Sparse representations in unions of bases , 2003, IEEE Trans. Inf. Theory.
[16] Arkadi Nemirovski,et al. On sparse representation in pairs of bases , 2003, IEEE Trans. Inf. Theory.
[17] Jean-Jacques Fuchs,et al. On sparse representations in arbitrary redundant bases , 2004, IEEE Transactions on Information Theory.
[18] E. Candès,et al. New tight frames of curvelets and optimal representations of objects with piecewise C2 singularities , 2004 .
[19] E. Candès,et al. Error correction via linear programming , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[20] David L. Donoho,et al. Neighborly Polytopes And Sparse Solution Of Underdetermined Linear Equations , 2005 .
[21] S. Mendelson,et al. Reconstruction and subgaussian processes , 2005 .
[22] E. Candès,et al. Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.
[23] Anna C. Gilbert,et al. Improved time bounds for near-optimal sparse Fourier representations , 2005, SPIE Optics + Photonics.
[24] H. Rauhut. Random Sampling of Sparse Trigonometric Polynomials , 2005, math/0512642.
[25] J. Tropp,et al. SIGNAL RECOVERY FROM PARTIAL INFORMATION VIA ORTHOGONAL MATCHING PURSUIT , 2005 .
[26] Justin Romberg,et al. Practical Signal Recovery from Random Projections , 2005 .
[27] Emmanuel J. Candès,et al. Decoding by linear programming , 2005, IEEE Transactions on Information Theory.
[28] D. Donoho,et al. Neighborliness of randomly projected simplices in high dimensions. , 2005, Proceedings of the National Academy of Sciences of the United States of America.
[29] M. Rudelson,et al. Smallest singular value of random matrices and geometry of random polytopes , 2005 .
[30] M. Rudelson,et al. Geometric approach to error-correcting codes and reconstruction of signals , 2005, math/0502299.
[31] Robert D. Nowak,et al. Signal Reconstruction From Noisy Random Projections , 2006, IEEE Transactions on Information Theory.
[32] Yaakov Tsaig,et al. Extensions of compressed sensing , 2006, Signal Process..
[33] D. Donoho. For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution , 2006 .
[34] D. Donoho. For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution , 2006 .
[35] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[36] Emmanuel J. Candès,et al. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.
[37] Richard G. Baraniuk,et al. A new compressive imaging camera architecture using optical-domain compression , 2006, Electronic Imaging.
[38] Richard G. Baraniuk,et al. Compressive imaging for video representation and coding , 2006 .
[39] Emmanuel J. Candès,et al. Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions , 2004, Found. Comput. Math..
[40] Joel A. Tropp,et al. Just relax: convex programming methods for identifying sparse signals in noise , 2006, IEEE Transactions on Information Theory.
[41] Emmanuel J. Candès,et al. Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.
[42] R. DeVore. Optimal computation , 2006 .
[43] J. Haupt,et al. Compressive wireless sensing , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.
[44] M. Rudelson,et al. Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements , 2006, 2006 40th Annual Conference on Information Sciences and Systems.
[45] Terence Tao,et al. The Dantzig selector: Statistical estimation when P is much larger than n , 2005, math/0506081.