Recently, a new direction in signal processing — “Compressed Sensing” is being actively developed. A number of authors have pointed out a connection between the Compressed Sensing problem and the problem of estimating the Kolmogorov widths, studied in the seventies and eighties of the last century. In this paper we make the above mentioned connection more precise.
Key wordscompressed sensing signal processing Kolmogorov width Gelfand width sparsity restricted isometry property combinatorial optimization problem
Unable to display preview. Download preview PDF.
- 3.E. J. Candes, “Compressive sampling,” in International Congress of Mathematicians, Madrid, Spain, August 22–30, 2006 (Eur. Math. Soc., Zürich, 2006), Vol. 3, pp. 1433–1452.Google Scholar
- 4.R. DeVore, “Optimal computation,” in International Congress of Mathematicians, Madrid, Spain, August 22–30, 2006 (Eur. Math. Soc., Zürich, 2006), Vol. 1, pp. 187–215.Google Scholar
- 6.A. Cohen, W. Dahmen, and R. DeVore, Compressed Sensing and k-Term Approximation (Manuscript, 2007).Google Scholar