Compressed sensing and best K-term approximation

Journal of the American Mathematical Society

Volumn 22, Issue 1, 2009, Pages 211-231

  Cohen, Albert ^a   Dahmen, Wolfgang ^b   Devore, Ronald ^c  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b RWTH AACHEN UNIVERSITY   (Germany)

^c UNIVERSITY OF SOUTH CAROLINA   (United States)

Author keywords

1 minimization; Best K term approximation; Compressed sensing; Gaussian and bernoulli ensembles; Gelfand width; Instance optimal decoders; Mixed instance optimality; Null space property; Random matrices; Restricted isometry property

Indexed keywords

EID: 57349181932     PISSN: 08940347     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0894-0347-08-00610-3     Document Type: Article

References (17)

1. D. Achilioptas, Database-friendly random projections, Proc. ACM Symposium on the Principles of Database Systems, pp. 274-281, 2001.
2. R. Baraniuk, M. Davenport, R. DeVore, and M. Wakin, A simple proof of the restricted isometry property for random matrices, available as "online first", Constr. Approx. 28 (3) (2008), DOI.10.1007/s00365-007-9003-x.
3. E. J. Candès, J. Romberg, and T. Tao, Robust Uncertainty Principles: Exact Signal Reconstruction from Highly Incomplete Frequency Information, IEEE Trans. Inf. Theory, 52 (2006), 489-509. MR2236170 (2007e:94020)
4. E. Candès, J. Romberg, and T. Tao, Stable signal recovery from incomplete and inaccurate measurements, Comm. Pure and Appl. Math., 59 (2006), 1207-1223. MR2230846 (2007f:94007)
5. E. Candès, and T. Tao, Decoding by linear programming, IEEE Trans. Inf. Theory 51 (2005), 4203-4215. MR2243152 (2007b:94313)
6. E. Candès and T. Tao, Near optimal signal recovery from random projections: universal encoding strategies, IEEE Trans. Inf. Theory 52 (2006), 5406-5425. MR2300700 (2008c:94009)
7. G. Cormode and S. Muthukrishnan, Towards an algorithmic theory of compressed sensing, Technical Report 2005-25, DIMACS, 2005, also Proc. SIROCCO, 2006.
8. D. Donoho, Compressed Sensing, EEE Trans. Information Theory, 52 (2006), 1289-1306. MR2241189 (2007e:94013)
9. A. Garnaev and E. D. Gluskin, The widths of a Euclidean ball, Doklady AN SSSR, 277 (1984), 1048-1052. MR759962 (85m:46023)
10. A. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss, How to summarize the universe: Dynamic maintenance of quantiles, Proc. VLDB, 2002, 454-465.
11. A. Gilbert, S. Guha, Y. Kotidis, P. Indyk, S. Muthukrishnan, and M. Strauss, Fast, small space algorithm for approximate histogram maintenance, ACM STOC, 2002, 389-398. MR2121164
12. A. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, and M. Strauss, Near-optimal sparse Fourier estimation via sampling, ACM STOC, 2002, 152-161. MR2121138
13. E. D. Gluskin, Norms of random matrices and widths of finite-dimensional sets, Math. USSR Sbornik, 48 (1984), 173-182. MR0687610 (84g:41021)
14. B. Kashin, The widths of certain finite dimensional sets and classes of smooth functions, Izvestia 41 (1977), 334-351. MR0481792 (58:1891)
15. G. G. Lorentz, M. von Golitschek, and Yu. Makovoz, Constructive Approximation: Advanced Problems, Springer Grundlehren, vol. 304, Springer, Berlin, Heidelberg, 1996. MR1393437 (97k:41002)
16. A. Pajor and N. Tomczak-Jaegermann, Subspaces of small codimension of finite dimensional Banach spaces, Proc. Amer. Math. Soc., vol. 97, 1986, pp. 637-642. MR845980 (87i:46040)
17. J. A. Tropp and A. C. Gilbert, Signal recovery from partial information via orthogonal matching pursuit, preprint, April 2005.