Stojnic, Mihailo and Xu, Weiyu and Hassibi, Babak
(2008)
*Compressed sensing of approximately sparse signals.*
In:
IEEE International Symposium on Information Theory, 2008. ISIT 2008.
IEEE
, Piscataway, NJ, pp. 2182-2186.
ISBN 978-1-4244-2256-2.
https://resolver.caltech.edu/CaltechAUTHORS:20150224-075138435

PDF
- Published Version
See Usage Policy. 242kB |

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20150224-075138435

## Abstract

It is well known that compressed sensing problems reduce to solving large under-determined systems of equations. If we choose the compressed measurement matrix according to some appropriate distribution and the signal is sparse enough the l1 optimization can exactly recover the ideally sparse signal with overwhelming probability by Candes, E. and Tao, T., [2], [1]. In the current paper, we will consider the case of the so-called approximately sparse signals. These signals are a generalized version of the ideally sparse signals. Letting the zero valued components of the ideally sparse signals to take the values of certain small magnitude one can construct the approximately sparse signals. Using a different but simple proof technique we show that the claims similar to those of [2] and [1] related to the proportionality of the number of large components of the signals to the number of measurements, hold for approximately sparse signals as well. Furthermore, using the same technique we compute the explicit values of what this proportionality can be if the compressed measurement matrix A has a rotationally invariant distribution of the null-space. We also give the quantitative tradeoff between the signal sparsity and the recovery robustness of the l_1 minimization. As it will turn out in an asymptotic case of the number of measurements the threshold result of [1] corresponds to a special case of our result.

Item Type: | Book Section | |||||||||
---|---|---|---|---|---|---|---|---|---|---|

Related URLs: |
| |||||||||

Additional Information: | © 2008 IEEE. This work was supported in part by the National Science Foundation under grant no. CCR-0133818, by the David and Lucille Packard Foundation, and by Caltech’s Lee Center for Advanced Networking. | |||||||||

Funders: |
| |||||||||

DOI: | 10.1109/ISIT.2008.4595377 | |||||||||

Record Number: | CaltechAUTHORS:20150224-075138435 | |||||||||

Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20150224-075138435 | |||||||||

Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | |||||||||

ID Code: | 55138 | |||||||||

Collection: | CaltechAUTHORS | |||||||||

Deposited By: | Shirley Slattery | |||||||||

Deposited On: | 24 Feb 2015 21:48 | |||||||||

Last Modified: | 10 Nov 2021 20:42 |

Repository Staff Only: item control page