Random sampling of sparse trigonometric polynomials

Applied and Computational Harmonic Analysis

Volumn 22, Issue 1, 2007, Pages 16-42

  Rauhut, Holger ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

1 minimization; Basis pursuit; Random matrices; Random sampling; Set partitions; Sparse recovery; Trigonometric polynomials

Indexed keywords

MATHEMATICAL MODELS; NUMERICAL METHODS; PROBLEM SOLVING; RANDOM PROCESSES; SAMPLING; SET THEORY;

BASIS PURSUITS; RANDOM MATRICES; RANDOM SAMPLING; SET PARTITIONS; SPARSE RECOVERY; TRIGONOMETRIC POLYNOMIALS;

POLYNOMIALS;

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

References (25)

1. Bass R.F., and Gröchenig K. Random sampling of multivariate trigonometric polynomials. SIAM J. Math. Anal. 36 3 (2004) 773-795
2. Boucheron S., Lugosi G., and Massart P. A sharp concentration inequality with applications. Random Structures Algorithms 16 (2000) 277-292
3. Boyd S., and Vandenberghe L. Convex Optimization (2004), Cambridge Univ. Press, Cambridge
4. D. Callan, On conjugates for set partitions and integer compositions, Preprint, arXiv:math.Co/0508052, 2005
5. Chen S.S., Donoho D.L., and Saunders M.A. Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20 1 (1999) 33-61
6. Candes E., Romberg J., and Tao T. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inform. Theory 52 2 (2006) 489-509
7. E. Candes, T. Tao, Near optimal signal recovery from random projections and universal encoding strategies, IEEE Trans. Inform. Theory (2006), in press
8. E. Candes, J. Romberg, T. Tao, Stable signal recovery from incomplete and inaccurate measurements, Comm. Pure Appl. Math. (2006), in press
9. E. Candes, J. Romberg, Practical signal recovery from random projections, Preprint, 2004
10. Donoho D.L. Compressed sensing. IEEE Trans. Inform. Theory 52 4 (2006) 1289-1306
11. D.L. Donoho, Y. Tsaig, Extensions of compressed sensing, EURASIP J. Appl. Signal Proc. (2006), in press
12. 1-norm solution is also the sparsest solution. Comm. Pure Appl. Math. 59 6 (2006) 797-892
13. Donoho D.L., and Tanner J. Sparse nonnegative solutions of underdetermined linear equations. Proc. Natl. Acad. Sci. USA 102 27 (2005) 9446-9451
14. Donoho D.L., and Tanner J. Neighborliness of randomly-projected simplices in high dimensions. Proc. Natl. Acad. Sci. USA 102 27 (2005) 9452-9457
15. A. Gilbert, J. Tropp, Signal recovery from partial information via orthogonal matching pursuit, Preprint, 2005
16. Knuth D. Problem 11151. Amer. Math. Monthly 112 (2005) 367
17. S. Kunis, H. Rauhut, Random sampling of sparse trigonometric polynomials II: Orthogonal matching pursuit versus basis pursuit, Preprint, 2006
18. Potts D., Steidl G., and Tasche M. Fast Fourier transforms for nonequispaced data: A tutorial. In: Benedetto J.J., and Ferreira P. (Eds). Modern Sampling Theory: Mathematics and Applications (1998), Birkhäuser, Boston 249-274 Chap. 12
19. Riordan J. Combinatorial Analysis (1958), Wiley
20. M. Rudelson, R. Vershynin, Geometric approach to error correcting codes and reconstruction of signals, Int. Math. Res. Notices, in press
21. Sloane N.J.A. On-Line Encyclopedia of Integer Sequences. published electronically at:. http://www.research.att.com/~njas/sequences
22. Stanley R.P. Enumerative Combinatorics (1997), Cambridge Univ. Press, Cambridge
23. Weisstein E.W. Binomial Sums. from MathWorld-A Wolfram web resource. http://mathworld.wolfram.com/BinomialSums.html
24. Wilf H. Generating Functionology (1994), Academic Press, Boston
25. Zou J., Gilbert A., Strauss M., and Daubechies I. Theoretical and experimental analysis of a randomized algorithm for sparse Fourier transform analysis. J. Comput. Phys. 211 (2005) 572-595