Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms

Journal of Fourier Analysis and Applications

Volumn 14, Issue 5-6, 2008, Pages 655-687

  Gribonval, Rémi ^a   Rauhut, Holger ^b   Schnass, Karin ^c   Vandergheynst, Pierre ^c  

^a UNIVERSITÉ DE RENNES 1   (France)

^b UNIVERSITY OF BONN   (Germany)

^c EPFL   (Switzerland)

Author keywords

Average analysis; Greedy algorithms; Multi channel; OMP; Thresholding

Indexed keywords

EID: 57349143370     PISSN: 10695869     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00041-008-9044-y     Document Type: Article

References (28)

1. Baraniuk, R., Davenport, M., DeVore, R., Wakin, M.: A simple proof of the restricted isometry property for random matrices. Constr. Approx. (to appear)
2. Baron, D., Duarte, M., Sarvotham, S., Wakin, M., Baraniuk, R.: An information-theoretic approach to distributed compressed sensing. In: Proc. 45rd Conference on Communication, Control, and Computing (2005)
3. Baron, D., Wakin, M., Duarte, M., Sarvotham, S., Baraniuk, R.: Distributed compressed sensing. Preprint (2005)
4. E. Candès J. Romberg T. Tao 2006 Stable signal recovery from incomplete and inaccurate measurements Commun. Pure Appl. Math. 59 8 1207 1223
5. E. Candes T. Tao 2006 Near optimal signal recovery from random projections: Universal encoding strategies? IEEE Trans. Inf. Theory 52 12 5406 5425
6. Chen, J., Huo, X.: Sparse representations for multiple measurement vectors (MMV) in an over-complete dictionary. In: International Conference on Acoustics, Speech and Signal Processing (ICASSP-2005) (2005)
7. J. Chen X. Huo 2006 Theoretical results on sparse representations of multiple measurement vectors IEEE Trans. Signal Process. 54 12 4634 4643
8. DeVore, R., Lorentz, G.: Constructive Approximation. Springer, Berlin (1993)
9. 1 minimization Proc. Nat. Acad. Sci. 100 4 369 388
10. D. Donoho M. Elad V. Temlyakov 2006 Stable recovery of sparse overcomplete representations in the presence of noise IEEE Trans. Inf. Theory 52 1 6 18
11. D. Donoho M. Vetterli R.A. DeVore I. Daubechies 1998 Data compression and harmonic analysis IEEE Trans. Inf. Theory 44 391 432
12. Gribonval, R., Nielsen, M.: Beyond sparsity: Recovering structured representations by l1 minimization and greedy algorithms. Publication interne 1684, IRISA, Rennes (2005)
13. Gribonval, R., Nielsen, M., Vandergheynst, P.: Towards an adaptive computational strategy for sparse signal approximation. Preprint of the Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA) (2006)
14. Grimmett, G.R., Stirzaker, D.R.: Probability and Random Processes. Oxford University Press, London (2001)
15. Ledoux, M.: The Concentration of Measure Phenomenon. Am. Math. Soc., Providence (2001)
16. Ledoux, M., Talagrand, M.: Probability in Banach Spaces. Isoperimetry and Processes. Springer, Berlin (1991)
17. Z. Luo M. Gaspar J. Liu A. Swami 2006 Distributed signal processing in sensor networks IEEE Signal Process. Mag. 23 4 14 15
18. Rauhut, H.: Stability results for random sampling of sparse trigonometric polynomials. IEEE Trans. Inf. Theory (to appear)
19. H. Rauhut K. Schnass P. Vandergheynst 2008 Compressed sensing and redundant dictionaries IEEE Trans. Inf. Theory 54 5 2210 2219
20. Rudelson, M., Vershynin, R.: Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements. In: Proc. CISS 2006 (40th Annual Conference on Information Sciences and Systems) (2006)
21. K. Schnass P. Vandergheynst 2007 Average Performance Analysis for Thresholding IEEE Signal Process. Lett. 14 11 828 831
22. K. Schnass P. Vandergheynst 2008 Dictionary preconditioning for greedy algorithms IEEE Trans. Signal Process. 56 5 1994 2002
23. Taubman, D., Marcellin, W.: JPEG2000: Image Compression Fundamentals, Standards, and Practice. Springer, Berlin (2002)
24. J. Tropp 2004 Greed is good: Algorithmic results for sparse approximation IEEE Trans. Inf. Theory 50 10 2231 2242
25. Tropp, J.: Topics in sparse approximation. Ph.D. Thesis, University of Texas at Austin (2004)
26. J. Tropp 2006 Just relax: Convex programming methods for subset selection and sparse approximation IEEE Trans. Inf. Theory 51 3 1030 1051
27. J. Tropp 2008 On the conditioning of random subdictionaries Appl. Comput. Harmon. Anal. 25 1 24
28. J. Tropp A. Gilbert M. Strauss 2006 Algorithms for simultaneous sparse approximations. Part I: Greedy pursuit Signal Process. 86 572 588 Special issue "Sparse approximations in signal and image processing"