Introduction to compressed sensing

Compressed Sensing: Theory and Applications

Volumn , Issue , 2009, Pages 1-64

  Davenport, Mark A ^a   Duarte, Marco F ^b   Eldar, Yonina C ^a,c,d   Kutyniok, Gitta ^e  

^a STANFORD UNIVERSITY   (United States)

^b DUKE UNIVERSITY   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^e TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS TIME SYSTEMS; RECOVERY;

BAND-LIMITED SIGNAL; DISCRETE-TIME SIGNALS; EMERGING APPLICATIONS; INITIAL DEVELOPMENT; RECOVERY ALGORITHMS; SCIENTIFIC COMMUNITY; SIGNAL OF INTERESTS; THEORETICAL FOUNDATIONS;

COMPRESSED SENSING;

EID: 84938488621     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511794308.002     Document Type: Chapter

References (254)

1. W. Bajwa, J. Haupt, G. Raz, S. Wright, and R. Nowak. Toeplitz-structured compressed sensing matrices. Proc IEEE Work Stat Sig Proce, Madison, WI, 2007.
2. W. Bajwa, J. Haupt, A. Sayeed, and R. Nowak. Compressed channel sensing: A new approach to estimating sparse multipath channels. Proc IEEE, 98(6):1058-1076, 2010.
3. R. Baraniuk. Compressive sensing. IEEE Signal Proc Mag, 24(4):118-120, 124, 2007.
4. R. Baraniuk, V. Cevher, M. Duarte, and C. Hegde. Model-based compressive sensing. IEEE Trans. Inform Theory, 56(4):1982-2001, 2010.
5. R. Baraniuk, M. Davenport, R. DeVore, and M. Wakin. A simple proof of the restricted isometry property for random matrices. Const Approx, 28(3):253-263, 2008.
6. R. Baraniuk and M. Wakin. Random projections of smooth manifolds. Found Comput Math, 9(1):51-77, 2009.
7. D. Baron, M. Duarte, S. Sarvotham, M. Wakin, and R. Baraniuk. Distributed compressed sensing of jointly sparse signals. Proc Asilomar Conf Sign, Syst Comput, Pacific Grove, CA, 2005.
8. D. Baron, S. Sarvotham, and R. Baraniuk. Sudocodes - Fast measurement and reconstruction of sparse signals. Proc IEEE Int Symp Inform Theory (ISIT), Seattle, WA, 2006.
9. J. Bazerque and G. Giannakis. Distributed spectrum sensing for cognitive radio networks by exploiting sparsity. IEEE Trans Sig Proc, 58(3):1847-1862, 2010.
10. P. Bechler and P. Wojtaszczyk. Error estimates for orthogonal matching pursuit and random dictionaries. Const Approx, 33(2):273-288, 2011.
11. A. Beck and M. Teboulle. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J Imag Sci, 2(1):183-202, 2009.
12. S. Becker, J. Bobin, and E. Candes. NESTA: A fast and accurate first-order method for sparse recovery. SIAM J Imag Sci, 4(1):1-39, 2011.
13. S. Becker, E. Candes, and M. Grant. Templates for convex cone problems with applications to sparse signal recovery. Math Prog Comp, 3(3):165-218, 2011.
14. M. Belkin and P. Niyogi. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput, 15(6):1373-1396, 2003.
15. M. Belkin and P. Niyogi. Semi-supervised learning on Riemannian manifolds. Mach Learning, 56:209-239, 2004.
16. Z. Ben-Haim and Y. C. Eldar. Blind minimax estimation. IEEE Trans. Inform Theory, 53(9):3145-3157, 2007.
17. Z. Ben-Haim and Y. C. Eldar. The Cramer-Rao bound for estimating a sparse parameter vector. IEEE Trans Sig Proc, 58(6):3384-3389, 2010.
18. Z. Ben-Haim, Y. C. Eldar, and M. Elad. Coherence-based performance guarantees for estimating a sparse vector under random noise. IEEE Trans Sig Proc, 58(10):5030-5043, 2010.
19. Z. Ben-Haim, T. Michaeli, and Y. C. Eldar. Performance bounds and design criteria for estimating finite rate of innovation signals. Preprint, 2010.
20. R. Berinde, A. Gilbert, P. Indyk, H. Karloff, and M. Strauss. Combining geometry and combinatorics: Aunified approach to sparse signal recovery. Proc Allerton Conf Commun. Control, Comput, Monticello, IL, Sept. 2008.
21. R. Berinde, P. Indyk, and M. Ruzic. Practical near-optimal sparse recovery in the l1 norm. In Proc Allerton Conf Comm Control, Comput, Monticello, IL, Sept. 2008.
22. A. Beurling. Sur les integrales de Fourier absolument convergentes et leur application a une transformation fonctionelle. In Proc Scandi Math Congr, Helsinki, Finland, 1938.
23. T. Blumensath and M. Davies. Gradient pursuits. IEEE Trans Sig Proc, 56(6):2370-2382, 2008.
24. T. Blumensath and M. Davies. Iterative hard thresholding for compressive sensing. Appl Comput Harmon Anal, 27(3):265-274, 2009.
25. T. Blumensath and M. Davies. Sampling theorems for signals from the union of finitedimensional linear subspaces. IEEE Trans Inform Theory, 55(4):1872-1882, 2009.
26. B. Bodmann, P. Cassaza, and G. Kutyniok. A quantitative notion of redundancy for finite frames. Appl Comput Harmon Anal, 30(3):348-362, 2011.
27. P. Boufounos, H. Rauhut, and G. Kutyniok. Sparse recovery from combined fusion frame measurements. IEEE Trans Inform Theory, 57(6):3864-3876, 2011.
28. J. Bourgain, S. Dilworth, K. Ford, S. Konyagin, and D. Kutzarova. Explicit constructions of RIP matrices and related problems. Duke Math J, 159(1):145-185, 2011.
29. Y. Bresler and P. Feng. Spectrum-blind minimum-rate sampling and reconstruction of 2-D multiband signals. Proc IEEE Int Conf Image Proc (ICIP), Zurich, Switzerland, 1996.
30. D. Broomhead and M. Kirby. The Whitney reduction network: A method for computing autoassociative graphs. Neural Comput, 13:2595-2616, 2001.
31. A. Bruckstein, D. Donoho, and M. Elad. From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Rev, 51(1):34-81, 2009.
32. T. Cai and T. Jiang. Limiting laws of coherence of random matrices with applications to testing covariance structure and construction of compressed sensing matrices. Ann Stat, 39(3):1496-1525, 2011.
33. E. Candes. Compressive sampling. Proc Int Congre Math, Madrid, Spain, 2006.
34. E. Candes. The restricted isometry property and its implications for compressed sensing. CRAcadSci, SerI, 346(9-10):589-592, 2008.
35. E. Candes, Y. C. Eldar, D. Needell, and P. Randall. Compressed sensing with coherent and redundant dictionaries. Appl Comput Harmon Anal, 31(1):59-73, 2010.
36. E. Candes, X. Li, Y. Ma, and J. Wright. Robust principal component analysis? J ACM, 58(1):1-37, 2009.
37. E. Candes and Y. Plan. Near-ideal model selection by l1 minimization. Ann Stat, 37(5A):2145-2177, 2009.
38. E. Candes and Y. Plan. Matrix completion with noise. Proc IEEE, 98(6):925-936, 2010.
39. E. Candes and B. Recht. Exact matrix completion via convex optimization. Found Comput Math, 9(6):717-772, 2009.
40. E. Candes and J. Romberg. Quantitative robust uncertainty principles and optimally sparse decompositions. Found Comput Math, 6(2):227-254, 2006.
41. E. Candes, J. Romberg, and T. Tao. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Trans Inform Theory, 52(2):489-509, 2006.
42. E. Candes, J. Romberg, and T. Tao. Stable signal recovery from incomplete and inaccurate measurements. Comm Pure Appl Math, 59(8):1207-1223, 2006.
43. E. Candes and T. Tao. Decoding by linear programming. IEEE Trans Inform Theory, 51(12):4203-4215, 2005.
44. E. Candes and T. Tao. Near optimal signal recovery from random projections: Universal encoding strategies? IEEE Trans Inform Theory, 52(12):5406-5425, 2006.
45. E. Candes and T. Tao. The Dantzig selector: Statistical estimation when p is much larger than n. Ann Stat, 35(6):2313-2351, 2007.
46. C. Caratheodory. Uber den Variabilitatsbereich der Koeffizienten von Potenzreihen, die gegebene Werte nicht annehmen. Math Ann, 64:95-115, 1907.
47. C. Caratheodory. Uber den Variabilitatsbereich der Fourierschen Konstanten von positiven harmonischen Funktionen. Rend Circ Mat Palermo, 32:193-217, 1911.
48. P. Casazza and G. Kutyniok. Finite Frames. Birkhauser, Boston, MA, 2012.
49. V. Cevher, M. Duarte, C. Hegde, and R. Baraniuk. Sparse signal recovery using Markov random fields. In ProcAdv Neural Proc Syst(NIPS), Vancouver, BC, 2008.
50. V. Cevher, P. Indyk, C. Hegde, and R. Baraniuk. Recovery of clustered sparse signals from compressive measurements. Proc Sampling Theory Appl (SampTA), Marseilles, France, 2009.
51. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. In Proc Int Coll Autom Lang Programm, Malaga, Spain, 2002.
52. J. Chen and X. Huo. Theoretical results on sparse representations of multiple-measurement vectors. IEEE Trans Sig Proc, 54(12):4634-4643, 2006.
53. S. Chen, D. Donoho, and M. Saunders. Atomic decomposition by basis pursuit. SIAM J Sci Comp, 20(1):33-61, 1998.
54. Y. Chi, L. Scharf, A. Pezeshki, and R. Calderbank. Sensitivity to basis mismatch in compressed sensing. IEEE Trans Sig Proc, 59(5):2182-2195, 2011.
55. O. Christensen. An Introduction to Frames and Riesz Bases. Birkhauser, Boston, MA, 2003.
56. A. Cohen, W. Dahmen, and R. DeVore. Instance optimal decoding by thresholding in compressed sensing. Int Conf Harmonic Analysis and Partial Differential Equations, Madrid, Spain, 2008.
57. A. Cohen, W. Dahmen, and R. DeVore. Compressed sensing and best fc-term approximation. J Am Math Soc, 22(1):211-231, 2009.
58. R. Coifman and M. Maggioni. Diffusion wavelets. Appl Comput Harmon Anal, 21(1): 53-94, 2006.
59. G. Cormode and M. Hadjieleftheriou. Finding the frequent items in streams of data. Comm ACM, 52(10):97-105, 2009.
60. G. Cormode and S. Muthukrishnan. Improved data stream summaries: The count-min sketch and its applications. J Algorithms, 55(1):58-75, 2005.
61. J. Costa and A. Hero. Geodesic entropic graphs for dimension and entropy estimation in manifold learning. IEEE Trans Sig Proc, 52(8):2210-2221, 2004.
62. S. Cotter and B. Rao. Sparse channel estimation via matching pursuit with application to equalization. IEEE Trans Commun, 50(3):374-377, 2002.
63. S. Cotter, B. Rao, K. Engan, and K. Kreutz-Delgado. Sparse solutions to linear inverse problems with multiple measurement vectors. IEEE Trans Sig Proc, 53(7):2477-2488, 2005.
64. W. Dai and O. Milenkovic. Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans Inform Theory, 55(5):2230-2249, 2009.
65. I. Daubechies. Ten Lectures on Wavelets. SIAM, Philadelphia, PA, 1992.
66. I. Daubechies, M. Defrise, and C. De Mol. An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Comm Pure Appl Math, 57(11):1413-1457, 2004.
67. M. Davenport. Random observations on random observations: Sparse signal acquisition and processing. PhD thesis, Rice University, 2010.
68. M. Davenport and R. Baraniuk. Sparse geodesic paths. Proc AAAI Fall Symp Manifold Learning, Arlington, VA, 2009.
69. M. Davenport, P. Boufounos, and R. Baraniuk. Compressive domain interference cancellation. Proc Work Struc Parc Rep Adap Signaux (SPARS), Saint-Malo, France, 2009.
70. M. Davenport, P. Boufounos, M. Wakin, and R. Baraniuk. Signal processing with compressive measurements. IEEE J Sel Top Sig Proc, 4(2):445-460, 2010.
71. M. Davenport, M. Duarte, M. Wakin, et al. The smashed filter for compressive classification and target recognition. In Proc IS&T/SPIE Symp Elec Imag: Comp Imag, San Jose, CA, 2007.
72. M. Davenport, C. Hegde, M. Duarte, and R. Baraniuk. Joint manifolds for data fusion. IEEE Trans Image Proc, 19(10):2580-2594, 2010.
73. M. Davenport, J. Laska, P. Boufounos, and R. Baraniuk. A simple proof that random matrices are democratic. Technical Report TREE 0906, Rice Univ., ECE Dept, 2009.
74. M. Davenport, S. Schnelle, J. P. Slavinsky, et al. A wideband compressive radio receiver. Proc IEEE Conf Mil Comm (MILCOM), San Jose, CA, 2010.
75. M. Davenport and M. Wakin. Analysis of orthogonal matching pursuit using the restricted isometry property. IEEE Trans Inform Theory, 56(9):4395-4401, 2010.
76. M. Davies and Y. C. Eldar. Rank awareness in joint sparse recovery. To appear in IEEE Trans Inform Theory, 2011.
77. R. DeVore. Nonlinear approximation. Acta Numer, 7:51-150, 1998.
78. R. DeVore. Deterministic constructions of compressed sensing matrices. J Complex, 23(4):918-925, 2007.
79. M. Do and C. La. Tree-based majorize-minimize algorithm for compressed sensing with sparse-tree prior. Int Workshop Comput Adv Multi-Sensor Adapt Proc (CAMSAP), Saint Thomas, US Virgin Islands, 2007.
80. D. Donoho. Denoising by soft-thresholding. IEEE Trans Inform Theory, 41(3):613-627, 1995.
81. D. Donoho. Neighborly polytopes and sparse solutions of underdetermined linear equations. Technical Report 2005-04, Stanford Univ., Stat. Dept, 2005.
82. D. Donoho. Compressed sensing. IEEE Trans Inform Theory, 52(4):1289-1306, 2006.
83. D. Donoho. For most large underdetermined systems of linear equations, the minimal l1-norm solution is also the sparsest solution. Comm Pure Appl Math, 59(6):797-829, 2006.
84. D. Donoho. High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension. Discrete Comput Geom, 35(4):617-652, 2006.
85. D. Donoho, I. Drori, Y. Tsaig, and J.-L. Stark. Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit. Tech Report Stanford Univ., 2006.
86. D. Donoho and M. Elad. Optimally sparse representation in general (nonorthogonal) dictionaries via l1 minimization. Proc Natl Acad Sci, 100(5):2197-2202, 2003.
87. D. Donoho and M. Elad. On the stability of basis pursuit in the presence of noise. EURASIP Sig Proc J, 86(3):511-532, 2006.
88. D. Donoho, M. Elad, and V. Temlyahov. Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Trans Inform Theory, 52(1):6-18, 2006.
89. D. Donoho and C. Grimes. Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data. Proc Natl Acad. Sci, 100(10):5591-5596, 2003.
90. D. Donoho and C. Grimes. Image manifolds which are isometric to Euclidean space. J Math Imag Vision, 23(1):5-24, 2005.
91. D. Donoho and B. Logan. Signal recovery and the large sieve. SIAM J Appl Math, 52(6):577-591, 1992.
92. D. Donoho and J. Tanner. Neighborliness of randomly projected simplices in high dimensions. Proc Natl Acad Sci, 102(27):9452-9457, 2005.
93. D. Donoho and J. Tanner. Sparse nonnegative solutions of undetermined linear equations by linear programming. Proc Natl Acad Sci, 102(27):9446-9451, 2005.
94. D. Donoho and J. Tanner. Counting faces of randomly-projected polytopes when the projection radically lowers dimension. J Am Math Soc, 22(1):1-53, 2009.
95. D. Donoho and J. Tanner. Precise undersampling theorems. Proc IEEE, 98(6):913-924, 2010.
96. D. Donoho and Y. Tsaig. Fast solution of l1 norm minimization problems when the solution may be sparse. IEEE Trans Inform Theory, 54(11):4789-4812, 2008.
97. P. Dragotti, M. Vetterli, and T. Blu. Sampling moments and reconstructing signals of finite rate of innovation: Shannon meets Strang-Fix. IEEE Trans Sig Proc, 55(5):1741-1757, 2007.
98. D. Du and F. Hwang. Combinatorial Group Testing and Its Applications. World Scientific, Singapore, 2000.
99. M. Duarte, M. Davenport, D. Takhar, et al. Single-pixel imaging via compressive sampling. IEEE Sig Proc Mag, 25(2):83-91, 2008.
100. M. Duarte, M. Davenport, M. Wakin, and R. Baraniuk. Sparse signal detection from incoherent projections. Proc IEEE Int Conf Acoust, Speech, Sig Proc (ICASSP), Toulouse, France, 2006.
101. M. Duarte, M. Davenport, M. Wakin, et al. Multiscale random projections for compressive classification. Proc IEEE Int Conf Image Proc (ICIP), San Antonio, TX, Sept. 2007.
102. M. Duarte and Y. C. Eldar. Structured compressed sensing: Theory and applications. IEEE Trans Sig Proc, 59(9):4053-4085, 2011.
103. M. Duarte, M. Wakin, and R. Baraniuk. Fast reconstruction of piecewise smooth signals from random projections. Proc Work Struc Parc Rep Adap Signaux (SPARS), Rennes, France, 2005.
104. M. Duarte, M. Wakin, and R. Baraniuk. Wavelet-domain compressive signal reconstruction using a hidden Markov tree model. Proc IEEE Int Conf Acoust, Speech, Signal Proc (ICASSP), Las Vegas, NV, Apr. 2008.
105. T. Dvorkind, Y. C. Eldar, and E. Matusiak. Nonlinear and non-ideal sampling: Theory and methods. IEEE Trans Sig Proc, 56(12):471-481, 2009.
106. M. Elad. Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing. Springer, New York, NY, 2010.
107. M. Elad, B. Matalon, J. Shtok, and M. Zibulevsky. A wide-angle view at iterated shrinkage algorithms. Proc SPIE Optics Photonics: Wavelets, San Diego, CA, 2007.
108. Y. C. Eldar. Rethinking biased estimation: Improving maximum likelihood and the Cramer- Rao bound Found. Trends Sig Proc, 1(4):305-449, 2008.
109. Y. C. Eldar. Compressed sensing of analog signals in shift-invariant spaces. IEEE Trans Sig Proc, 57(8):2986-2997, 2009.
110. Y. C. Eldar. Generalized SURE for exponential families: Applications to regularization. IEEE Trans Sig Proc, 57(2):471-481, 2009.
111. Y. C. Eldar. Uncertainty relations for shift-invariant analog signals. IEEE Trans Inform Theory, 55(12):5742-5757, 2009.
112. Y. C. Eldar, P. Kuppinger, and H. Bolcskei. Block-sparse signals: Uncertainty relations and efficient recovery. IEEE Trans Sig Proc, 58(6):3042-3054, 2010.
113. Y. C. Eldar and T. Michaeli. Beyond bandlimited sampling. IEEE Sig Proc Mag, 26(3): 48-68, 2009.
114. Y. C. Eldar and M. Mishali. Robust recovery of signals from a structured union of subspaces. IEEE Trans Inform Theory, 55(11):5302-5316, 2009.
115. Y. C. Eldar and H. Rauhut. Average case analysis of multichannel sparse recovery using convex relaxation. IEEE Trans Inform Theory, 6(1):505-519, 2010.
116. Y. Erlich, N. Shental, A. Amir, and O. Zuk. Compressed sensing approach for high throughput carrier screen. Proc Allerton Conf Commun Contr Comput, Monticello, IL, Sept. 2009.
117. P. Feng. Universal spectrum blind minimum rate sampling and reconstruction of multiband signals. PhD thesis, University of Illinois at Urbana-Champaign, Mar. 1997.
118. P. Feng and Y. Bresler. Spectrum-blind minimum-rate sampling and reconstruction of multiband signals. Proc IEEE Int Conf Acoust, Speech, Sig Proc (ICASSP), Atlanta, GA, May 1996.
119. I. Fevrier, S. Gelfand, and M. Fitz. Reduced complexity decision feedback equalization for multipath channels with large delay spreads. IEEE Trans Communi, 47(6):927-937, 1999.
120. M. Figueiredo, R. Nowak, and S. Wright. Gradient projections for sparse reconstruction: Application to compressed sensing and other inverse problems. IEEE J Select Top Sig Proc, 1(4):586-597, 2007.
121. M. Fornassier and H. Rauhut. Recovery algorithms for vector valued data withjoint sparsity constraints. SIAM J Numer Anal, 46(2):577-613, 2008.
122. J. Friedman, T. Hastie, and R. Tibshirani. Regularization paths for generalized linear models via coordinate descent. J Stats Software, 33(1):1-22, 2010.
123. N. Galatsanos and A. Katsaggelos. Methods for choosing the regularization parameter and estimating the noise variance in image restoration and their relation. IEEE Trans Image Proc, 1(3):322-336, 1992.
124. A. Garnaev and E. Gluskin. The widths of Euclidean balls. Dokl An SSSR, 277:1048-1052, 1984.
125. K. Gedalyahu and Y. C. Eldar. Time-delay estimation from low-rate samples: A union of subspaces approach. IEEE Trans Sig Proc, 58(6):3017-3031, 2010.
126. K. Gedalyahu, R. Tur, and Y. C. Eldar. Multichannel sampling of pulse streams at the rate of innovation. IEEE Trans Sig Proc, 59(4):1491-1504, 2011.
127. S. Gersgorin. Uber die Abgrenzung der Eigenwerte einer Matrix. Izv. Akad Nauk SSSR Ser Fiz.-Mat, 6:749-754, 1931.
128. A. Gilbert and P. Indyk. Sparse recovery using sparse matrices. Proc IEEE, 98(6):937-947, 2010.
129. A. Gilbert, Y. Li, E. Porat, and M. Strauss. Approximate sparse recovery: Optimizing time and measurements. Proc ACM Symp Theory Comput, Cambridge, MA, Jun. 2010.
130. A. Gilbert, M. Strauss, J. Tropp, and R. Vershynin. One sketch for all: Fast algorithms for compressed sensing. Proc ACM Symp Theory Comput, San Diego, CA, Jun. 2007.
131. S. Gleichman and Y. C. Eldar. Blind compressed sensing. To appear in IEEE Trans Inform Theory, 57(10):6958-6975, 2011.
132. D. Goldberg, D. Nichols, B. Oki, and D. Terry. Using collaborative filtering to weave an information tapestry. Commun ACM, 35(12):61-70, 1992.
133. G. Golub and M. Heath. Generalized cross-validation as a method for choosing a good ridge parameter. Technometrics, 21(2):215-223, 1970.
134. I. Gorodnitsky, J. George, and B. Rao. Neuromagnetic source imaging with FOCUSS: A recursive weighted minimum norm algorithm. Electroen Clin Neuro, 95(4):231-251, 1995.
135. I. Gorodnitsky and B. Rao. Sparse signal reconstruction from limited data using FOCUSS: A re-weighted minimum norm algorithm. IEEE Trans Sig Proc, 45(3):600-616, 1997.
136. I. Gorodnitsky, B. Rao, and J. George. Source localization in magnetoencephalography using an iterative weighted minimum norm algorithm. Proc Asilomar Conf Sig, Syst and Comput, Pacific Grove, CA, Oct. 1992.
137. 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, 14(5):655-687, 2008.
138. E. Hale, W. Yin, and Y. Zhang. A fixed-point continuation method for -regularized minimization with applications to compressed sensing. Technical Report TR07-07, Rice Univ., CAAM Dept, 2007.
139. T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning. Springer, New York, NY, 2001.
140. J. Haupt, L. Applebaum, and R. Nowak. On the restricted isometry of deterministically subsampled Fourier matrices. Conf Inform Sci Syste (CISS), Princeton, NJ, 2010.
141. J. Haupt, W. Bajwa, M. Rabbat, and R. Nowak. Compressed sensing for networked data. IEEE Sig Proc Mag, 25(2):92-101, 2008.
142. J. Haupt, W. Bajwa, G. Raz, and R. Nowak. Toeplitz compressed sensing matrices with applications to sparse channel estimation. IEEE Trans Inform Theory, 56(11):5862-5875, 2010.
143. J. Haupt, R. Castro, R. Nowak, G. Fudge, and A. Yeh. Compressive sampling for signal classification. Proc Asilomar Conf Sig, Syste, Comput, Pacific Grove, CA, 2006.
144. J. Haupt and R. Nowak. Signal reconstruction from noisy random projections. IEEE Trans Inform Theory, 52(9):4036-4048, 2006.
145. J. Haupt and R. Nowak. Compressive sampling for signal detection. In Proc. IEEE Int. Conf Acoust, Speech, Sig Proc (ICASSP), Honolulu, HI, 2007.
146. D. Healy. Analog-to-information: BAA#05-35, 2005. Available online at http://www.darpa.mil/mto/solicitations/baa05-35/s/index.html.
147. C. Hegde, M. Duarte, and V. Cevher. Compressive sensing recovery of spike trains using a structured sparsity model. Proc Work Struc Parc Rep Adap Signaux (SPARS), Saint-Malo, France, 2009.
148. M. Herman and T. Strohmer. High-resolution radar via compressed sensing. IEEE Trans Sig Proc, 57(6):2275-2284, 2009.
149. M. Herman and T. Strohmer. General deviants: An analysis of perturbations in compressed sensing. IEEE J Select Top Sig Proc, 4(2):342-349, 2010.
150. G. Hinton, P. Dayan, and M. Revow. Modelling the manifolds of images of handwritten digits. IEEE Trans Neural Networks, 8(1):65-74, 1997.
151. L. Hogben. Handbook of Linear Algebra. Discrete Mathematics and its Applications. Chapman & Hall/CRC, Boca Raton, FL, 2007.
152. P. Indyk. Explicit constructions for compressed sensing of sparse signals. Proc. ACM-SIAM Symp Discrete Algorithms (SODA), San Franciso, CA, 2008.
153. P. Indyk and M. Ruzic. Near-optimal sparse recovery in the l1 norm. In Proc IEEE Symp Found Comp Science (FOCS), Philadelphia, PA, 2008.
154. S. Jafarpour, W. Xu, B. Hassibi, and R. Calderbank. Efficient and robust compressed sensing using optimized expander graphs. IEEE Trans Inform Theory, 55(9):4299-4308, 2009.
155. W. James and C. Stein. Estimation of quadratic loss. In Proc 4th Berkeley Symp Math Statist Prob, 1: 361-379. University of California Press, Berkeley, 1961.
156. T. Jayram and D. Woodruff. Optimal bounds for Johnson-Lindenstrauss transforms and streaming problems with sub-constant error. Proc ACM-SIAM Symp Discrete Algorithms (SODA), San Francisco, CA, 2011.
157. B. Jeffs. Sparse inverse solution methods for signal and image processing applications. In Proc IEEE Int Conf Acoust, Speech Sig Proce (ICASSP), Seattle, WA, 1998.
158. W. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. Proc Conf Modern Anal Prob, New Haven, CT, 1982.
159. G. Judge and M. Bock. The Statistical Implications of Pre-Test and Stein-Rule Estimators in Econometrics. North-Holland, Amsterdam, 1978.
160. R. Kainkaryam, A. Breux, A. Gilbert, P. Woolf, and J. Schiefelbein. poolMC: Smart pooling of mRNA samples in microarray experiments. BMC Bioinformatics, 11(1):299, 2010.
161. R. Keshavan, A. Montanari, and S. Oh. Matrix completion from a few entries. IEEE Trans Inform Theory, 56(6):2980-2998, 2010.
162. V. Kotelnikov. On the carrying capacity of the ether and wire in telecommunications. Izd Red Upr Svyazi RKKA, Moscow, Russia, 1933.
163. J. Kovačević and A. Chebira. Life beyond bases: The advent of frames (Part I). IEEE Sig Proc Mag, 24(4):86-104, 2007.
164. J. Kovačević and A. Chebira. Life beyond bases: The advent of frames (Part II). IEEE Sig Proc Mag, 24(4):115-125, 2007.
165. F. Krahmer and R. Ward. New and improved Johnson-Lindenstrauss embeddings via the restricted isometry property. SIAM J Math Anal, 43(3):1269-1281, 2011.
166. T. Kühn. A lower estimate for entropy numbers. J Approx Theory, 110(1):120-124, 2001.
167. C. La and M. Do. Signal reconstruction using sparse tree representation. Proc SPIE Optics Photonics: Wavelets, San Diego, CA, 2005.
168. C. La and M. Do. Tree-based orthogonal matching pursuit algorithm for signal reconstruction. IEEE Int Conf Image Proc (ICIP), Atlanta, GA, 2006.
169. J. Laska, P. Boufounos, M. Davenport, and R. Baraniuk. Democracy in action: Quantization, saturation, and compressive sensing. Appl Comput Harman Anal, 31(3):429-443, 2011.
170. J. Laska, M. Davenport, and R. Baraniuk. Exact signal recovery from corrupted measurements through the pursuit of justice. Proc Asilomar Conf Sign, Syste Compute, Pacific Grove, CA, 2009.
171. S. Levy and P. Fullagar. Reconstruction of a sparse spike train from a portion of its spectrum and application to high-resolution deconvolution. Geophysics, 46(9):1235-1243, 1981.
172. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995.
173. E. Livshitz. On efficiency of Orthogonal Matching Pursuit. Preprint, 2010.
174. B. Logan. Properties of high-pass signals. PhD thesis, Columbia University, 1965.
175. I. Loris. On the performance of algorithms for the minimization of l1-penalized functions. Inverse Problems, 25(3):035008, 2009.
176. H. Lu. Geometric theory of images. PhD thesis, University of California, San Diego, 1998.
177. Y. Lu and M. Do. Sampling signals from a union of subspaces. IEEE Sig Proce Mag, 25(2):41-47, 2008.
178. M. Lustig, D. Donoho, and J. Pauly. Rapid MR imaging with compressed sensing and randomly under-sampled 3DFT trajectories. Proc Ann Meeting of ISMRM, Seattle, WA, 2006.
179. M. Lustig, J. Lee, D. Donoho, and J. Pauly. Faster imaging with randomly perturbed, under-sampled spirals and l1 reconstruction. Proc Ann Meeting ISMRM, Miami, FL, 2005.
180. M. Lustig, J. Santos, J. Lee, D. Donoho, and J. Pauly. Application of compressed sensing for rapid MR imaging. Proc Work Struc Parc Rep Adap Sign (SPARS), Rennes, France, 2005.
181. D. Malioutov, M. Cetin, and A. Willsky. A sparse signal reconstruction perspective for source localization with sensor arrays. IEEE Trans Sign Proce, 53(8):3010-3022, 2005.
182. S. Mallat. A Wavelet Tour of Signal Processing. Academic Press, San Diego, CA, 1999.
183. S. Mallat and Z. Zhang. Matching pursuits with time-frequency dictionaries. IEEE Trans Sig Proc, 41(12):3397-3415, 1993.
184. R. Marcia, Z. Harmany, and R. Willett. Compressive coded aperture imaging. Proc IS&T/SPIE Symp Elec Imag: Comp Imag, San Jose, CA, 2009.
185. M. Mishali and Y. C. Eldar. Reduce and boost: Recovering arbitrary sets of jointly sparse vectors. IEEE Trans Sig Proc, 56(10):4692-4702, 2008.
186. M. Mishali and Y. C. Eldar. Blind multi-band signal reconstruction: Compressed sensing for analog signals. IEEE Trans Sig Proc, 57(3):993-1009, 2009.
187. M. Mishali and Y. C. Eldar. From theory to practice: Sub-Nyquist sampling of sparse wideband analog signals. IEEE J Select Top Sig Proc, 4(2):375-391, 2010.
188. M. Mishali, Y. C. Eldar, O. Dounaevsky, and E. Shoshan. Xampling: Analog to digital at sub-Nyquist rates. IET Circ Dev Syst, 5(1):8-20, 2011.
189. S. Muthukrishnan. Data Streams: Algorithms and Applications, Foundations and Trends in Theoretical Computer Science. Now Publishers, Boston, MA, 2005.
190. D. Needell and J. Tropp. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples. Appl Comput Harmon Anal, 26(3):301-321, 2009.
191. D. Needell and R. Vershynin. Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit. Found Comput Math, 9(3):317-334, 2009.
192. D. Needell and R. Vershynin. Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit. IEEE J Select Top Sig Proc, 4(2):310-316, 2010.
193. P. Niyogi. Manifold regularization and semi-supervised learning: Some theoretical analyses. Technical Report TR-2008-01, Univ. of Chicago, Comput Sci Dept., 2008.
194. J. Nocedal and S. Wright. Numerical Optimization. Springer-Verlag, 1999.
195. H. Nyquist. Certain topics in telegraph transmission theory. Trans AIEE, 47:617-644, 1928.
196. B. Olshausen and D. Field. Emergence of simple-cell receptive field properties by learning a sparse representation. Nature, 381:607-609, 1996.
197. S. Osher, Y. Mao, B. Dong, and W. Yin. Fast linearized Bregman iterations for compressive sensing and sparse denoising. Commun Math Sci, 8(1):93-111, 2010.
198. J. Partington. An Introduction to Hankel Operators. Cambridge University Press, Cambridge, 1988.
199. W. Pennebaker and J. Mitchell. JPEG Still Image Data Compression Standard. Van Nostrand Reinhold, 1993.
200. J. Phillips, R. Leahy, and J. Mosher. MEG-based imaging of focal neuronal current sources. IEEE Trans Med Imaging, 16(3):338-348, 1997.
201. R. Prony. Essai experimental et analytique sur les lois de la Dilatabilite des fluides elastiques et sur celles de la Force expansive de la vapeur de l’eau et de la vapeur de l’alkool, a differentes temperatures. J de lʼEcole Polytechnique, Floreal et Prairial III, 1(2):24-76, 1795. R. Prony is Gaspard Riche, baron de Prony.
202. B. Rao. Signal processing with the sparseness constraint. Proc IEEE Int Conf Acoust, Speech, Sig Proc (ICASSP), Seattle, WA, 1998.
203. B. Recht. A simpler approach to matrix completion. To appear in J. Machine Learning Rese, 12(12):3413-3430, 2011.
204. B. Recht, M. Fazel, and P. Parrilo. Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization. SIAM Rev, 52(3):471-501, 2010.
205. R. Robucci, L. Chiu, J. Gray, et al. Compressive sensing on a CMOS separable transform image sensor. Proc IEEE Int Conf Acoust, Speech, Sig Proc (ICASSP), Las Vegas, NV, 2008.
206. J. Romberg. Compressive sensing by random convolution. SIAM J Imag Sci, 2(4):1098-1128, 2009.
207. M. Rosenfeld. In praise of the Gram matrix, The Mathematics of Paul Erdos II, 318-323. Springer, Berlin, 1996.
208. K. Schnass and P. Vandergheynst. Average performance analysis for thresholding. IEEE Sig Proc Letters, 14(11):828-831, 2007.
209. C. Shannon. Communication in the presence of noise. Proc Inst Radio Engineers, 37(1):10-21, 1949.
210. N. Shental, A. Amir, and O. Zuk. Identification of rare alleles and their carriers using compressed se(que)nsing. Nucl Acids Res, 38(19):e179, 2009.
211. J. P. Slavinsky, J. Laska, M. Davenport, and R. Baraniuk. The compressive multiplexer for multi-channel compressive sensing. Proc IEEE Int Conf Acoust, Speech, Sig Proc (ICASSP), Prague, Czech Republic, 2011.
212. A. So and Y. Ye. Theory of semidefinite programming for sensor network localization. Math Programming, Series A B, 109(2):367-384, 2007.
213. C. Stein. Inadmissibility of the usual estimator for the mean of a multivariate normal distribution. Proc 3rd Berkeley Symp Math Statist Prob, 1: 197-206. University of California Press, Berkeley, 1956.
214. T. Strohmer and R. Heath. Grassmanian frames with applications to coding and communication. Appl Comput Harmon Anal, 14(3):257-275, 2003.
215. D. Taubman and M. Marcellin. JPEG 2000: Image Compression Fundamentals, Standards and Practice. Kluwer, 2001.
216. H. Taylor, S. Banks, and J. McCoy. Deconvolution with the l1 norm. Geophysics, 44(1):39-52, 1979.
217. J. Tenenbaum, V. de Silva, and J. Landford. A global geometric framework for nonlinear dimensionality reduction. Science, 290:2319-2323, 2000.
218. R. Tibshirani. Regression shrinkage and selection via the Lasso. J Roy Statist Soc B, 58(1):267-288, 1996.
219. J. Treichler, M. Davenport, and R. Baraniuk. Application of compressive sensing to the design of wideband signal acquisition receivers. Proc US/Australia Joint Work. Defense Apps of Signal Processing (DASP), Lihue, HI, 2009.
220. J. Tropp. Greed is good: Algorithmic results for sparse approximation. IEEE Trans Inform Theory, 50(10):2231-2242, 2004.
221. J. Tropp. Algorithms for simultaneous sparse approximation. Part II: Convex relaxation. Sig Proc, 86(3):589-602, 2006.
222. J. Tropp and A. Gilbert. Signal recovery from partial information via orthogonal matching pursuit. IEEE Trans Inform. Theory, 53(12):4655-4666, 2007.
223. J. Tropp, A. Gilbert, and M. Strauss. Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit. Sig Proc, 86(3):572-588, 2006.
224. J. Tropp, J. Laska, M. Duarte, J. Romberg, and R. Baraniuk. Beyond Nyquist: Efficient sampling of sparse, bandlimited signals. IEEE Trans Inform Theory, 56(1):520-544, 2010.
225. J. Tropp, M. Wakin, M. Duarte, D. Baron, and R. Baraniuk. Random filters for compressive sampling and reconstruction. Proc IEEE Int Conf Acoust, Speech, Sig Proc (ICASSP), Toulouse, France, 2006.
226. J. Tropp and S. Wright. Computational methods for sparse solution of linear inverse problems. Proc IEEE, 98(6):948-958, 2010.
227. J. Trzasko and A. Manduca. Highly undersampled magnetic resonance image reconstruction via homotopic fo-minimization. IEEE Trans Med Imaging, 28(1):106-121, 2009.
228. R. Tur, Y. C. Eldar, and Z. Friedman. Innovation rate sampling of pulse streams with application to ultrasound imaging. IEEE Trans Sig Proc, 59(4):1827-1842, 2011.
229. M. Turk and A. Pentland. Eigenfaces for recognition. J Cogni Neurosci, 3(1):71-86, 1991.
230. M. Unser. Sampling - 50 years after Shannon. Proc IEEE, 88(4):569-587, 2000.
231. E. van den Berg and M. Friedlander. Probing the Pareto frontier for basis pursuit solutions. SIAM J Sci Comp, 31(2):890-912, 2008.
232. E. van den Berg and M. Friedlander. Theoretical and empirical results for recovery from multiple measurements. IEEE Trans Inform Theory, 56(5):2516-2527, 2010.
233. B. Vandereycken and S. Vandewalle. Riemannian optimization approach for computing low-rank solutions of Lyapunov equations. Proc SIAM Conf Optimization, Boston, MA, 2008.
234. V. Vapnik. The Nature of Statistical Learning Theory. Springer-Verlag, New York, 1999.
235. R. Varga. Geršgorin and His Circles. Springer, Berlin, 2004.
236. S. Vasanawala, M. Alley, R. Barth, et al. Faster pediatric MRI via compressed sensing. Proc Ann Meeting Soc Pediatric Radiology (SPR), Carlsbad, CA, 2009.
237. R. Venkataramani and Y. Bresler. Further results on spectrum blind sampling of 2-D signals. Proc IEEE Int Conf Image Proc (ICIP), Chicago, IL, 1998.
238. R. Venkataramani and Y. Bresler. Perfect reconstruction formulas and bounds on aliasing error in sub-Nyquist nonuniform sampling of multiband signals. IEEE Trans Inform Theory, 46(6):2173-2183, 2000.
239. M. Vetterli, P. Marziliano, and T. Blu. Sampling signals with finite rate of innovation. IEEE Trans Sig Proc, 50(6):1417-1428, 2002.
240. M. Wakin, D. Donoho, H. Choi, and R. Baraniuk. The multiscale structure of non- differentiable image manifolds. Proc SPIE Optics Photonics: Wavelets, San Diego, CA, 2005.
241. R. Walden. Analog-to-digital converter survey and analysis. IEEE J Sel Areas Commun, 17(4):539-550, 1999.
242. C. Walker and T. Ulrych. Autoregressive recovery of the acoustic impedance. Geophysics, 48(10):1338-1350, 1983.
243. R. Ward. Compressive sensing with cross validation. IEEE Trans Inform Theory, 55(12):5773-5782, 2009.
244. K. Weinberger and L. Saul. Unsupervised learning of image manifolds by semidefinite programming. Int J Computer Vision, 70(1):77-90, 2006.
245. L. Welch. Lower bounds on the maximum cross correlation of signals. IEEE Trans Inform Theory, 20(3):397-399, 1974.
246. Z. Wen, W. Yin, D. Goldfarb, and Y. Zhang. A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization and continuation. SIAM J Sci Comput, 32(4):1832-1857, 2010.
247. E. Whittaker. On the functions which are represented by the expansions of the interpolation theory. Proc Roy Soc Edin Sec A, 35:181-194, 1915.
248. P. Wojtaszczyk. Stability and instance optimality for Gaussian measurements in compressed sensing. Found Comput Math, 10(1):1-13, 2010.
249. S. Wright, R. Nowak, and M. Figueiredo. Sparse reconstruction by separable approximation. IEEE Trans Sig Proc, 57(7):2479-2493, 2009.
250. A. Yang, S. Sastray, A. Ganesh, and Y. Ma. Fast l1 -minimization algorithms and an application in robust face recognition: A review. Proc IEEE Int Conf Image Proc (ICIP), Hong Kong, 2010.
251. W. Yin, S. Osher, D. Goldfarb, and J. Darbon. Bregman iterative algorithms for l1- minimization with applications to compressed sensing. SIAM J Imag Sci, 1(1):143-168, 2008.
252. Z. Yu, S. Hoyos, and B. Sadler. Mixed-signal parallel compressed sensing and reception for cognitive radio. Proc IEEE Int Conf Acoust, Speech, Sig Proc (ICASSP), Las Vegas, NV, 2008.
253. M. Yuan and Y. Lin. Model selection and estimation in regression with grouped variables. J Roy Stat Soc Ser B, 68(1):49-67, 2006.
254. T. Zhang. Sparse recovery with Orthogonal Matching Pursuit under RIP. IEEE Trans Inform Theory, 59(9):6125-6221, 2011.