Joint sparsity with different measurement matrices

2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012

Volumn , Issue , 2012, Pages 698-702

  Heckel, Reinhard ^a   Bolcskei, Helmut ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

JOINT SPARSITY; MULTIPLE MEASUREMENT VECTOR (MMV); MULTIPLE MEASUREMENTS; ORTHOGONAL MATCHING PURSUIT; RECOVERY PERFORMANCE; TIME VARYING;

COMMUNICATION; MATRIX ALGEBRA;

MEASUREMENTS;

EID: 84875758962     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/Allerton.2012.6483286     Document Type: Conference Paper

References (20)

1. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
2. D. L. Donoho and M. Elad, "Optimally sparse representation in general (nonorthogonal) dictionaries via '1 minimization," Proc. Natl. Acad. Sci., vol. 100, no. 5, pp. 2197-2202, Mar. 2003. (Pubitemid 36297476)
3. M. Elad, Sparse and redundant representations: From theory to applications in signal and image processing. Springer, 2010.
4. S. Cotter, B. 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, 2005. (Pubitemid 41174440)
5. 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, 2006. (Pubitemid 46405606)
6. J. A. Tropp, "Algorithms for simultaneous sparse approximation. Part II: Convex relaxation," Signal Process., vol. 86, no. 3, pp. 589-602, Mar. 2006. (Pubitemid 43106573)
7. J. A. Tropp, A. C. Gilbert, and M. J. Strauss, "Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit," Signal Process., vol. 86, no. 3, pp. 572-588, 2006. (Pubitemid 43106572)
8. M. E. Davies and Y. C. Eldar, "Rank awareness in joint sparse recovery," IEEE Trans. Inf. Theory, vol. 58, no. 2, pp. 1135-1146, 2012.
9. G. Davis, S. Mallat, and M. Avellaneda, "Adaptive greedy approximations," Constr. Approx., vol. 13, no. 1, pp. 57-98, Mar. 1997.
10. 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, 2010.
11. R. Gribonval, H. Rauhut, K. Schnass, and P. Vandergheynst, "Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms," J. Fourier Anal. Appl, vol. 14, no. 5, pp. 655-687, 2008.
12. Y. M. Lu and M. N. Do, "A theory for sampling signals from a union of subspaces," IEEE Trans. Signal Process., vol. 56, no. 6, pp. 2334- 2345, 2008. (Pubitemid 351795887)
13. Y. C. Eldar, "Compressed sensing of analog signals in shift-invariant spaces," IEEE Trans. Signal Process., vol. 57, no. 8, pp. 2986-2997, 2009.
14. R. Heckel and H. Bölcskei, "The generalized multiple measurement vector problem," in preparation, 2012.
15. Y. C. Eldar, P. Kuppinger, and H. Bölcskei, "Block-sparse signals: Uncertainty relations and efficient recovery," IEEE Trans. Signal Process., vol. 58, no. 6, pp. 3042-3054, 2010.
16. R. Baraniuk, V. Cevher, M. Duarte, and C. Hegde, "Model-based compressive sensing," IEEE Trans. Inf. Theory, vol. 56, no. 4, pp. 1982 -2001, Apr. 2010.
17. R. Tibshirani, "Regression shrinkage and selection via the lasso," J. R. Stat. Soc. Ser. B Stat. Methodol., vol. 58, no. 1, pp. 267-288, Jan. 1996.
18. M. Yuan and Y. Lin, "Model selection and estimation in regression with grouped variables," J. R. Stat. Soc. Ser. B Stat. Methodol., vol. 68, no. 1, pp. 49-67, 2006. (Pubitemid 43415335)
19. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2231-2242, 2004.
20. R. Vershynin, "Introduction to the non-asymptotic analysis of random matrices," in Compressed Sensing Theory and Applications, Y. C. Eldar and G. Kutyniok, Eds. Cambridge Univ. Press, 2012, pp. 210- 268.