Sparse recovery from combined fusion frame measurements

IEEE Transactions on Information Theory

Volumn 57, Issue 6, 2011, Pages 3864-3876

  Boufounos, Petros ^a   Kutyniok, Gitta ^b   Rauhut, Holger ^c  

^a MITSUBISHI ELECTRIC RESEARCH LABORATORIES   (United States)

^b UNIVERSITY OF OSNABRÜCK   (Germany)

^c UNIVERSITY OF BONN   (Germany)

Author keywords

1,2 minimization; 1 minimization; Compressed sensing (CS); fusion frames; mutual coherence; random matrices; sparse recovery

Indexed keywords

COMPRESSED SENSING; FUSION FRAMES; MUTUAL COHERENCE; RANDOM MATRICES; SPARSE RECOVERY;

CONVEX OPTIMIZATION; DATA PROCESSING; RECOVERY; SIGNAL RECONSTRUCTION; VECTORS;

STOCHASTIC MODELS;

EID: 79957632493     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2011.2143890     Document Type: Article

References (43)

1. E. J. Candès, J. K. Romberg, and T. Tao, "Stable signal recovery from incomplete and inaccurate measurements," Commun. Pure Appl. Math., vol. 59, no. 8, pp. 1207-1223, 2006. (Pubitemid 43988295)
2. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
3. P. G. Casazza, G. Kutyniok, and S. Li, "Fusion Frames and Distributed Processing," Appl. Comput. Harmon. Anal., vol. 25, pp. 114-132, 2008. (Pubitemid 351713739)
4. P. Boufounos, G. Kutyniok, and H. Rauhut, "Compressed sensing for fusion frames," in Proc. SPIE, Wavelets XIII, 2009, vol. 7446, DOI: 10.1117/12.826327.
5. Y. 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.
6. Y. Eldar, P. Kuppinger, and H. Bolcskei, "Block-sparse signals: Uncertainty relations and efficient recovery," IEEE Trans. Signal Process., vol. 58, no. 6, pp. 3042-3054, Jun. 2010.
7. Y. 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.
8. A. M. Bruckstein, D. L. Donoho, and M. Elad, "From sparse solutions of systems of equations to sparse modeling of signals and images," SIAM Rev., vol. 51, no. 1, pp. 34-81, 2009.
9. M. Fornasier and H. Rauhut, "Recovery algorithms for vector valued data with joint sparsity constraints," SIAM J. Numer. Anal., vol. 46, no. 2, pp. 577-613, 2008.
10. J. A. Tropp, "Algorithms for simultaneous sparse approximation: Part II: Convex relaxation," Signal Process., vol. 86, no. 3, pp. 589-602, 2006. (Pubitemid 43106573)
11. L. Peotta and P. Vandergheynst, "Matching pursuit with block incoherent dictionaries," IEEE Trans. Signal Process., vol. 55, no. 9, pp. 4549-4557, Sep. 2007. (Pubitemid 47323629)
12. M. Kowalski and B. Torrésani, "Sparsity and persistence: Mixed norms provide simple signal models with dependent coefficients," Signal, Image, Video Process., vol. 3, no. 3, pp. 251-264, Sep. 2009.
13. D. Model and M. Zibulevsky, "Signal reconstruction in sensor arrays using sparse representations," Signal Process., vol. 86, no. 3, pp. 624-638, 2006. (Pubitemid 43106575)
14. D. Malioutov, "A Sparse Signal Reconstruction Perspective for Source Localization With Sensor Arrays," M.S. thesis, Massachusetts Inst. Technol., Cambridge, MA, Jul. 2003.
15. A. C. Zelinski, V. K. Goyal, E. Adalsteinsson, and L. L. Wald, "Sparsity in MRI RF excitation pulse design," in Proc. 42nd Annu. Conf. Information Sciences and Systems (CISS 2008), Mar. 2008, pp. 252-257.
16. L. Daudet, "Sparse and structured decompositions of signals with the molecular matching pursuit," IEEE Trans. Audio, Speech, Lang. Process., vol. 14, no. 5, pp. 1808-1816, 2006. (Pubitemid 46547600)
17. V. Cevher, R. Chellappa, and J. H. McClellan, "Vehicle speed estimation using acoustic wave patterns," IEEE Trans. Signal Process., vol. 57, no. 1, pp. 30-47, Jan. 2009.
18. A. Veeraraghavan, D. Reddy, and R. Raskar, "Coded strobing photography for high speed periodic events," IEEE Trans. Pattern Anal. Mach. Intell., to be published.
19. B. K. Natarajan, "Sparse approximate solutions to linear systems," SIAM J. Comput., vol. 24, pp. 227-234, 1995.
20. A. Cohen, W. Dahmen, and R. DeVore, "Compressed sensing and best κ-term approximation," J. Amer. Math. Soc., vol. 22, pp. 211-231, 2009.
21. q- Minimization: Go Over or Under? Depart. Comput. Appl. Math., Rice Univ., Houston, TX, Tech. Rep. TR05-09, Aug. 2005 [Online]. Available: http://www. caam.rice.edu/~yzhang/reports/tr0509.pdf
22. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2331-2242, Oct. 2004.
23. E. J. Candès and T. Tao, "Near optimal signal recovery from random projections: Universal encoding strategies?," IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5406-5425, Dec. 2006. (Pubitemid 46445381)
24. H. Rauhut, "Stability results for random sampling of sparse trigonometric polynomials," IEEE Trans. Inf. Theory, vol. 54, no. 12, pp. 5661-5670, Dec. 2008.
25. G. E. Pfander and H. Rauhut, "Sparsity in time-frequency representations," J. Fourier Anal. Appl., vol. 16, no. 2, pp. 233-260, 2010.
26. H. Rauhut, "Circulant and Toeplitz matrices in compressed sensing," presented at the SPARS, Saint-Malo, France, 2009.
27. J. A. Tropp, J. N. Laska, M. F. Duarte, J. K. Romberg, and R. G. Baraniuk, "Beyond Nyquist: Efficient sampling of sparse bandlimited signals," IEEE Trans. Inf. Theory, vol. 56, no. 1, pp. 520-544, Jan. 2010.
28. R. Baraniuk, V. Cevher, M. Duarte, and C. Hedge, "Model-Based Compressive Sensing," IEEE Trans. Inf. Theory, vol. 56, no. 4, pp. 1982-2001, Apr. 2010, 2008.
29. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM Rev., vol. 43, pp. 129-159, 2001. (Pubitemid 32406896)
30. 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. (Pubitemid 43263116)
31. R. Gribonval and M. Nielsen, "Sparse representations in unions of bases," IEEE Trans. Inf. Theory, vol. 49, no. 12, pp. 3320-3325, Dec. 2003.
32. H. Rauhut, "Compressive sensing and structured random matrices," in Theoretical Foundations and Numerical Methods for Sparse Recovery, ser. Radon Series Comp. Appl. Math, M. Fornasier, Ed. Berlin, Germany: deGruyter, 2010.
33. D. Baron, M. B. Wakin, M. F. Duarte, S. Sarvotham, and R. G. Baraniuk, "Distributed Compressed Sensing," Dept. Elect. Comput. Eng., Rice Univ., Houston, TX, Tech. Rep. TREE-0612, Nov. 2006.
34. 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.
35. 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, Aug. 2009.
36. q-minimization," Proc. Natl. Acad. Sci. USA, vol. 100, no. 5, pp. 2197-2202, 2003. (Pubitemid 36297476)
37. E. J. Candès, "The restricted isometry property and its implications for compressed sensing," C. Roy. Acad. Sci. Paris Ser. I Math., vol. 346, pp. 589-592, 2008.
38. q-minimization for 0
39. q-minimization," Appl. Comput. Harmon. Anal., vol. 29, no. 1, pp. 97-103, Jul. 2010, DOI: 10.1016/j.acha.2009.10.004..
40. J. J. Fuchs, "On sparse representations in arbitrary redundant bases," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1341-1344, Jun. 2004.
41. q-minimization," IEEE Trans. Inf. Theory, vol. 51, no. 4, pp. 1568-1570, Apr. 2005. (Pubitemid 40555897)
42. M. Ledoux, The Concentration of Measure Phenomenon. Providence, RI: AMS, 2001.
43. A. Barvinok, Measure Concentration, 2005, lecture notes.