Sublinear approximation of signals

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 6232, Issue , 2006, Pages

  Gilbert, Anna C ^a   Strauss, Martin J ^a   Tropp, Joel A ^a   Vershynin, Roman ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Approximation; Embedding; Group testing; Sketching; Sparse approximation; Sublinear algorithms

Indexed keywords

APPROXIMATION; EMBEDDING; GROUP TESTING; SKETCHING; SPARSE APPROXIMATION; SUBLINEAR ALGORITHMS;

ALGORITHMS; APPROXIMATION THEORY; EMBEDDED SYSTEMS; ERROR ANALYSIS; LINEAR PROGRAMMING; POLYNOMIALS;

SIGNAL PROCESSING;

EID: 33748580950     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.669596     Document Type: Conference Paper

References (16)

1. G. Cormode and S. Muthukrishnan, "What's hot and what's not: Tracking most frequent items dynamically," in Proc. ACM Principles of Database Systems, pp. 296-306, 2003.
2. A. C. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, and M. J. Strauss, "Near-optimal sparse Fourier representations via sampling," in ACM Symposium on Theoretical Computer Science, 2002.
3. A. C. Gilbert, S. Muthukrishnan, and M. J. Strauss, "Improved time bounds for near-optimal sparse Fourier representation via sampling," in Proc. SPIE Wavelets XI, (San Diego), 2005.
4. G. Cormode and S. Muthukrishnan, "Towards an algorithmic theory of compressed sensing," tech. rep., DIMACS, July 2005.
5. E. J. Candès, M. Rudelson, T. Tao, and R. Vershynin, "Error correction via linear programming," in Proc. FOCS 2005, (Pittsburgh), Oct. 2005.
6. D. L. Donoho, "Compressed sensing." Unpublished manuscript, Oct. 2004.
7. E. J. Candès and T. Tao, "Near optimal signal recovery from random projections: Universal encoding strategies?." Submitted for publication, Nov. 2004.
8. E. Candès, J. Romberg, and T. Tao, "Exact signal reconstruction from highly incomplete frequency information." Submitted for publication, June 2004.
9. D. L. Donoho, "Neighborly polytopes and sparse solution of underdetermined linear equations," Dept. of Statistics TR 2005-4, Stanford Univ., Feb. 2005.
10. D. L. Donoho and J. Tanner, "Sparse nonnegative solution of underdetermined linear equations by linear programming," Dept. of Statistics TR 2005-6, Stanford Univ., Apr. 2005.
11. E. J. Candès and T. Tao, "Decoding by linear programming." Available from arXiv:math.MG/0502327, Feb. 2005.
12. M. Rudelson and R. Veshynin, "Geometric approach to error correcting codes and reconstruction of signals." Available from arXiv:math.MG/0502299, Feb. 2005.
13. J. A. Tropp and A. C. Gilbert, "Signal recovery from partial information via Orthogonal Matching Pursuit." Submitted to IEEE Trans. Inform. Theory, April 2005.
14. S. Mendelson, A. Pajor, and N. Tomczak-Jaegermann, "Reconstruction and subgaussian processes," Comptes Rendus Acad. Sci. 340, pp. 885-888, 2005.
15. M. Talagrand, The Generic Chaining, Springer, Berlin, 2005.
16. P. Indyk and A. Naor, "Nearest neighbor preserving embeddings. " Submitted, 2005.