Deterministic constructions of compressed sensing matrices

Journal of Complexity

Volumn 23, Issue 4-6, 2007, Pages 918-925

  DeVore, Ronald A ^a  

^a UNIVERSITY OF SOUTH CAROLINA   (United States)

Author keywords

Compressed sensing; Deterministic construction; Sampling; Widths

Indexed keywords

APPROXIMATION ALGORITHMS; MATRIX ALGEBRA; RANDOM PROCESSES; SAMPLING;

COMPRESSED SENSING; DETERMINISTIC CONSTRUCTION; GELFAND WIDTHS;

SIGNAL PROCESSING;

EID: 36248929865     PISSN: 0885064X     EISSN: 10902708     Source Type: Journal    
DOI: 10.1016/j.jco.2007.04.002     Document Type: Article

References (11)

1. R. Baraniuk, M. Davenport, R. DeVore, M. Wakin, The Johnson-Lindenstrauss meets compressed sensing, Constr. Approx., to appear.
2. C. de Boor, R. DeVore, K. Hoellig, Mixed norm n-widths, Proc. Amer. Math. Soc. 80 (1980) 577-583.
3. Candès E., and Tao T. Decoding by linear programming. IEEE Trans. Inform. Theory 51 (2005) 4203-4215
4. A. Cohen, W. Dahmen, R. DeVore, Compressed sensing and best k-term approximation, submitted for publication.
5. R. DeVore, Optimal Computation, vol. I, Proceedings of ICM 2006, Madrid, European Mathematical Society Publishing House, 2007, to appear.
6. Donoho D. Compressed sensing. IEEE Trans. Inform. Theory 52 (2006) 1289-1306
7. Gluskin E.D. Norms of random matrices and widths of finite-dimensional sets. Math. USSR Sb. 48 (1984) 173-182
8. Kashin B. The widths of certain finite dimensional sets and classes of smooth functions. Izvestia 41 (1977) 334-351
9. Lorentz G.G., von Golitschek M., and Makovoz Yu. Constructive Approximation: Advanced Problems, Springer Grundlehren vol. 304 (1996), Springer, Berlin, Heidelberg
10. q. Math. Zametki 40 (1986) 161-173
11. Maiorov V. Linear diameters of Sobolev classes. Soviet Dokl. 43 (1991) 1127-1130