Compressive sensing by random convolution

SIAM Journal on Imaging Sciences

Volumn 2, Issue 4, 2009, Pages 1098-1128

  Romberg, Justin ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Compressive sensing; Random matrices; 1 regularization

Indexed keywords

COMPRESSED SENSING; SIGNAL RECONSTRUCTION;

COMPRESSIVE SENSING; HIGH RESOLUTION; IMAGING APPLICATIONS; LOW RESOLUTION; ORTHONORMAL; RANDOM MATRICES; RANDOM WAVEFORMS; RANDOM-PHASE;

CONVOLUTION;

EID: 84907737173     PISSN: None     EISSN: 19364954     Source Type: Journal    
DOI: 10.1137/08072975X     Document Type: Article

References (43)

1. N. Ailon and B. Chazelle, Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform, in Proceedings of the 38th ACM Symposium on Theory of Computing, Seattle, WA, 2006, pp. 557-563.
2. S. R. J. Axelsson, Analysis of random step frequency radar and comparison with experiments, IEEE Trans. Geosci. Remote Sens., 45 (2007), pp. 890-904.
3. S. R. J. Axelsson, Random noise radar/sodar with ultrawideband waveforms, IEEE Trans. Geosci. Remote Sens., 45 (2007), pp. 1099-1114.
4. W. U. Bajwa, J. D. Haupt, G. M. Raz, S. J. Wright, and R. D. Nowak, Toeplitz-structured compressed sensing matrices, in Proceedings of the IEEE Statistical Signal Processing Workshop, Madison, WI, 2007, pp. 294-298.
5. R. Baraniuk and P. Steeghs, Compressive radar imaging, in Proceedings of the IEEE Radar Conference, Boston, MA, 2007, pp. 128-133.
6. R. G. Baraniuk, M. Davenport, R. DeVore, and M. Wakin, A simple proof of the restricted isometry property for random matrices, Construct. Approx., 28 (2008), pp. 253-263.
7. S. N. Bernstein, The Theory of Probabilities, Gastehizdat Publishing House, Moscow, 1946.
8. T. Blumensath and M. Davies, Iterative hard thresholding for compressed sensing, Appl. Comput. Harmon. Anal., 27 (2009), pp. 265-274.
9. S. Boucheron, O. Bousquet, and G. Lugosi, Concentration inequalities, in Advanced Lectures on Machine Learning, O. Bousquet and G. Rätsch, eds., Springer, New York, 2004, pp. 208-240.
10. E. Candès, The restricted isometry property and its implications for compressed sensing, C. R. Acad. Sci. Paris Ser. I Math., 346 (2008), pp. 589-592.
11. E. Candès and J. Romberg, Sparsity and incoherence in compressive sampling, Inverse Problems, 23 (2007), pp. 969-986.
12. E. Candès, J. Romberg, and T. Tao, Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information, IEEE Trans. Inform. Theory, 52 (2006), pp. 489-509.
13. E. Candès, J. Romberg, and T. Tao, Stable signal recovery from incomplete and inaccurate measurements, Comm. Pure Appl. Math., 59 (2006), pp. 1207-1223.
14. E. Candès and T. Tao, Near-optimal signal recovery from random projections and universal encoding strategies?, IEEE Trans. Inform. Theory, 52 (2006), pp. 5406-5245.
15. S. S. Chen, D. L. Donoho, and M. A. Saunders, Atomic decomposition by basis pursuit, SIAM J. Sci. Comput., 20 (1998), pp. 33-61.
16. R. Coifman, F. Geshwind, and Y. Meyer, Noiselets, Appl. Comput. Harmon. Anal., 10 (2001), pp. 27-44.
17. D. L. Donoho, Compressed sensing, IEEE Trans. Inform. Theory, 52 (2006), pp. 1289-1306.
18. J. J. Fuchs, Recovery of exact sparse representations in the presence of bounded noise, IEEE Trans. Inform. Theory, 51 (2005), pp. 3601-3608.
19. J. Haupt, W. Bajwa, G. Raz, and R. Nowak, Toeplitz compressed sensing matrices with applications to sparse channel estimation, IEEE Trans. Inform. Theory, submitted.
20. M. A. Herman and T. Strohmer, High-resolution radar via compressed sensing. IEEE Trans. Signal Process., 57 (2009), pp. 2275-2284.
21. W. Hoeffding, Probability inequalities for sums of bounded random variables, J. American Statist. Assoc., 58 (1963), pp. 13-30.
22. S. Kirolos, J. Laska, M. Wakin, M. Duarte, D. Baron, T. Ragheb, Y. Massoud, and R. Baraniuk, Analog-to-information conversion via random demodulation, in Proceedings of the IEEE Dallas/ CAS Workshop on Design, Applications, Integration, and Software, Richardson, TX, 2006, pp. 71-74.
23. B. Le, T. W. Rondeau, J. H. Reed, and C. W. Bostian, Analog-to-digital converters, IEEE Signal Process. Mag., 22 (2005), pp. 69-77.
24. M. Ledoux, The Concentration of Measure Phenomenon, AMS, Providence, RI, 2001.
25. S. G. Mallat and Z. Zhang, Matching pursuits with time-frequency dictionaries, IEEE Trans. Signal Proc., 41 (1993), pp. 3397-3415.
26. I. Maravic, M. Vetterli, and K. Ramchandran, Channel estimation and synchornization with subnyquist sampling and application to ultra-wideband systems, in Proceedings of the IEEE Symposium on Circuits and Systems, Vol. 5, Vancouver, 2004, pp. 381-384.
27. R. F. Marcia, Z. T. Harmany, and R. M. Willet, Compressive coded aperture imaging, in Proceedings of the SPIE Conference on Computational Imaging VII, SPIE, Bellingham, WA, 2009, pp. 72460G-1-72460G-13.
28. R. F. Marcia and R. M. Willet, Compressive coded aperture superresolution image reconstruction, in Proceedings of the IEEE International Conference on Acoustic Speech Signal Process, IEEE, New York, 2008, pp. 833-836.
29. S. Mendelson, A. Pajor, and N. Tomczak-Jaegermann, Reconstruction and subgaussian operators in asymptotic geometric analysis, Geom. Funct. Anal., 17 (2007), pp. 1248-1282.
30. D. C. Munson, J. D. O’Brien, and W. K. Jenkins, A tomographic formulation of spotlight-mode synthetic aperure radar, Proc. IEEE, 71 (1983), pp. 917-925.
31. D. Needell and J. Tropp, COSAMP: Iterative signal recovery from incomplete and inaccurate measurements, Appl. Comput. Harmon. Anal., 26 (2009), pp. 301-321.
32. G. E. Pfander, H. Rauhut, and J. Tanner, Identification of matrices having a sparse representation, IEEE Trans. Signal Process., 56 (2008), pp. 5376-5388.
33. H. Rauhut, Circulant and Toeplitz matrices in compressed sensing, in SPARS’09: Signal Processing with Adaptive Sparse Structured Representations, Rémi Gribonval, ed., Saint Malo, France, Inria Rennes, Bretagne Atlantique, 2009.
34. M. Richards, Fundamentals of Radar Signal Processing, McGraw-Hill, New York, 2005.
35. M. Rudelson and R. Vershynin, On sparse reconstruction from Fourier and Gaussian measurements, Comm. Pure Appl. Math., 61 (2008), pp. 1025-1045.
36. M. Talagrand, New concentration inequalities in product spaces, Invent. Math., 126 (1996), pp. 505-563.
37. J. Tropp, Norms of random submatrices and sparse approximation, C. R. Acad. Sci. Paris Ser. I Math., 346 (2008), pp. 1271-1274.
38. J. Tropp and A. Gilbert, Signal recovery from partial information via orthogonal matching pursuit, IEEE Trans. Inform. Theory, 53 (2007), pp. 4655-4666.
39. 1minimization, IEEE Trans. Inform. Theory, 51 (2005), pp. 1568-1570.
40. J. A. Tropp, J. N. Laska, M. F. Duarte, J. Romberg, and R. G. Baraniuk, Beyond Nyquist: efficient sampling of sparse bandlimited signals, IEEE. Trans. Inform. Theory, January, 2010, to appear.
41. J. A. Tropp, M. B. Wakin, M. F. Duarte, D. Baron, and R. G. Baraniuk, Random filters for compressive sampling and reconstruction, in Proceedings of the IEEE International Conference on Acoustic Speech Signal Process, Toulouse, France, 2006, pp. III-872-III-875.
42. M. Vetterli, P. Marziliano, and T. Blu, Sampling signals with finite rate of innovation, IEEE Trans. Signal Process., 50 (2002), pp. 1417-1428.
43. R. H. Walden, Analog-to-digital converter survey and analysis, IEEE J. Select Areas in Communications, 17 (1999), pp. 539-550.