Sparse Legendre expansions via ℓ 1-minimization

Journal of Approximation Theory

Volumn 164, Issue 5, 2012, Pages 517-533

  Rauhut, Holger ^a   Ward, Rachel ^b  

^a UNIVERSITY OF BONN   (Germany)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

1 minimization; Compressive sensing; Condition numbers; Legendre polynomials; Orthogonal polynomials; Random matrices; Sparse recovery

Indexed keywords

EID: 84858165576     PISSN: 00219045     EISSN: 10960430     Source Type: Journal    
DOI: 10.1016/j.jat.2012.01.008     Document Type: Article

References (41)

1. Abrial P., Moudden Y., Starck J., Fadili J., Delabrouille J., Nguyen M. CMB data analysis and sparsity. Stat. Methodol. 2008, 5:289-298.
2. Alexeev B., Ward R. On the complexity of Mumford-Shah type regularization, viewed as a relaxed sparsity constraint. IEEE Trans. Image Process. 2010, 19(10):2787-2789.
3. Alireza D., Houman O. A non-adapted sparse approximation of PDEs with stochastic inputs. J. Comput. Phys. 2011, 230(8):3015-3034.
4. Andrews G., Askey R., Roy R. Special Functions 1999, Cambridge University Press.
5. Baraniuk R.G., Davenport M., DeVore R.A., Wakin M. A simple proof of the restricted isometry property for random matrices. Constr. Approx. 2008, 28(3):253-263.
6. R. Berinde, Advances in sparse signal recovery methods, Masters Thesis, 2009.
7. Blumensath T., Davies M. Iterative hard thresholding for compressed sensing. Appl. Comput. Harmon. Anal. 2009, 27(3):265-274.
8. Brutman L. Lebesgue functions for polynomial interpolation-a survey. Ann. Numer. Math. 1997, 4(1-4):111-127.
9. Cai T., Wang L., Xu G. New bounds for restricted isometry constants. IEEE Trans. Inform. Theory 2010, 56(9):4388-4394.
10. Candès E.J. The restricted isometry property and its implications for compressed sensing. C. R. Acad. Sci. Paris Sér. I Math. 2008, 346:589-592.
11. Candès E.J., Romberg J. Sparsity and incoherence in compressive sampling. Inverse Problems 2007, 23(3):969-985.
12. Candès E.J., Romberg J., Tao T. Stable signal recovery from incomplete and inaccurate measurements. Comm. Pure Appl. Math. 2006, 59(8):1207-1223.
13. Candès E.J., Tao T. Near optimal signal recovery from random projections: universal encoding strategies?. IEEE Trans. Inform. Theory 2006, 52(12):5406-5425.
14. Candès E.J., Tao T., Romberg J. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inform. Theory 2006, 52(2):489-509.
15. Chen S.S., Donoho D.L., Saunders M.A. Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 1999, 20(1):33-61.
16. Cohen A., Dahmen W., DeVore R.A. Compressed sensing and best k-term approximation. J. Amer. Math. Soc. 2009, 22(1):211-231.
17. Cohen A., DeVore R., Schwab C. Analytic regularity and polynomial approximation of parametric and stochastic elliptic PDEs. Anal. Appl. 2011, 9(1):11-47.
18. Daniel P. Fast algorithms for discrete polynomial transforms on arbitrary grids. Linear Algebra Appl. 2003, 366:353-370.
19. Davis G., Mallat S., Avellaneda M. Adaptive greedy approximations. Constr. Approx. 1997, 13(1):57-98.
20. Donoho D.L. Compressed sensing. IEEE Trans. Inform. Theory 2006, 52(4):1289-1306.
21. Donoho D., Tanner J. Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing. Phil. Trans. R. Soc. 2009, 367(1906):4273-4293.
22. Fornasier M., Rauhut H. Compressive sensing. Handbook of Mathematical Methods in Imaging 2011, 187-228. Springer. O. Scherzer (Ed.).
23. 1-minimization. Appl. Comput. Harmon. Anal. 2010, 29(1):97-103.
24. q-minimization for 0
25. p-balls for 0
26. Gilbert A.C., Tropp J.A. Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans. Inform. Theory 2007, 53(12):4655-4666.
27. K. Gröchenig, B. Pötscher, H. Rauhut, Learning trigonometric polynomials from random samples and exponential inequalities for eigenvalues of random matrices, Preprint, 2007.
28. Healy D., Rockmore D., Kostelec P., Sean S. FFTs for the 2-sphere-improvements and variations. J. Fourier Anal. Appl. 1996, 9:341-385.
29. James R., Dennis M., Daniel N. Fast discrete polynomial transforms with applications to data analysis for distance transitive graphs. SIAM J. Comput. 1997, 26(4):1066-1099.
30. 2k. Appl. Comput. Harmon. Anal. 2011, 31(3):460-468.
31. Potts D., Steidl G., Tasche M. Fast algorithms for discrete polynomial transforms. Math. Comp. 1998, 67:1577-1590.
32. Rauhut H. Random sampling of sparse trigonometric polynomials. Appl. Comput. Harmon. Anal. 2007, 22(1):16-42.
33. Rauhut H. On the impossibility of uniform sparse reconstruction using greedy methods. Sampl. Theory Signal Image Process. 2008, 7(2):197-215.
34. Rauhut H. Compressive sensing and structured random matrices. Radon Series Comp. Appl. Math. 2010, vol. 9:1-92. deGruyter. M. Fornasier (Ed.).
35. Rauhut H., Schnass K., Vandergheynst P. Compressed sensing and redundant dictionaries. IEEE Trans. Inform. Theory 2008, 54(5):2210-2219.
36. H. Rauhut, R. Ward, Sparse recovery for spherical harmonic expansions, in: Proc. SampTA, Singapore, 2011.
37. Rudelson M., Vershynin R. On sparse reconstruction from Fourier and Gaussian measurements. Comm. Pure Appl. Math. 2008, 61:1025-1045.
38. Schnass K., Vandergheynst P. Dictionary preconditioning for greedy algorithms. IEEE Trans. Signal Process. 2008, 56(5):1994-2002.
39. Szegö G. Orthogonal Polynomials 1975, American Mathematical Society, Providence, RI.
40. Tropp J., Needell D. CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmon. Anal. 2008, 26(3):301-321.
41. Tygert M. Fast algorithms for spherical harmonic expansions, II. J. Comput. Phys. 2008, 227(8):4260-4279.