%0 Book Section %1 elad10_07 %A Elad, Michael %B Sparse and Redundant Representations %D 2010 %I Springer New York %K Sparse.and.Redundant.Representations compressed.sensing %P 137-151 %R 10.1007/978-1-4419-7011-4_7 %T 07. Towards Average PerformanceAnalysis %X 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. %@ 978-1-4419-7010-7

@inbook{elad10_07, 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.}, added-at = {2013-06-22T08:53:03.000+0200}, author = {Elad, Michael}, biburl = {https://www.bibsonomy.org/bibtex/21b7ee6c4c7d7bc99270291b9414aa878/ytyoun}, booktitle = {Sparse and Redundant Representations}, doi = {10.1007/978-1-4419-7011-4_7}, interhash = {038d2f3e2d335038a27efc21e9ca6cf1}, intrahash = {1b7ee6c4c7d7bc99270291b9414aa878}, isbn = {978-1-4419-7010-7}, keywords = {Sparse.and.Redundant.Representations compressed.sensing}, language = {English}, pages = {137-151}, publisher = {Springer New York}, timestamp = {2013-06-22T17:52:31.000+0200}, title = {07. Towards Average PerformanceAnalysis}, year = 2010 }