Abstract
The analysis presented so far presents a simple but limited portrait of the ability of concrete algorithms to find sparse solutions and near-solutions. In this chapter we briefly point to the interesting and challenging research territory that lies beyond these worst-case results. We start with some simple simulations to motivate this discussion.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Further Reading
E.J. Candès and J. Romberg, Practical signal recovery from random projections, in Wavelet XI, Proc. SPIE Conf. 5914, 2005.
E.J. Candès, J. Romberg, and T. Tao, Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information, IEEE Trans. On Information Theory, 52(2):489–509, 2006.
E. Candès, J. Romberg, and T. Tao, Quantitative robust uncertainty principles and optimally sparse decompositions, to appear in Foundations of Computational Mathematics.
E. Candès, J. Romberg, and T. Tao, Stable signal recovery from incomplete and inaccurate measurements, to appear in Communications on Pure and Applied Mathematics.
E.J. Candès and T. Tao, Decoding by linear programming, IEEE Trans. on Information Theory, 51(12):4203–4215, December 2005.
D.L. Donoho, For most large underdetermined systems of linear equations, the minimal ℓ1-norm solution is also the sparsest solution, Communications on Pure and Applied Mathematics, 59(6):797–829, June 2006.
D.L. Donoho, For most large underdetermined systems of linear equations, the minimal-norm near-solution approximates the sparsest near-solution, Communications on Pure and Applied Mathematics, 59(7):907–934, July 2006.
D.L. Donoho and J. Tanner, Neighborliness of randomly-projected simplices in high dimensions, Proceedings of the National Academy of Sciences, 102(27):9452–9457, March 2005.
D.L. Donoho and J. Tanner, Counting faces of randomly-projected polytopes when the projection radically lowers dimension, Journal of the AMS, 22(1):1–53, 2009.
M. Elad, Sparse representations are most likely to be the sparsest possible, EURASIP Journal on Applied Signal Processing, Paper No. 96247, 2006.
B. Kashin, The widths of certain finite-dimensional sets and classes of smooth functions, Izv. Akad. Nauk SSSR Ser. Mat., 41, pp. 334–351, 1977.
S. Mendelson, A. Pajor, and N. Tomczak-Jaegermann, Uniform uncertainty principle for Bernoulli and subgaussian ensembles, to appear in Constructive Approximation, 28(3):277–289, December 2008.
S. Mendelson, A. Pajor, and N. Tomczak-Jaegermann, Reconstruction and subgaussian processes, Comptes Rendus Mathematique, 340(12):885–888, 2005.
K. Schnass and P. Vandergheynst, Average performance analysis for thresholding, IEEE Signal Processing Letters, 14(11):828–831, November 2007.
S. Szarek, Condition number of random matrices, J. Complexity, 7, pp. 131–149, 1991.
S. Szarek, Spaces with large distance to ℓ1 and random matrices, Amer. J. Math., 112:899–942, 1990.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Elad, M. (2010). Towards Average PerformanceAnalysis. In: Sparse and Redundant Representations. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-7011-4_7
Download citation
DOI: https://doi.org/10.1007/978-1-4419-7011-4_7
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-7010-7
Online ISBN: 978-1-4419-7011-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)