Extensions of compressed sensing

Signal Processing

Volumn 86, Issue 3, 2006, Pages 549-571

  Tsaig, Yaakov ^a   Donoho, David L ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Basis pursuit; Linear programming; Random matrix theory; Underdetermined systems of linear equations

Indexed keywords

APPROXIMATION THEORY; IMAGE SENSORS; LINEAR SYSTEMS; MATHEMATICAL TRANSFORMATIONS; SPURIOUS SIGNAL NOISE;

BASIS PURSUIT; RANDOM MATRIX THEORY; UNDERDETERMINED SYSTEMS OF LINEAR EQUATIONS;

IMAGE COMPRESSION;

EID: 30844433547     PISSN: 01651684     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.sigpro.2005.05.029     Document Type: Article

References (33)

1. A.C. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, and M. Strauss Near-optimal sparse Fourier representations via sampling Proceedings of the 34th ACM Symposium on Theory of Computing 2002 ACM Press New York 152 161
2. E.J. Candès, J. Romberg, T. Tao, Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information, Manuscript, 2004.
3. D.L. Donoho, Compressed sensing. Manuscript, submitted for publication, 2004. URL: http://www-stat.stanford.edu/∼donoho/Reports/2004.
4. E.J. Candès, T. Tao, Near optimal signal recovery from random projections: universal encoding strategies?, Manuscript, 2004.
5. S. Chen, D.L. Donoho, and M.A. Saunders Atomic decomposition by basis pursuit SIAM J. Sci. Comp. 20 1 1999 33 61
6. B.S. Kashin Diameters of certain finite-dimensional sets in classes of smooth functions Izv. Akad. Nauk SSSR, Ser. Mat. 41 2 1977 334 351
7. A.Y. Garnaev, and E.D. Gluskin On widths of the Euclidean ball Soviet Math. - Doklady 30 1984 200 203 (in English)
8. A. Pinkus, n -widths and Optimal Recovery in Approximation Theory, in: C. Carl de Boor (Ed.), Proceeding of Symposia in Applied Mathematics, vol. 36, American Mathematical Society, Providence, RI, 1986.
9. E. Novak On the power of Adaption J. Complexity 12 1996 199 237
10. E.J. Candès, J. Romberg, Practical signal recovery from random projections, Manuscript, 2004.
11. D.L. Donoho, and H. Xiaoming Uncertainty principles and ideal atomic decomposition IEEE Trans. Inform. Theory 47 7 Nov. 2001 2845 2862
12. D. Donoho, M. Elad, V. Temlyakov, Stable recovery of sparse overcomplete representations in the Presence of Noise, 2004, submitted for publication, 2004. URL: / ∼ donoho/Reports/2004.
13. D.L. Donoho, For most large underdetermined systems of linear equations, the minimal ℓ 1 solution is also the sparsest solution, Manuscript, 2004, submitted for publication. URL: < http://www-stat.stanford.edu > / ∼ donoho/Reports/2004.
14. D.L. Donoho, For most underdetermined systems of linear equations, the minimal ℓ 1 -norm near-solution approximates the sparsest near-solution, Manuscript, submitted for publication, 2004. URL: http:// < www-stat.stanford.edu > / ∼ donoho/Reports/2004.
15. M. Elad, and A.M. Bruckstein A generalized uncertainty principle and sparse representations in pairs of bases IEEE Trans. Inform. Theory 49 2002 2558 2567
16. J.J. Fuchs On sparse representations in arbitrary redundant bases IEEE Trans. Inform. Theory 50 6 June 2004 1341 1344
17. R. Gribonval, and M. Nielsen Sparse representations in unions of bases IEEE Trans. Inform. Theory 49 12 December 2003 1320 1325
18. R. Gribonval, M. Nielsen, Highly sparse representations from dictionaries are unique and independent of the sparseness measure, Manuscript, 2003.
19. B.K. Natarajan Sparse approximate solutions to linear systems SIAM J. Comput. 24 1995 227 234
20. J.A. Tropp Greed is good: algorithmic results for sparse approximation IEEE Trans Inform. Theory 50 11 October 2004 2231 2242
21. J.A. Tropp, Just relax: convex programming methods for subset selection and Sparse Approximation, Manuscript, 2004.
22. J. Buckheit, and D.L. Donoho WaveLab and reproducible research A. Antoniadis Wavelets and Statistics 1995 Springer Berlin
23. Y. Tsaig, D.L. Donoho, Breakdown of Equivalence between the minimal ℓ 1 -norm Solution and the Sparsest Solution, submitted for publication, 2004. URL: < http://www-stat.stanford.edu > / ∼ donoho/Reports/2004.
24. D.L. Donoho, Neighborly polytopes and sparse solution of underdetermined linear equations, Technical Report, Department of Statistics, Stanford University, 2004-2005.
25. D.L. Donoho, High-dimensional centrosymmetric polytopes with neighborliness proportional to dimension, Tech. Report, Department of Statistics, Stanford University 2005.
26. A. Pinkus n -Widths in Approximation Theory 1985 Springer Berlin
27. R.R. Coifman, D.L. Donoho, Translation-invariant denoising, in: A. Antoniadis, G. Oppenheim (Eds.), Wavelets and Statistics, Lecture Notes Statistics, vol. 103, Springer, New York, 1995, pp. 125-150.
28. J.J. Fuchs, Recovery of exact sparse representations in the presence of bounded noise, Technical Report IRISA no. 1618, 2004.
29. E.J. Candès, T. Tao, Stable signal recovery from noisy and incomplete observations, Manuscript, 2005.
30. J. Haupt, R. Nowak, Signal reconstruction from noisy random projections, Manuscript, 2005.
31. E.J. Candès, and D.L. Donoho New tight frames of curvelets and optimal representations of objects with piecewise C 2 singularities Comm. Pure Appl. Math. LVII 2004 219 266
32. M. Rudelson, R. Vershynin, Geometric approach to error-correcting codes and reconstruction of signals, Technical Report, Department of Mathematics, University of California at Davis, 2005.
33. J.A. Tropp, A. Gilbert, Signal recovery from partial information by orthogonal matching pursuit, Manuscript, 2005.