# Extensions of compressed sensing

@article{Tsaig2006ExtensionsOC, title={Extensions of compressed sensing}, author={Y. Tsaig and D. Donoho}, journal={Signal Process.}, year={2006}, volume={86}, pages={549-571} }

We study the notion of compressed sensing (CS) as put forward by Donoho, Candes, Tao and others. The notion proposes a signal or image, unknown but supposed to be compressible by a known transform, (e.g. wavelet or Fourier), can be subjected to fewer measurements than the nominal number of data points, and yet be accurately reconstructed. The samples are nonadaptive and measure 'random' linear combinations of the transform coefficients. Approximate reconstruction is obtained by solving for the… Expand

#### Figures and Topics from this paper

#### 796 Citations

Combinatorial Algorithms for Compressed Sensing

- Computer Science
- 2006 40th Annual Conference on Information Sciences and Systems
- 2006

109- PDF

Practical compressed sensing with log-of-prime projections

- Mathematics, Computer Science
- 2009 43rd Annual Conference on Information Sciences and Systems
- 2009

Construction of compressed sensing matrices for signal processing

- Computer Science
- Multimedia Tools and Applications
- 2018

1

#### References

SHOWING 1-10 OF 47 REFERENCES

Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?

- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 2006

6,170- PDF

Recovery of exact sparse representations in the presence of bounded noise

- Computer Science, Mathematics
- IEEE Transactions on Information Theory
- 2005

308- PDF

Stable recovery of sparse overcomplete representations in the presence of noise

- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 2006

2,074- PDF

Stable signal recovery from incomplete observations

- Computer Science, Engineering
- SPIE Optics + Photonics
- 2005

24

For most large underdetermined systems of equations, the minimal 1-norm near-solution approximates the sparsest near-solution

- Mathematics
- 2006

1,097- PDF

JUST RELAX: CONVEX PROGRAMMING METHODS FOR SUBSET SELECTION AND SPARSE APPROXIMATION

- Mathematics
- 2004

194- PDF

Uncertainty principles and ideal atomic decomposition

- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 2001

1,891- PDF