Sampling theorems for signals from the union of finite-dimensional linear subspaces

IEEE Transactions on Information Theory

Volumn 55, Issue 4, 2009, Pages 1872-1882

  Blumensath, Thomas ^a   Davies, Mike E ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Compressed sensing; Embedding and restricted isometry; Sampling theorems; Unions of linear subspaces

Indexed keywords

COMPRESSED SENSING; CONVEX HULLS; EMBEDDING AND RESTRICTED ISOMETRY; LINEAR ALGORITHMS; LINEAR MAPS; LINEAR SAMPLINGS; LIPSCHITZ CONSTANTS; MODEL PARAMETERS; NUMBER OF SAMPLES; NYQUIST; NYQUIST RATES; OBSERVATION SPACES; ORTHONORMAL BASIS; SAMPLING METHODS; SAMPLING STRATEGIES; SAMPLING THEOREMS; SHANNON SAMPLING THEOREMS; SIGNAL ACQUISITIONS; SIGNAL MODELS; SPARSE REPRESENTATIONS; SPARSE SIGNAL MODELS; SUFFICIENT CONDITIONS; TREE STRUCTURES; UNIONS OF LINEAR SUBSPACES;

SIGNAL ANALYSIS; SIGNAL RECONSTRUCTION; TREES (MATHEMATICS);

SIGNAL PROCESSING;

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

References (35)

1. H. Nyquist, "Certain topics in telegraph transmission theory," Trans. Amer. Inst. Electr. Eng., pp. 617-644, Feb. 1928.
2. C. A. Shannon and W. Weaver, The Mathematical Theory of Communication Chicago, IL: Univ. Illinois Press, 1949.
3. I. F. Gorodnitsky and B. D. Rao, "Sparse signal reconstruction from limited data using FOCUSS: A re-weighted minimum norm algorithm," IEEE Trans. Signal Process., vol. 45, no. 3, pp. 600-616, Mar. 1997.
4. 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, Jun. 2002.
5. Y. C. Eldar, "Compressed sensing of analog signals," arXiv:0806. 3332v1, 2008.
6. E. Candès, J. 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.
7. E. Candès and J. Romberg, "Quantitative robust uncertainty principles and optimally sparse decompositions," Found. Comput. Math vol. 6, no. 2, pp. 227-254, 2006.
8. 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, Dec. 2006.
9. D. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
10. E. Candès, J. Romberg, and T. Tao, "Stable signal recovery from incomplete and inaccurate measurements," Commun. Pure Appl. Math. vol. 59, no. 8, pp. 1207-1223, 2006.
11. A. Cohen, W. Dahmen, and R. DeVore, "Compressed sensing and best k-term approximation," J. Amer. Math. Soc., vol. 22, no. 1, pp. 211-231, 2009.
12. 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.
13. T. Blumensath and M. Davies, "Compressed sensing and source separation," in Independent Component Analysis and Blind Source Separation, ser. Lecture Notes on Computer Science 4666, M. E. Davies, C. J. James, S. Abdallah, and M. D. Plumbley, Eds. New York: Springer-Verlag, 2007, pp. 341-348.
14. A. K. Fletcher, S. Rangan, and V. K. Goyal, "On the rate-distortion performance of compressed sensing," in Proc. IEEE Conf. Acoust. Speech Signal Process., 2007, vol. 3, pp. 885-888.
15. J. Haupt and R. Nowak, "Signal reconstruction from noisy random projections," IEEE Trans. Inf. Theory, vol. 52, no. 9, pp. 4036-4048, Sep. 2006.
16. E. Candès and T. Tao, "The dantzig selector: Statistical estimation when p is larger than n," Ann. Statist., vol. 35, no. 6, pp. 2313-2351, 2007.
17. 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, Jun. 2008.
18. C. La and M. Do, "Signal reconstruction using sparse tree representations," in Proc. SPIE Conf. Wavelet Appl. Signal Image Process. XI, San Diego, CA, Sep. 2005, vol. 5914.
19. 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, Jul. 2005.
20. C. J. 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.
21. 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.
22. J. A. Tropp, "Algorithms for simultaneous sparse approximation. Part II: Convex relaxation," Signal Process., vol. 86, pp. 589-602, 2006.
23. K. S. 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. Appl., Oct. 2008, DOI:10.1007/s00041-008-9044-y.
24. G. A. Edgar, Measure, Topology, and Fractal Geometry. New York: Springer-Verlag, 1990.
25. J. M. Lee, Introduction to Smooth Manifolds. New York: Springer-Verlag, 2000.
26. T. Sauer, J. A. Yorke, and M. Casdagli, "Embedology," J. Statist. Phys., vol. 65, no. 3/4, pp. 579-616, 1991.
27. R. Hunt, T. Sauer, and A. Yorke, "Prevalence: A translation-invariant "almost every" on infinite-dimensional spaces," Bull. Amer. Math. Soc., vol. 99, no. 11, pp. 217-238, 1992.
28. R. Baraniuk and M. Wakin, "Random projections of smooth manifolds," Found. Comput. Math., Sep. 2007, DOI:10.1007/s10208-007-9011-z.
29. D. L. Donoho and M. Elad, "Optimally-sparse representation in general (non-orthogonal) dictionaries via l1 minimization," in Proc. Nat. Acad. Sci., 2003, vol. 100, pp. 2197-2202.
30. D. L. Donoho, "For most large underdetermined systems of linear equations the minimal 1-norm solution is also the sparsest solution," Commun. Pure Appl. Math., vol. 59, no. 6, pp. 797-829, 2006.
31. M. B. Wakin, "The geometry of low-dimensional signal manifolds," Ph.D. dissertation, Electr. Comput. Eng., Rice Univ., Houston, TX, 2006.
32. E. Candès and J. Romberg, "Signal recovery from random projections," in Proc. SPIE Conf. Comput. Imaging III, Mar. 2005, vol. 5914, pp. 76-86.
33. E. J. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2004.
34. R. Baraniuk, M. Davenport, R. De Vore, and M. Wakin, "A simple proof of the restricted isometry property for random matrices," Constructive Approx., Feb. 2008, DOI:10.1007/s00365-007-9003-x.
35. E. Candés, "Compressive sampling," in Proc. Int. Congr. Math. Madrid, Spain, 2006, vol. 3, pp. 1433-1452.