# zbMATH — the first resource for mathematics

An introduction to compressed sensing. (English) Zbl 07217984
Boche, Holger (ed.) et al., Compressed sensing and its applications. Selected papers of the third international MATHEON conference, TU Berlin, Berlin, Germany, December 4–8, 2017. Cham: Birkhäuser (ISBN 978-3-319-73073-8/hbk; 978-3-319-73074-5/ebook). Applied and Numerical Harmonic Analysis, 1-65 (2019).
Compressed sensing has many applications in different areas of expertise. One of them is signal processing of low-complexity structures, namely, sparse or compressible signals. This paper is an in depth introduction to the most important results in this field. This introduction starts with the basic notions i.e. norms, sparse and compressible vectors together with the block and group sparse vectors, and low rank matrices. The exact recovery of sparse vectors is then discussed. The introduction is also equipped with connections to conic integral geometry – another way to approach the sparse recovery problem. Then, the measurement matrices are discussed, namely, their characterization and probabilistic methods of their construction. Finally, the review of the commonly known reconstruction methods together with their pseudocode is a great add-on to the presented theory.
This introduction aims to provide an overall view of the most important results in compressed sensing. However, there is the lack of discussion of deterministic matrix generation approaches. On the other hand, the inclusion of the connection between sparse recovery and conic integral geometry makes this introduction unique.
For the entire collection see [Zbl 1427.94002].
##### MSC:
 94A12 Signal theory (characterization, reconstruction, filtering, etc.)
##### Software:
CVX; CVXPY; L1-MAGIC; NESTA; SPGL1
Full Text:
##### References:
 [1] S.I. Adalbjörnsson, A. Jakobsson, M.G. Christensen. Estimating multiple pitches using block sparsity, in 2013 IEEE International Conference on Acoustics, Speech and Signal Processing (May 2013), pp. 6220-6224 [2] R. Adamczak, R. Latała, A.E. Litvak, A. Pajor, N. Tomczak-Jaegermann, Geometry of log-concave ensembles of random matrices and approximate reconstruction. C. R. Math. 349(13), 783-786 (2011) · Zbl 1225.60013 [3] R. Adamczak, A.E. Litvak, A. Pajor, N. Tomczak-Jaegermann, Restricted isometry property of matrices with independent columns and neighborly polytopes by random sampling. Constr. Approx. 34(1), 61-88 (2011) · Zbl 1222.52009 [4] D. Amelunxen, M. Lotz, M.B. McCoy, J.A. Tropp, Living on the edge: phase transitions in convex programs with random data. Inf. Inference 3(3), 224-294 (2014) · Zbl 1339.90251 [5] U. Ayaz, S. Dirksen, H. Rauhut, Uniform recovery of fusion frame structured sparse signals. Appl. Comput. Harmon. Anal. 41(2), 341-361 (2016) · Zbl 1360.94061 [6] W.U. Bajwa, J.D. Haupt, G.M. Raz, S.J. Wright, R.D. Nowak, Toeplitz-structured compressed sensing matrices, in 2007 IEEE/SP 14th Workshop on Statistical Signal Processing (Aug. 2007), pp. 294-298 [7] A.S. Bandeira, M.E. Lewis, D.G. Mixon, Discrete Uncertainty Principles and Sparse Signal Processing. J. Fourier Anal. Appl. 24(4), 935-956 (2018) · Zbl 1416.42006 [8] R. Baraniuk, M. Davenport, R. DeVore, M. Wakin, A simple proof of the restricted isometry property for random matrices. Constr. Approx. 28(3), 253-263 (2008) · Zbl 1177.15015 [9] A. Beck, M. Teboulle, A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2, 183-202 (2009) · Zbl 1175.94009 [10] S. Becker, J. Bobin, E.J. Candès, Nesta: A fast and accurate first-order method for sparse recovery. SIAM J. Imaging Sci. 4, 1-39 (2011) · Zbl 1209.90265 [11] J. Bennett, S. Lanning, The netflix prize (2007) [12] R. Berinde, A.C. Gilbert, P. Indyk, H. Karloff, M.J. Strauss, Combining geometry and combinatorics: a unified approach to sparse signal recovery, in 2008 46th Annual Allerton Conference on Communication, Control, and Computing (Sept. 2008), pp. 798-805 [13] B.N. Bhaskar, G. Tang, B. Recht, Atomic norm denoising with applications to line spectral estimation. IEEE Trans. Signal Process. 61(23), 5987-5999 (2011) · Zbl 1394.94079 [14] H. Boche, Compressed Sensing and its Applications (Springer Science+Business Media, New York, 2015) [15] P. Boufounos, G. Kutyniok, H. Rauhut, Sparse recovery from combined fusion frame measurements. IEEE Trans. Inf. Theory 57(6), 3864-3876 (2011) · Zbl 1365.94066 [16] P.T. Boufounos, L. Jacques, F. Krahmer, R. Saab, Quantization and compressive sensing, in Compressed Sensing and its Applications: MATHEON Workshop 2013, Applied and Numerical Harmonic Analysis, ed. by H. Boche, R. Calderbank, G. Kutyniok, J. Vybíral (Springer International Publishing, Cham, 2015), pp. 193-237 · Zbl 1333.94016 [17] J. Bourgain, An Improved Estimate in the Restricted Isometry Problem, in Geometric Aspects of Functional Analysis, vol. 2116, ed. by B. Klartag, E. Milman (Springer International Publishing, Cham, 2014), pp. 65-70 · Zbl 1323.46009 [18] S. Boyd, L. Vandenberghe, Convex Optimization (Cambridge University Press, 2004) · Zbl 1058.90049 [19] E. Candes, J. Romberg, l1-magic: recovery of sparse signals via convex programming, vol. 4 (2005), p. 14. www.acm.caltech.edu/l1magic/downloads/l1magic.pdf [20] E. Candes, T. Tao, The Dantzig selector: statistical estimation when p is much larger than n. Ann. Stat. 35(6), 2313-2351 (2007) · Zbl 1139.62019 [21] E.J. Candès, The restricted isometry property and its implications for compressed sensing. C. R. Math. 346(9), 589-592 (2008) · Zbl 1153.94002 [22] E.J. Candes, D.L. Donoho, Curvelets-a surprisingly effective nonadaptive representation for objects with edges, in Curves and Surfaces Fitting, ed. by L.L. Schumaker, A. Cohen, C. Rabut (Vanderbilt University Press, Nashville, TN, 1999), p. 16 [23] E.J. Candès, D.L. Donoho, New tight frames of curvelets and optimal representations of objects with piecewise c2 singularities. Commun. Pure Appl. Math. J. Issued Courant Inst. Math. Sci. 57(2), 219-266 (2004) · Zbl 1038.94502 [24] E.J. Candes, Y. Plan, Near-ideal model selection by $$\ell_1$$ minimization. Ann. Stat. 37, 2145-2177 (2009) · Zbl 1173.62053 [25] E.J. Candès, J.K. Romberg, T. Tao, Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52, 489-509 (2006) · Zbl 1231.94017 [26] E.J. Candès, J.K. Romberg, T. Tao, Stable signal recovery from incomplete and inaccurate measurements. Commun. Pure Appl. Math. 59(8), 1207-1223 (2006) · Zbl 1098.94009 [27] E.J. Candes, T. Tao, Decoding by linear programming. IEEE Trans. Inf. Theory 51(12), 4203-4215 (2005) · Zbl 1264.94121 [28] E.J. Candès, T. Tao, Near-optimal signal recovery from random projections: universal encoding strategies? IEEE Trans. Inf. Theory 52(12), 5406-5425 (2006) · Zbl 1309.94033 [29] A.Y. Carmi, L. Mihaylova, S.J. Godsill, Compressed Sensing & Sparse Filtering (Springer, 2016) · Zbl 1316.94023 [30] P.G. Casazza, G. Kutyniok, F. Philipp, Introduction to finite frame theory, in Finite Frames (Springer, 2013), pp. 1-53 · Zbl 1281.42032 [31] V. Chandrasekaran, B. Recht, P.A. Parrilo, A.S. Willsky, The convex geometry of linear inverse problems. Found. Comput. Math. 12(6), 805-849 (2012) · Zbl 1280.52008 [32] M. Cheraghchi, V. Guruswami, A. Velingker, Restricted isometry of Fourier matrices and list decodability of random linear codes. SIAM J. Comput. 42(5), 1888-1914 (2013) · Zbl 1321.94122 [33] A. Cohen, W. Dahmen, R. Devore, Compressed sensing and best k-term approximation. J. Am. Math. Soc. 211-231 (2009) · Zbl 1206.94008 [34] R. Coifman, F. Geshwind, Y. Meyer, Noiselets. Appl. Comput. Harmon. Anal. 10(1), 27-44 (2001) · Zbl 1030.42027 [35] W. Dai, O. Milenkovic, Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans. Inf. Theory 55, 2230-2249 (2009) · Zbl 1367.94082 [36] S. Dasgupta, A. Gupta, An elementary proof of a theorem of Johnson and Lindenstrauss. Random Struct. Algorithms 22(1), 60-65 (2003) · Zbl 1018.51010 [37] R.A. DeVore, Nonlinear approximation. Acta Numer. 7, 51-150 (1998) · Zbl 0931.65007 [38] S. Diamond, S. Boyd, Cvxpy: a python-embedded modeling language for convex optimization. J. Mach. Learn. Res. 17(1), 2909-2913 (2016) · Zbl 1360.90008 [39] S. Dirksen, G. Lecué, H. Rauhut, On the gap between restricted isometry properties and sparse recovery conditions. IEEE Trans. Inf. Theory 64(8), 5478-5487 (2018) · Zbl 1401.94031 [40] D.L. Donoho, Compressed sensing. IEEE Trans. Inf. Theory 52, 1289-1306 (2006) · Zbl 1288.94016 [41] D.L. Donoho, M. Elad, Optimally sparse representation in general (nonorthogonal) dictionaries via $$\ell_1$$ minimization. Proc. Natl. Acad. Sci. 100(5), 2197-2202 (2003) · Zbl 1064.94011 [42] D.L. Donoho, M. Elad, V.N. Temlyakov, Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Trans. Inf. Theory 52, 6-18 (2006) · Zbl 1288.94017 [43] D.L. Donoho, I. Johnstone, A. Montanari, Accurate prediction of phase transitions in compressed sensing via a connection to minimax denoising. IEEE Trans. Inf. Theory 59, 3396-3433 (2013) · Zbl 1364.94092 [44] D.L. Donoho, A. Maleki, A. Montanari, Message passing algorithms for compressed sensing. Proc. Natl. Acad. Sci. U. S. A. 106(45), 18914-9 (2009) [45] D.L. Donoho, J. Tanner, Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing. Philos. Trans. Ser. A Math. Phys. Eng. Sci. 367 (1906), 4273-4293 (2009) · Zbl 1185.94029 [46] M. Elad, Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing. (Springer, New York, 2010). OCLC: ocn646114450 · Zbl 1211.94001 [47] Y.C. Eldar, G. Kutyniok (eds.), Compressed Sensing: Theory and Applications (Cambridge University Press, Cambridge, 2012) [48] E. Elhamifar, R. Vidal, Sparse subspace clustering, in 2009 IEEE Conference on Computer Vision and Pattern Recognition (June 2009), pp. 2790-2797 [49] H.G. Feichtinger, T. Strohmer, Gabor Analysis and Algorithms: Theory and Applications (Springer Science & Business Media, 2012) · Zbl 0890.42004 [50] M. Fornasier, S. Peter, An overview on algorithms for sparse recovery, in Sparse Reconstruction and Compressive Sensing in Remote Sensing, ed. by X. Zhu, R. Bamler (Springer, June 2015), p. 76 [51] M. Fornasier, H. Rauhut, Compressive sensing, in Handbook of Mathematical Methods in Imaging, ed. by O. Scherzer (Springer, New York, 2011), pp. 187-228. https://doi.org/10.1007/978-0-387-92920-0_6 · Zbl 1259.94017 [52] S. Foucart, Flavors of compressive sensing, in Approximation Theory XV: San Antonio 2016, ed. by G.E. Fasshauer, L.L. Schumaker (Springer International Publishing, Cham, 2017), pp. 61-104 · Zbl 1391.94211 [53] S. Foucart, A. Pajor, H. Rauhut, T. Ullrich, The Gelfand widths of $$\ell_p$$-balls for \(0
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.