Approximate sparse recovery: Optimizing time and measurements

SIAM Journal on Computing

Volumn 41, Issue 2, 2012, Pages 436-453

  Gilbert, Anna C ^a   Li, Yi ^a   Porat, Ely ^b   Strauss, Martin J ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

Approximation; Embedding; Sketching; Sparse approximation; Sublinear algorithms

Indexed keywords

APPROXIMATION; EMBEDDING; SKETCHING; SPARSE APPROXIMATIONS; SUBLINEAR ALGORITHM;

DECODING; ENCODING (SYMBOLS); MEASUREMENTS; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 84861624238     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/100816705     Document Type: Article

References (20)

1. N. Alon, Y. Matias, and M. Szegedy, The space complexity of approximating the frequency moments, J. Comput. System Sci., 58 (1999), pp. 137-147.
2. K. Do Ba, P. Indyk, E. Price, and D. Woodruff, Lower bounds for sparse recovery, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2010.
3. R. Berinde, A. Gilbert, P. Indyk, H. Karloff, and M. Strauss, Combining Geometry and Combinatorics: A Unified Approach to Sparse Signal Recovery, Allerton Press, Allerton, IA, 2008.
4. E. J. Candès, J. Romberg, and T. Tao, Stable signal recovery from incomplete and inaccurate measurements, Comm. Pure Appl. Math., 59 (2006), pp. 1208-1223.
5. M. Charikar, K. Chen, and M. Farach-Colton, Finding frequent items in data streams, in Proceedings of the International Colloquium on Automata, Languages, and Programming, 2002.
6. R. Clifford, K. Efremenko, E. Porat, and A. Rothschild, k-mismatch with don't cares, in Proceedings of the European Symposium on Algorithms, 2007, pp. 151-162.
7. A. Cohen, W. Dahmen, and R. DeVore, Compressed sensing and best k-term approximation, J. AMS, 22 (2009), pp. 211-231.
8. G. Cormode and S. Muthukrishnan, What's hot and what's not: Tracking most frequent items dynamically, in Proceedings of the ACM Symposium on Principles of Database Systems, 2003, pp. 296-306.
9. G. Cormode and S. Muthukrishnan, Improved data stream summaries: The count-min sketch and its applications, in Proceedings of the Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2004.
10. G. Cormode and S. Muthukrishnan, Combinatorial algorithms for compressed sensing, in Proceedings of the 40th Annual Conference Information Sciences and Systems, Princeton, NJ, 2006.
11. D. L. Donoho, Compressed Sensing, IEEE Trans. Inform. Theory, 52 (2006), pp. 1289-1306.
12. D. Dubhashi and V. Priebe Desh Ranjan, Negative Dependence Through the FKG Inequality, Research report MPI-I-96-1-020, Max-Planck-Institut für Informatik, Saarbrucken, Germany, 1996.
13. Y. Erlich, K. Chang, A. Gordon, R. Ronen, O. Navon, M. Rooks, and G. J. Hannon, DNA sudoku-harnessing high-throughput sequencing for multiplexed specimen analysis, Genome Research, 19 (2009), pp. 1243-1253.
14. A. C. Gilbert, M. J. Strauss, J. A. Tropp, and R. Vershynin, One sketch for all: Fast algorithms for compressed sensing, in Proceedings of the ACM Symposium on Theory of Computing, 2007, pp. 237-246. (Pubitemid 47630740)
15. P. Indyk and M. Ruzic, Near-optimal sparse recovery in the L1 norm, in Proceedings of the Foundations of Computer Science, 2008, pp. 199-207.
16. D. Needell and J. A. Tropp, CoSaMP: Iterative signal recovery from incomplete and inaccurate samples, Appl. Comput. Harmonic Anal., 26 (2009), pp. 301-321.
17. E. Price and D. Woodruff, (1+ε)-approximate sparse recovery, in Proceedings of the Foundations of Computer Science, 2011, pp. 295-304.
18. M. Wainwright, Information-theoretic bounds on sparsity recovery in the high-dimensional and noisy setting, IEEE Trans. Inform. Theory, 55 (2009), pp. 5728-5741.
19. Y. H. Zheng, D. J. Brady, M. E. Sullivan, and B. D. Guenther, Fiber-optic localization by geometric space coding with a two-dimensional gray code, Appl. Optics, 44 (2005), pp. 4306-4314. (Pubitemid 41048352)
20. Y. H. Zheng, N. P. Pitsianis, and D. J. Brady, Nonadaptive group testing based fiber sensor deployment for multiperson tracking, IEEE Sensors J., 6 (2006), pp. 490-494.