Restricted isometries for partial random circulant matrices

Applied and Computational Harmonic Analysis

Volumn 32, Issue 2, 2012, Pages 242-254

  Rauhut, Holger ^a   Romberg, Justin ^b   Tropp, Joel A ^c  

^a UNIVERSITY OF BONN   (Germany)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Compressed sensing; Dudley inequality; Partial random circulant matrix; Rademacher chaos process; Restricted isometry constant; Sparsity

Indexed keywords

CIRCULANT MATRIX; COMPRESSED SENSING; DUDLEY INEQUALITY; RADEMACHER CHAOS PROCESS; RESTRICTED ISOMETRY CONSTANT; SPARSITY;

SIGNAL RECONSTRUCTION;

MATRIX ALGEBRA;

EID: 84856471680     PISSN: 10635203     EISSN: 1096603X     Source Type: Journal    
DOI: 10.1016/j.acha.2011.05.001     Document Type: Article

References (50)

1. J.-M. Azais, and M. Wschebor Level Sets and Extrema of Random Processes and Fields 2009 John Wiley & Sons Inc. Hoboken, NJ
2. W.U. Bajwa, J.D. Haupt, G.M. Raz, S.J. Wright, R.D. Nowak, Toeplitz-structured compressed sensing matrices, in: Proc. IEEE Stat. Sig. Proc. Workshop, Madison, WI, August 2007, pp. 294-298.
3. R.G. Baraniuk, M. Davenport, R.A. DeVore, and M. Wakin A simple proof of the restricted isometry property for random matrices Constr. Approx. 28 3 2008 253 263
4. T. Blumensath, and M. Davies Iterative hard thresholding for compressed sensing Appl. Comput. Harmon. Anal. 27 3 November 2009 265 274
5. S. Boucheron, G. Lugosi, and P. Massart Concentration inequalities using the entropy method Ann. Probab. 1 3 2003 1583 1614 (Pubitemid 36881408)
6. A. Buchholz Operator Khintchine inequality in non-commutative probability Math. Ann. 319 2001 1 16
7. T.T. Cai, L. Wang, and G.W. Xu Shifting inequality and recovery of sparse signals IEEE Trans. Signal Process. 58 2010 1300 1308
8. E.J. Candès, Compressive sampling, in: Proceedings of the International Congress of Mathematicians, Madrid, Spain, 2006.
9. E.J. Candès The restricted isometry property and its implications for compressed sensing C. R. Acad. Sci. Paris Sér. I Math. 346 2008 589 592
10. E.J. Candès, J. Romberg, and T. Tao Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information IEEE Trans. Inform. Theory 52 2 2006 489 509 (Pubitemid 43174093)
11. E.J. Candès, J.K. Romberg, and T. Tao Stable signal recovery from incomplete and inaccurate measurements Comm. Pure Appl. Math. 59 8 2006 1207 1223 (Pubitemid 43988295)
12. E.J. Candès, and T. Tao Near optimal signal recovery from random projections: universal encoding strategies? IEEE Trans. Inform. Theory 52 12 2006 5406 5425 (Pubitemid 46445381)
13. B. Carl Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces Ann. Inst. Fourier (Grenoble) 35 3 1985 79 118
14. S.S. Chen, D.L. Donoho, and M.A. Saunders Atomic decomposition by basis pursuit SIAM J. Sci. Comput. 20 1 1999 33 61 (Pubitemid 128689501)
15. A. Cohen, W. Dahmen, and R.A. DeVore Compressed sensing and best k-term approximation J. Amer. Math. Soc. 22 1 2009 211 231
16. V.H. de la Peña, and E. Giné Decoupling: From Dependence to Independence 1999 Springer
17. D.L. Donoho Compressed sensing IEEE Trans. Inform. Theory 52 4 2006 1289 1306
18. D.L. Donoho, and J. Tanner Counting faces of randomly-projected polytopes when the projection radically lowers dimension J. Amer. Math. Soc. 22 1 2009 1 53
19. M. Fornasier, and H. Rauhut Compressive sensing O. Scherzer, Handbook of Mathematical Methods in Imaging 2011 Springer 187 228
20. l 1-minimization Appl. Comput. Harmon. Anal. 29 1 2010 97 103
21. S. Foucart, Hard thresholding pursuit: an algorithm for compressive sensing, preprint, 2010.
22. S. Foucart, Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants, in: Proceedings of the 13th International Conference on Approximation Theory, 2010.
23. lp-balls for 0 < p ≤ 1 J. Complexity 26 2010 629 640
24. A.Y. Garnaev, and E.D. Gluskin On widths of the Euclidean ball Sov. Math. Dokl. 30 1984 200 204
25. S.R. Gottesman, and E.E. Fenimore New family of binary arrays for coded aperture imaging Appl. Opt. 28 1989 4344 4352
26. J. Haupt, W. Bajwa, G. Raz, and R. Nowak Toeplitz compressed sensing matrices with applications to sparse channel estimation IEEE Trans. Inform. Theory 56 11 2010 5862 5875
27. M.A. Herman, and T. Strohmer High-resolution radar via compressed sensing IEEE Trans. Signal Process. 57 6 June 2009 2275 2284
28. A. Hinrichs, J. Vybíral, Johnson-Lindenstrauss lemma for circulant matrices, Random Struct. Algorithms, in press, doi:10.1002/rsa.20360.
29. F. Krahmer, R. Ward, New and improved Johnson-Lindenstrauss embeddings via the restricted isometry property, SIAM J. Math. Anal., in press.
30. M. Ledoux, and M. Talagrand Probability in Banach Spaces 1991 Springer-Verlag Berlin, Heidelberg, New York
31. R.F. Marcia, C. Kim, J. Kim, D. Brday, R.M. Willett, Fast disambiguation of superimposed images for increased field of view, in: Proc. IEEE Int. Conf. Image Proc., 2008, pp. 2620-2623.
32. S. Mendelson, A. Pajor, and N. Tomczak Jaegermann Uniform uncertainty principle for Bernoulli and subgaussian ensembles Constr. Approx. 28 3 2009 277 289
33. B.K. Natarajan Sparse approximate solutions to linear systems SIAM J. Comput. 24 1995 227 234
34. D. Needell, and J. Tropp COSAMP: Iterative signal recovery from incomplete and inaccurate measurements Appl. Comput. Harmon. Anal. 26 3 May 2009 301 321
35. D. Needell, and R. Vershynin Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit Found. Comput. Math. 9 3 2009 317 334
36. G. Pisier, Remarques sur un résultat non publié de B. Maurey, in: Seminar on Functional Analysis, 1980-1981, École Polytech., Palaiseau, 1981, Exp. No. V, p. 13.
37. H. Rauhut Stability results for random sampling of sparse trigonometric polynomials IEEE Trans. Inform. Theory 54 12 2008 5661 5670
38. H. Rauhut, Circulant and Toeplitz matrices in compressed sensing, in: Rémi Gribonval (Ed.), SPARS09 - Signal Processing with Adaptive Sparse Structured Representations, Saint Malo, France, 2009, Inria Rennes - Bretagne Atlantique.
39. H. Rauhut Compressive sensing and structured random matrices M. Fornasier, Theoretical Foundations and Numerical Methods for Sparse Recovery Radon Ser. Comput. Appl. Math. vol. 9 2010 de Gruyter 1 92
40. H. Rauhut, K. Schnass, and P. Vandergheynst Compressed sensing and redundant dictionaries IEEE Trans. Inform. Theory 54 5 2008 2210 2219 (Pubitemid 351689557)
41. l 1-minimization, preprint, 2010, arXiv:1003.0251.
42. M. Richards Fundamentals of Radar Signal Processing 2005 McGraw-Hill
43. J. Romberg, Compressive sampling via random convolution, in: Proc. Int. Cong. Indus. and Appl. Math. (ICIAM), Zurich, Switzerland, July 2007.
44. J. Romberg Compressive sensing by random convolution SIAM J. Imaging Sci. 2 4 2009 1098 1128
45. M. Rudelson, and R. Vershynin On sparse reconstruction from Fourier and Gaussian measurements Comm. Pure Appl. Math. 61 8 2008 1025 1045
46. M. Talagrand The Generic Chaining Springer Monogr. Math. 2005 Springer-Verlag Berlin
47. J.A. Tropp Greed is good: Algorithmic results for sparse approximation IEEE Trans. Inform. Theory 50 10 2004 2231 2242
48. 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 56 1 January 2010 520 544
49. J.A. Tropp, M.B. Wakin, M.F. Duarte, D. Baron, R.G. Baraniuk, Random filters for compressive sampling and reconstruction, in: Proc. IEEE Int. Conf. Acoust. Speech Sig. Proc., vol. 3, Toulouse, France, May 2006, pp. III-872-875.
50. J. Vybíral A variant of the Johnson-Lindenstrauss lemma for circulant matrices J. Funct. Anal. 260 4 2011 1096 1105