General Framework of Compressive Sampling and its Applications for Signal and Image Compression

DOI
10.15415/jtmge.2015.61001

AUTHORS

Prabhat Thakur 

ABSTRACT

Compressive sampling emerged as a very useful random protocol and has become an active research area for almost a decade. Compressive sampling allows us to sample a signal below Shannon Nyquist rate and assures its successful reconstruction if the signal is sparse. In this paper we used compressive sampling for arbitrary signal and image compression and successfully reconstructed them by solving l1 norm optimization problem. We also showed that compressive sampling can be implemented if signal is sparse and incoherent through simulations.

KEYWORDS

Basis Function,Compressive Sampling, Incoherent Signal, l1-norm, Sparse Signal.

REFERENCES

  • Simon Haykin (2001) “Communication Systems”, 4th ed. NewYork:John Wiley and Sons.
  • D. Donoho (2006) “Compressed Sensing”, IEEE Trans. Inform. Theory, Vol. 52:4, pp. 1289-1306. http://dx.doi.org/10.1109/TIT.2006.871582.
  • E. Candès, J. Romberg, and T. Tao (2006) “Robust Uncertainty Principles: Exact Signal Reconstruction from Highly Incomplete Frequency Information,” IEEE Trans. Inform.Theory, Vol. 52:2, pp. 489–509.
  • E.J.Candes (2006) “Compressive sampling,”in Proceedings of the International Congress of Mathematicians, Vol. 3, pp. 1433– 1452.
  • J. Tropp and A.C. Gilbert (2007) “Signal Recovery from Partial Information Via Orthogonal Matching Pursuit,” IEEE Trans. Inform. Theory, Vol. 53:12, pp. 4655- 4666.
  • Emmanuel Cand`es and Terence Tao (2005) “Decoding by Linear Programming. IEEE Trans. Inform. Theory, Vol 51:12, pp.4203–4215. http://dx.doi.org/10.1109/TIT.2005.858979.
  • Scott Shaobing Chen, David L. Donoho, and Michael A. Saunders (1999) “Atomic Decomposition By Basis Pursuit. SIAM J. Sci Comp., 20:1, pp. 33–61.
  • E. Candès and J. Romberg (2007) “Sparsity and Incoherence in Compressive Sampling,” Inverse Prob., Vol. 23:3, pp. 969–985.

RNI Registration No. CHAENG/2016/68678