Sampling and reconstructing signals from a union of linear subspaces

IEEE Transactions on Information Theory

Volumn 57, Issue 7, 2011, Pages 4660-4671

  Blumensath, Thomas ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Inverse problems; nonconvexly constrained optimization; sampling; union of subspaces

Indexed keywords

COMPRESSED SENSING; GENERAL APPROACH; INFINITE DIMENSIONAL; LINEAR SUBSPACE; NONCONVEXLY CONSTRAINED OPTIMIZATION; SAMPLING PROCEDURES; STRUCTURED MATRIXES; UNION OF SUBSPACES;

CONSTRAINED OPTIMIZATION; INVERSE PROBLEMS; SIGNAL RECONSTRUCTION;

HILBERT SPACES;

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

References (39)

1. E. Candès and J. Romberg, "Practical signal recovery from random projections," in Proc. SPIE Conf., Wavelet Applications in Signal and Image Processing XI, Jan. 2005.
2. D. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, 2006.
3. Y. Lu and M. 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)
4. T. Blumensath and M. E. Davies, "Sampling theorems for signals from the union of finite-dimensional subspaces," IEEE Trans. Inf. Theory, vol. 55, no. 4, pp. 1872-1882, 2009.
5. 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, 2009.
6. K. Gedalyahu and Y. C. Eldar, "Time-delay estimation from low-rate samples: A union of subspaces approach," IEEE Trans. Signal Process., vol. 58, no. 6, pp. 3017-3031, Jun. 2010.
7. J. M. Shapiro, "Embedded image coding using the zero-trees of wavelet coefficients," IEEE Trans. Image Process., vol. 41, no. 12, pp. 3445-3462, Dec. 1993.
8. C. La and M. Do, "Signal reconstruction using sparse tree representations," in Proc. SPIE Conf, Wavelet Applications in Signal and Image Processing XI, San Diego, CA, Sept. 2005.
9. 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.
10. Y. C. 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, June 2010.
11. T. Blumensath and M. Davies, "Compressed sensing and source separation," in Int. Conf. Independent Component Analysis and Blind Source Separation, 2007.
12. S. F. Cotter, B. D. Rao, K. Engan, and K. K-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)
13. 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)
14. J. A. Tropp, A. C. Gilbert, and M. J. Strauss, "Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit," Signal Process., vol. 86, pp. 572-588, 2006. (Pubitemid 43106572)
15. J. A. Tropp, "Algorithms for simultaneous sparse approximation. Part II: Convex relaxation," Signal Process., vol. 86, pp. 589-602, 2006. (Pubitemid 43106573)
16. K. Schnass, R. Gribonval, H. Rauhut, and P. Vandergheynst, "Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms," J. Fourier Anal. Applicat., Oct. 2008 [Online]. Available: DOI:10.1007/s00041-008-9044-y
17. H. Rauhut, K. Schnass, and P. Vandergheynst, "Compressed sensing and redundant dictionaries," IEEE Trans. Inf. Theory, vol. 54, no. 5, pp. 2210-2219, May 2007. (Pubitemid 351689557)
18. A. K. Fletcher, S. Rangan, and V. K. Goyal, "The rate-distortion performance of compressed sensing," in Proc. IEEE Conf. Acoustics, Speech and Signal Processing, 2007.
19. P. Milanfar, M. Elad, and R. Rubinstein, "Analysis versus synthesis in signal priors," Inv. Probl., vol. 23, pp. 947-968, 2007. (Pubitemid 46838835)
20. M. Vetterli, P. Marziliano, and T. Blu, "Sampling signals with finite rate of innovation," IEEE Trans. Signal Process., vol. 50, no. 6, pp. 1417-1428, 2002. (Pubitemid 34822552)
21. B. Recht, M. Fazel, and P.A. Parrilo, "Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization," SIAM Rev., vol. 52, no. 3, pp. 471-501, 2010.
22. Y. C. Eldar and M. Mishali, "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, 2010.
23. A. C. Hansen, Compressive Sampling in Infinite Dimensions preprint, 2010.
24. T. Blumensath and M. Davies, "Iterative hard thresholding for compressed sensing," Appl. Comput. Harmon. Anal., vol. 27, no. 3, pp. 265-274, 2009.
25. N. G. Kingsbury and T. H. Reeves, "Iterative image coding with overcomplete complex wavelet transforms," in Proc. Conf. Visual Communications and Image Processing, 2003.
26. T. Blumensath and M. E. Davies, "Iterative thresholding for sparse approximations," J. Fourier Anal. Applicat., vol. 14, no. 5, pp. 629-654, 2008.
27. H. W. Engl, M. Hanke, and A. Neubauer, Regularization of Inverse Problems. Norwell, MA: Kluwer, 2000.
28. R. Garg and R. Khandekar, "Gradient descend with sparsification: An iterative algorithm for sparse recovery with restricted isometry property," in Proc. 26th Annu. Int. Conf. Machine Learning, 2009, pp. 337-344.
29. R. Baraniuk, M. Davenport, R. De Vore, and M. Wakin, "A simple proof of the restricted isometry property for random matrices," Construct. Approx., 2007.
30. D. Goldfarb and S. Ma, Convergence of Fixed Point Continuation Algorithms for Matrix Rank Minimisation [Online]. Available: arXiv:0906.3499v2 2009
31. R. Meka, P. Jain, and I. S. Dhillon, Guaranteed Rank Minimization via Singular Value Projection [Online]. Available: arXiv:0909.5457v3 2009
32. E. 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, 2006. (Pubitemid 46445381)
33. R. G. Baraniuk, "Optimal Tree Approximation With Wavelets," Wavelet Applications in Signal and Image Processing VII, vol. 3813, pp. 196-207, 1999.
34. V. Chandrasekan, S. Sanghavi, P. A. Parrilo, and A. S.Willsky, "Ranksparsity incoherence formatrix decomposition," submitted for publication.
35. E. J. Candes, X. Li, Y. Ma, and J.Wright, "Robust principal component analysis?," submitted for publication.
36. Z. Zhou, J. Wright, X. Li, E. J. Candes, and Y. Ma, "Stable principal component pursuit," in Proc. Int. Symp. Information Theory, Jun. 2010.
37. 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, 2009.
38. G. Friedlander and M. Joshi, Introduction to the Theory of Distributions. Cambridge, U.K.: Cambridge Univ. Press, 1998.
39. P. L. Dragotti, M. Vetterli, and T. Blu, "Sampling moments and reconstructing signals of finite rate of innovation: Shannon meets StrangFix," IEEE Trans. Signal Process., vol. 55, no. 5, pp. 1741-1757, May 2007. (Pubitemid 46691625)