Block-sparse signals: Uncertainty relations and efficient recovery

IEEE Transactions on Signal Processing

Volumn 58, Issue 6, 2010, Pages 3042-3054

  Eldar, Yonina C ^a,b   Kuppinger, Patrick ^c   Bölcskei, Helmut ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b STANFORD UNIVERSITY   (United States)

^c ETH ZURICH   (Switzerland)

Author keywords

Basis pursuit; Block sparsity; Compressed sensing; Matching pursuit

Indexed keywords

ADDITIONAL STRUCTURES; BASIS PURSUITS; COMPRESSED SENSING; CONVENTIONAL SENSE; EFFICIENT METHOD; MATCHING PURSUIT; NONZERO ENTRIES; OPTIMIZATION APPROACH; ORTHOGONAL MATCHING PURSUIT; RECONSTRUCTION PROPERTY; SPARSE SIGNALS; SYSTEM OF LINEAR EQUATIONS; UNCERTAINTY RELATION;

SIGNAL RECONSTRUCTION;

EID: 77952576986     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2010.2044837     Document Type: Article

References (48)

1. E. J. Candès, J. K. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information, " IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006.
2. D. L. Donoho, "Compressed sensing, " IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
3. G. Davis, S. Mallat, and M. Avellaneda, "Adaptive greedy approximations, " Constr. Approx., vol. 13, no. 1, pp. 57-98, 1997.
4. B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani, "Least angle regression, " Ann. Statist., vol. 32, no. 2, pp. 407-499, 2004.
5. J. Tropp, "Greed is good: Algorithmic results for sparse approximation, " IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.
6. E. J. Candès and T. Tao, "Decoding by linear programming, " IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005.
7. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit, " SIAMJ. Sci. Comput., vol. 20, no. 1, pp. 33-61, 1999.
8. Y. C. Pati, R. Rezaifar, and P. S. Krishnaprasad, "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition, " in Proc. 27th Asilomar Conf. Signals, Systems, Comput., Nov. 1993, pp. 40-44.
9. S. G. Mallat and Z. Zhang, "Matching pursuits and time-frequency dictionaries, " IEEETrans. Signal Process., vol. 41, no. 12, pp. 3397-3415, Dec. 1993.
10. E. J. Candès, "The restricted isometry property and its implications for compressed sensing, " C. R. Acad. Sci. Paris, Ser. I, vol. 346, pp. 589-592, 2008.
11. D. L. Donoho and X. Huo, "Uncertainty principles and ideal atomic decompositions, " IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2845-2862, Nov. 2001.
12. M. Elad and A. M. Bruckstein, "A generalized uncertainty principle and sparse representation in pairs of bases, " IEEE Trans. Inf. Theory, vol. 48, no. 9, pp. 2558-2567, Sep. 2002.
13. 1 minimization, " Proc. Natl. Acad. Sci., vol. 100, no. 5, pp. 2197-2202, Mar. 2003.
14. R. Gribonval and P. Vandergheynst, "On the exponential convergence of matching pursuits in quasi-incoherent dictionaries, " IEEE Trans. Inf. Theory, vol. 52, no. 1, pp. 255-261, Jan. 2006.
15. Y. C. Eldar, "Uncertainty relations for shift-invariant analog signals, " IEEE Trans. Inf. Theory, vol. 55, no. 12, pp. 5742-5757, Dec. 2009.
16. Y. C. Eldar and M. Mishali, "Robust recovery of signals from a structured union of subspaces, " IEEE Trans. Inf. Theory, vol. 55, no. 11, pp. 5302-5316, Nov. 2009.
17. Y. C. Eldar and M. Mishali, "Block-sparsity and sampling over a union of subspaces, " in Proc. 16th Int. Conf. Digital Signal Processing, Jul. 2009, pp. 1-8.
18. M. Mishali and Y. C. Eldar, "Blind multi-band signal reconstruction: Compressed sensing for analog signals, " IEEE Trans. Signal Process., vol. 57, no. 3, pp. 993-1009, Mar. 2009.
19. M. Mishali and Y. C. Eldar, "From theory to practice: Sub-Nyquist sampling of sparse wideband analog signals, " IEEE J. Sel. Topics Signal Process., vol. 4, no. 2, pp. 375-391, Apr. 2009.
20. H. J. Landau, "Necessary density conditions for sampling and interpolation of certain entire functions, " Acta Math., vol. 117, no. 1, pp. 37-52, 1967.
21. M. Mishali, Y. C. Eldar, O. Dounaevsky, and E. Shoshan, "Xam-pling: Analog to digital at sub-Nyquist rates, " Electr. Eng. Dept., Technion-Israel Institute of Technology, Haifa, CCIT Report #751 Dec-09, EE Pub no. 1708; arXiv 0912.2495, 2009.
22. F. Parvaresh, H. Vikalo, S. Misra, and B. Hassibi, "Recovering sparse signals using sparse measurement matrices in compressed DNA microarrays, " IEEE J. Sel. Topics Signal Process., vol. 2, no. 3, pp. 275-285, Jun. 2008.
23. S. F. Cotter, B. D. Rao, K. Engan, and K. Kreutz-Delgado, "Sparse solutions to linear inverse problems with multiple measurement vectors, " IEEE Trans. Signal Process., vol. 53, no. 7, pp. 2477-2488, Jul. 2005.
24. J. Chen and X. Huo, "Theoretical results on sparse representations of multiple-measurement vectors, " IEEE Trans. Signal Process., vol. 54, no. 12, pp. 4634-4643, Dec. 2006.
25. M. Mishali and Y. C. Eldar, "Reduce and boost: Recovering arbitrary sets of jointly sparse vectors, " IEEE Trans. Signal Process., vol. 56, no. 10, pp. 4692-4702, Oct. 2008.
26. Y. C. Eldar and H. Rauhut, "Average case analysis of multichannel sparse recovery using convex relaxation, " IEEE Trans. Inf. Theory, vol. 56, no. 1, pp. 505-519, Jan. 2010.
27. Y. M. Lu and M. N. Do, "Sampling signals from a union of subspaces, " IEEE Signal Process. Mag., vol. 25, no. 2, pp. 41-47, Mar. 2008.
28. T. Blumensath and M. E. Davies, "Sampling theorems for signals from the union of finite-dimensional linear subspaces, " IEEE Trans. Inf. Theory, vol. 55, no. 4, pp. 1872-1882, Apr. 2009.
29. Y. C. Eldar, "Compressed sensing of analog signals in shift-invariant spaces, " IEEE Trans. Signal Process., vol. 57, no. 8, pp. 2986-2997, Aug. 2009.
30. P. G. Casazza and G. Kutyniok, "Frames of subspaces, " in Wavelets, Frames, and Operator Theory, ser. Contemp. Math.. Providence, RI: Amer. Math. Soc., 2004, vol. 345, pp. 87-113.
31. K. Gedalyahu and Y. C. Eldar, "Time delay estimation from low rate samples: Aunion of subspaces approach, " IEEE Trans. Signal Process., vol. 58, no. 6, Jun. 2010.
32. M. Stojnic, F. Parvaresh, and B. Hassibi, "On the reconstruction of block-sparse signals with an optimal number of measurements, " IEEE Trans. Signal Process., vol. 57, no. 8, pp. 3075-3085, May 2010.
33. R. G. Baraniuk, V. Cevher, M. F. Duarte, and C. Hegde, "Model-based compressive sensing, " IEEE Trans. Inf. Theory, vol. 56, no. 4, pp. 1982-2001, Apr. 2010.
34. D. Needell and J. A. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples, " Appl. Comput. Harmon. Anal., vol. 26, no. 3, pp. 301-321, May 2009.
35. T. Blumensath and M. E. Davies, "Iterative hard thresholding for compressed sensing, " Appl. Comput. Harmon. Anal., vol. 27, no. 3, pp. 265-274, 2009.
36. L. Peotta and P. Vandergheynst, "Matching pursuit with block incoherent dictionaries, " IEEE Trans. Signal Process., vol. 55, no. 9, pp. 4549-4557, Sep. 2007.
37. M. Yuan and Y. Lin, "Model selection and estimation in regression with grouped variables, " J. Roy. Stat. Soc. Ser. B Stat. Methodol., vol. 68, no. 1, pp. 49-67, 2006.
38. C. Chesneau and M. Hebiri, "Some theoretical results on the Grouped Variables Lasso, " Math. Methods Statist., vol. 17, no. 4, pp. 317-326, Dec. 2008.
39. Y. Nardi and A. Rinaldo, "On the asymptotic properties of the group lasso estimator for linear models, " Electron. J. Statist., vol. 2, pp. 605-633, 2008.
40. F. R. Bach, "Consistency of the group Lasso and multiple kernel learning, " J. Mach. Learn. Res., vol. 9, pp. 1179-1225, 2008.
41. L. Meier, S. V. D. Geer, and P. Bühlmann, "The group lasso for logistic regression, " J. R. Statist. Soc. B, vol. 70, no. 1, pp. 53-77, 2008.
42. J. Huang and T. Zhang, "The benefit of group sparsity, " Feb. 2009, ArXiv:0901.2962v2 [stat. ML].
43. R. Gribonval and M. Nielsen, "Sparse representations in unions of bases, " IEEE Trans. Inf. Theory, vol. 49, no. 12, pp. 3320-3325, Dec. 2003.
44. R. A. Horn and C. R. Johnson, Matrix Analysis. New York, NY: Cambridge Press, 1985.
45. R. A. Devore and V. N. Temlyakov, "Some remarks on greedy algorithms, " Adv. Comp. Math., vol. 5, pp. 173-187, 1996.
46. T. Strohmer and R. W. Heath, Jr, "Grassmannian frames with applications to coding and communication, " Appl. Comput. Harmon. Anal., vol. 14, no. 3, pp. 257-275, May 2003.
47. D. L. Donoho, M. Elad, and V. N. Temlyakov, "Stable recovery of sparse overcomplete representations in the presence of noise, " IEEE Trans. Inf. Theory, vol. 52, no. 1, pp. 6-18, Jan. 2006.
48. M. Kowalski, "Sparse regression using mixed norms, " Appl. Comput. Harmon. Anal., vol. 27, no. 3, pp. 303-324, Nov. 2009.