Sequential compressed sensing

IEEE Journal on Selected Topics in Signal Processing

Volumn 4, Issue 2, 2010, Pages 435-444

  Malioutov, Dmitry M ^a   Sanghavi, Sujay R ^b   Willsky, Alan S ^c  

^a MICROSOFT RESEARCH   (United Kingdom)

^b The University of Texas at Austin   (United States)

^c Massachusetts Institute of Technology Cambridge   (United Kingdom)

Author keywords

Compressed sensing (CS); Sequential measurements; Stopping rule

Indexed keywords

ACHIEVABLE PERFORMANCE; APRIORI; BERNOULLI; COMPRESSED SENSING; COMPRESSED SENSING (CS); GAUSSIANS; NUMBER OF SAMPLES; PERFORMANCE BOUNDS; RANDOM MEASUREMENT; RECONSTRUCTION ERROR; RUNTIMES; SPARSE SIGNALS; STOPPING RULE;

REPAIR;

SIGNAL RECONSTRUCTION;

EID: 77949678293     PISSN: 19324553     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSTSP.2009.2038211     Document Type: Article

References (34)

1. E. J. Candes, "Compressive sampling," in Proc. Int. Congr. Math., Madrid, Spain, 2006.
2. D. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol.52, no.4, pp. 1289-1306, Apr. 2006.
3. M. Lustig, D. L. Donoho, and J. M. Pauly, "Sparse MRI: The application of compressed sensing for rapid MR imaging," Magn. Resonance Med., vol.58, no.6, pp. 1182-1195, Dec. 2007.
4. M. F. Duarte, M. A. Davenport, D. Takhar, J. N. Laska, T. Sun, K. F. Kelly, and R. Baraniuk, "Single pixel imaging via compressive sampling," IEEE Signal Process. Mag., vol.25, no.2, pp. 83-91, Mar. 2008.
5. W. Bajwa, J. Haupt, A. Sayeed, and R. Nowak, "Compressive wireless sensing," in Proc. Int. Conf. Inf. Process. Sensor Netw. (IPSN), Apr. 2006.
6. F. Steinke, M. Seeger, and K. Tsuda, "Experimental design for efficient identification of gene regulatory networks using sparse Bayesian models," BMC Syst. Biol., vol.1, no.51, 2007.
7. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Sci. Comput., vol.20, no.1, pp. 33-61, 1998.
8. J. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol.50, no.10, pp. 2231-2242, Oct. 2004.
9. R. Chartrand and W. Yin, "Iteratively reweighted algorithms for compressive sensing," in Proc. ICASSP, 2008, pp. 3869-3872.
10. M. Cetin, D. M. Malioutov, and A. S.Willsky, "A variational technique for source localization based on a sparse signal reconstruction perspective," in Proc. ICASSP, 2002, pp. 2965-2968.
11. E. J. Candes, M. Wakin, and S. Boyd, "Enhancing sparsity by reweighted l1 minimization," California Inst. of Technol., Pasadena, 2007, Tech. Rep..
12. E. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol.52, no.2, pp. 489-509, Feb. 2006.
13. D.Wipf and B. D. Rao, "Sparse Bayesian learning for basis selection," IEEE Trans. Signal Process., vol.52, no.8, pp. 2153-2164, 2004.
14. M. Rudelson and R. Vershynin, "Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements," in Proc. CISS'06, 2006.
15. R.Ward, "Compressed sensing with cross validation," IEEE Trans. Inf. Theory, vol.55, no.12, pp. 5773-5782, Dec. 2009.
16. D. M. Malioutov, S. R. Sanghavi, and A. S. Willsky, "Compressed sensing with sequential observations," in Proc. ICASSP, 2008, pp. 3357-3760.
17. R. Baraniuk, "Compressive sensing," IEEE Signal Process. Mag., vol.24, no.4, pp. 118-121, Jul. 2007.
18. D. L. Donoho and X. Huo, "Uncertainty principles and ideal atomic decomposition," IEEE Trans. Inf. Theory, vol.47, no.7, pp. 2845-2862, Nov. 2001.
19. T. Tao and V. Vu, "On the singularity probability of random Bernoulli matrices," J. Amer. Math. Soc., vol.20, pp. 603-628, 2007.
20. S. Kotz, N. Balakrishnan, and N. L. Johnson, Continuous Multivariate Distributions. New York: Wiley, 2000.
21. S. Dasgupta and A. Gupta, "An elementary proof of a theorem of Johnson and Lindenstrauss," Random Structures and Algorithms, vol.22, no.1, pp. 60-65, 2003.
22. I. M. Johnstone and D. L. Donoho, "Ideal spatial adaptation by wavelet shrinkage," Biometrika, vol.81, no.3, pp. 425-455, 1994.
23. M. Figueiredo, R. Nowak, and S. Wright, "Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems," IEEE J. Sel. Topics Signal Process., vol.1, no.4, pp. 586-598, Aug. 2007.
24. S. J. Kim, K. Koh, M. Lustig, S. Boyd, and D. Gorinevsky, "A method for large-scale l1-regularized least squares," IEEE J. Sel. Topics Signal Process., vol.1, no.6, pp. 606-617, Dec. 2007.
25. I. Daubechies, M. De Friese, and C. De Mol, "An iterative thresholding algorithm for linear inverse problems with a sparsity constraint," Comm. in Pure Appl. Math., vol.57, pp. 1413-1457, 2004.
26. M. R. Osborne, B. Presnell, and B. A. Turlach, "A new approach to variable selection in least squares problems," IMA J. Numer. Anal., vol.20, no.3, pp. 389-403, 2000.
27. D. M. Malioutov, M. Cetin, and A. S.Willsky, "Homotopy continuation for sparse signal representation," in Proc. ICASSP, 2005, pp. 733-736.
28. S. Sra and J. A. Tropp, "Row-action methods for compressed sensing," in Proc. ICASSP, 2006, vol.3, pp. 868-871.
29. D. Bertsimas and J. N. Tsitsiklis, Introduction to Linear Optimization. Nashua, NH: Athena Scientific, 1997.
30. P. J. Garrigues and L. El Ghaoui, "An homotopy algorithm for the Lasso with online observations," in Neural Information Processing Systems (NIPS), Dec. 2008.
31. M. S. Asif and J. Romberg, "Streaming measurements in compressive sensing: L1 filtering," in Proc. 42nd Asilomar Conf. Signals, Syst., Comput., Oct. 2008.
32. B. Recht, M. Fazel, and P. A. Parrilo, "Guaranteed minimum rank solutions to linear matrix equations via nuclear norm minimization," SIAM Rev., 2007, accepted for publication.
33. R. Keshavan, A. Montanari, and S. Oh, "Learning low rank matrices from O(n) entries," in Proc. Allerton Conf., Oct. 2008.
34. Y. Weiss, H. S. Chang, and W. T. Freeman, "Learning compressed sensing," in Proc. Allerton Conf., Sep. 2007.