Skip to main content
Log in

A modified column block Toeplitz matrix for compressed sensing

  • Original Paper
  • Published:
Signal, Image and Video Processing Aims and scope Submit manuscript

Abstract

In block-sparse-based compressed sensing, a block of indices is recovered from a non-adaptive random sample, which requires less computational time. Nonetheless, high-dimensional signals demand large storage spaces for sensing matrices in signal reconstruction. In this paper, a modified block sensing matrix is constructed from an initial dense submatrix. Its elements are drawn from an identically independent random Gaussian distribution. The full sensing matrix is not required in all intermediate computations. And, the required subset of sub-matrices can be generated at any stage of computation. It requires less storage space. The natural signal-like image does not exhibit any block-sparse property. In this paper, such signals are turned into blocks of sparse signals with suitable arrangements. The proposed sensing matrix provides efficient recovery of block-sparse signals using the proposed modified block orthogonal matching pursuit (MEBOMP) algorithm with proper adjustment. The results and analysis show the better performance of the proposed methods over other sensing matrices.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Emmanuel J Candès et al.: Compressive sampling. In: Proceedings of the International Congress of Mathematicians, Vol. 3, pp. 1433–1452. Madrid, Spain (2006)

  2. Candès, E.J., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52(2), 489–509 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cotter, S.F., Rao, B.D., Engan, K., Kreutz-Delgado, K.: Sparse solutions to linear inverse problems with multiple measurement vectors. IEEE Trans. Signal Process. 53(7), 2477–2488 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chen, Jie, Huo, Xiaoming: Theoretical results on sparse representations of multiple-measurement vectors. IEEE Trans. Signal Process. 54(12), 4634–4643 (2006)

    Article  MATH  Google Scholar 

  5. Mishali, M., Eldar, Y.C.: Reduce and boost: recovering arbitrary sets of jointly sparse vectors. IEEE Trans. Signal Process. 56(10), 4692–4702 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Mishali, M., Eldar, Y.C.: Blind multiband signal reconstruction: compressed sensing for analog signals. IEEE Trans. Signal Process. 57(3), 993–1009 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Mishali, M., Eldar, Y.C.: From theory to practice: sub-nyquist sampling of sparse wideband analog signals. IEEE J. Sel. Top Signal Process. 4(2), 375–391 (2010)

    Article  Google Scholar 

  8. Eldar, Y.C., Mishali, M.: Robust recovery of signals from a structured union of subspaces. IEEE Trans. Inf. Theory 55(11), 5302–5316 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  9. Tropp, J.A., Gilbert, A.C.: Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans. Inf. Theory 53(12), 4655–4666 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Donoho, D.L., Tsaig, Y., Drori, I., Starck, J.L.: Sparse solution of underdetermined systems of linear equations by stagewise orthogonal matching pursuit. IEEE Trans. Inf. Theory 58(2), 1094–1121 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  11. Xia, C.Y., Gao, Y.X., Yu, J., Yu, Z.H.: Block-sparse signal recovery based on orthogonal matching pursuit via stage-wise weak selection. SIViP 14(1), 97–105 (2020)

    Article  Google Scholar 

  12. Eldar, Y.C., Bolcskei, H.: Block-sparsity: coherence and efficient recovery. In: 2009 IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 2885–2888. IEEE (2009)

  13. Eldar, Y.C., Kuppinger, P., Bolcskei, H.: Block-sparse signals: uncertainty relations and efficient recovery. IEEE Trans. Signal Process. 58(6), 3042–3054 (2010)

  14. Huang, Anmin, Guan, Gui, Wan, Qun, Mehbodniya, Abolfazl: A block orthogonal matching pursuit algorithm based on sensing dictionary. Int. J. Phys. Sci. 6(5), 992–999 (2011)

    Google Scholar 

  15. Cui, Yupeng, Wenbo, Xu., Tian, Yun, Lin, Jiaru: Perturbed block orthogonal matching pursuit. Electron. Lett. 54(22), 1300–1302 (2018)

  16. Shamsi, M., Rezaii, T.Y., Tinati, M.A., Rastegarnia, A., Khalili, A.: Block sparse signal recovery in compressed sensing: optimum active block selection and within-block sparsity order estimation. Circuits Systems Signal Process. 37(4), 1649–1668 (2018)

    Article  MathSciNet  Google Scholar 

  17. Feng, J.M., Krahmer, F., Saab, R., Quantized compressed sensing for partial random circulant matrices. In: 2017 International Conference on Sampling Theory and Applications (SampTA), pp. 236–240. IEEE (2017)

  18. Lin, Y.M., Zhang, J.F., Geng, J., Wu, A.Y.A.: Structural scrambling of circulant matrices for cost-effective compressive sensing. J. Signal Process. Syst. 90(5), 695–707 (2018)

    Article  Google Scholar 

  19. Salahdine, F., Kaabouch, N., El Ghazi, H.: Bayesian compressive sensing with circulant matrix for spectrum sensing in cognitive radio networks. In: 2016 IEEE 7th Annual Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON), pp. 1–6. IEEE (2016)

  20. Wen, Jinming, Chen, Huangke, Zhou, Zhengchun: An optimal condition for the block orthogonal matching pursuit algorithm. IEEE Access 6, 38179–38185 (2018)

    Article  Google Scholar 

  21. Sebert, F., Ying, L., Zou. Y.M.:Toeplitz block matrices in compressed sensing. arXiv preprint arXiv:0803.0755 (2008)

  22. USC-SIPI Image Database. http://sipi.usc.edu/database/. Accessed: 2020-08-5

  23. Huynh-Thu, Quan, Ghanbari, Mohammed: Scope of validity of PSNR in image/video quality assessment. Electron. Lett. 44(13), 800–801 (2008)

    Article  Google Scholar 

  24. Illya, B., Marco, B., Raimondo, S., Mauro, C., Leonardo, V.: Structural similarity index (SSIM) revisited: a data-driven approach. Expert Syst. Appl. 189, 116087 (2022)

    Article  Google Scholar 

Download references

Acknowledgements

The research was funded by PURSE Scheme of the Department of Science and Technology, Government of India, awarded to Department of Computer Science and Engineering, University of Kalyani, West Bengal, India.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sujit Das.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Das, S., Mandal, J.K. A modified column block Toeplitz matrix for compressed sensing. SIViP 17, 3083–3090 (2023). https://doi.org/10.1007/s11760-023-02529-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11760-023-02529-8

Keywords

Navigation