# An Introduction To Compressive Sampling

@article{Cands2008AnIT, title={An Introduction To Compressive Sampling}, author={Emmanuel J. Cand{\`e}s and Michael B. Wakin}, journal={IEEE Signal Processing Magazine}, year={2008}, volume={25}, pages={21-30} }

Conventional approaches to sampling signals or images follow Shannon's theorem: the sampling rate must be at least twice the maximum frequency present in the signal (Nyquist rate). In the field of data conversion, standard analog-to-digital converter (ADC) technology implements the usual quantized Shannon representation - the signal is uniformly sampled at or above the Nyquist rate. This article surveys the theory of compressive sampling, also known as compressed sensing or CS, a novel sensing…

## 8,637 Citations

Compressive Sampling of Image and its comparison with JPEG Compressed Image

- Computer Science
- 2010

This report surveys the theory of compressive sampling, also known as compressed sensing or CS, a novel sensing/sampling paradigm that goes against the common wisdom in data acquisition that asserts that one can recover certain signals and images from far fewer samples or measurements than traditional methods use.

Demystifying Compressive Sensing [Lecture Notes]

- Computer ScienceIEEE Signal Processing Magazine
- 2017

The theory of compressive sensing/sampling (CS) presents a sampling framework based on the rate of information of a signal and not the bandwidth, thereby minimizing redundancy during sampling.

Recent Advances in Compressive Sensing

- Computer Science
- 2015

This paper presents a brief historical background, mathematical foundation, and a theory behind compressive sensing and its emerging applications with a special emphasis on communication, network design, signal processing, and image processing.

Compressive Video Sensing: Algorithms, architectures, and applications

- Computer ScienceIEEE Signal Processing Magazine
- 2017

The design of conventional sensors is based primarily on the Shannon?Nyquist sampling theorem, which states that a signal of bandwidth W Hz is fully determined by its discrete time samples provided…

CS-Video : Algorithms , Architectures , and Applications for Compressive Video Sensing

- Computer Science
- 2017

Compressive sensing (CS) is a powerful sensing paradigm that seeks to alleviate the daunting sampling rate requirements imposed by the Shannon-Nyquist principle.

Compressive Sampling Techniques for Integrating Video Acquisition and Coding

- Computer Science
- 2010

In this paper a simulation of an efficient system for integrating video coding/compression with acquisition through compressive sampling is developed in detail and simulation is implemented for the Y-components of video frames and qualitative comparison is done with traditionally acquired frames.

Compressive sensing

- Computer ScienceCISS
- 2008

This paper overviews the recent work on compressive sensing, a new approach to data acquisition in which analog signals are digitized for processing not via uniform sampling but via measurements…

Compressive Sampling Using EM Algorithm

- Computer ScienceArXiv
- 2014

This work proposes a naive approach which has certain computational difficulties and subsequently modify it to a new approach which performs better than the conventional methods of compressive sampling using EM algorithm.

Sparse Signal Processing

- Computer Science
- 2014

In this chapter, an overview of compressed sensing, together with a summary of its popular recovery techniques, is presented and as a well-known example of structured sparsity, the block sparse recovery problem is investigated and the related recovery approaches are illustrated.

## References

SHOWING 1-10 OF 40 REFERENCES

Signal Reconstruction From Noisy Random Projections

- Computer Science, EngineeringIEEE Transactions on Information Theory
- 2006

A practical iterative algorithm for signal reconstruction is proposed, and potential applications to coding, analog-digital (A/D) conversion, and remote wireless sensing are discussed.

Compressed sensing

- MathematicsIEEE Transactions on Information Theory
- 2006

It is possible to design n=O(Nlog(m)) nonadaptive measurements allowing reconstruction with accuracy comparable to that attainable with direct knowledge of the N most important coefficients, and a good approximation to those N important coefficients is extracted from the n measurements by solving a linear program-Basis Pursuit in signal processing.

Spectrum-blind minimum-rate sampling and reconstruction of multiband signals

- Mathematics1996 IEEE International Conference on Acoustics, Speech, and Signal Processing Conference Proceedings
- 1996

We propose a universal sampling pattern and corresponding reconstruction algorithms that guarantee well-conditioned reconstruction of all multiband signals with a given spectral occupancy bound…

Distributed Compressed Sensing Dror

- Computer Science
- 2005

A new theory for distributed compressed sensing (DCS) is introduced that enables new distributed coding algorithms for multi-signal ensembles that exploit both intraand inter-Signal correlation structures.

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

- Computer ScienceIEEE Transactions on Information Theory
- 2006

If the objects of interest are sparse in a fixed basis or compressible, then it is possible to reconstruct f to within very high accuracy from a small number of random measurements by solving a simple linear program.

Compressed sensing and best k-term approximation

- Mathematics, Computer Science
- 2008

The typical paradigm for obtaining a compressed version of a discrete signal represented by a vector x ∈ R is to choose an appropriate basis, compute the coefficients of x in this basis, and then…

Sparsity and incoherence in compressive sampling

- Computer Science
- 2007

It is shown that ‘1 minimization recovers x 0 exactly when the number of measurements exceeds m Const ·µ 2 (U) ·S · logn, where S is the numberof nonzero components in x 0, and µ is the largest entry in U properly normalized: µ(U) = p n · maxk,j |Uk,j|.

Rapid MR Imaging with "Compressed Sensing" and Randomly Under-Sampled 3DFT Trajectories

- Computer Science
- 2004

A method to evaluate the effective randomness of a randomly under-sampled trajectory by analyzing the statistics of aliasing in the sparse transform domain is provided and a 5fold scan time reduction is demonstrated.

Stable signal recovery from incomplete and inaccurate measurements

- Computer Science
- 2005

It is shown that it is possible to recover x0 accurately based on the data y from incomplete and contaminated observations.

Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements

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

The first guarantees for universal measurements (i.e. which work for all sparse functions) with reasonable constants are proved, based on the technique of geometric functional analysis and probability in Banach spaces.