Skip to main content
SpringerLink
Log in

SOSP: a stepwise optimal sparsity pursuit algorithm for practical compressed sensing

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Compressed Sensing (CS), as a promising paradigm for acquiring signals, is playing an increasing important role in many real-world applications. One of the major components of CS is sparse signal recovery in which greedy algorithm is well-known for its speed and performance. Unfortunately, in many classic greedy algorithms, such as OMP and CoSaMP, the real sparsity is a key prior information, but it is blind. In another words, the true sparsity is not available for many practical applications. Due to this disadvantage, the performance of these algorithms are significantly reduced. In order to avoid too much dependence of classic greedy algorithms on the true sparsity, this paper proposed an efficient reconstruction greedy algorithm for practical Compressed Sensing, termed stepwise optimal sparsity pursuit (SOSP). Differs from the existing algorithms, the unique feature of SOSP algorithm is that the assumption of sparsity is needed instead of the true sparsity. Hence, the limitations of sparsity in practical application can be tackled. Based on an arbitrary initial sparsity satisfying certain conditions, the SOSP algorithm employs two variable step sizes to hunt for the optimal sparsity step by step by comparing the final reconstruction residues. Since the proposed SOSP algorithm preserves the ideas of original algorithms and innovates the prior information of sparsity, thus it is applicable to any effective algorithm requiring known sparsity. Extensive experiments are conducted in order to demonstrate that the SOSP algorithm offers a superior reconstruction performance in terms of discarding the true sparsity.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

Notes

  1. http://www.eee.hku.hk/~wsha/Freecode/freecode.htm

  2. http://www.codeforge.com/read/233058/Demo_CS_CoSaMP.m_html

References

  1. Ambat SK, Chatterjee S, Hari KVS (2014) A committee machine approach for compressed sensing signal reconstruction. IEEE Trans Signal Process 62(7):1705–1717

    Article  MathSciNet  Google Scholar 

  2. Baraniuk R (2011) More Is less: Signal processing and the data deluge. Science 331(6018):717–719

    Article  Google Scholar 

  3. Baraniuk R, Steeghs P (2007) Compressive radar imaging. In: 2007 IEEE radar conference, pp 128–133

  4. Budillon A, Evangelista A, Schirinzi G (2011) Three-dimensions SAR focusing from multipass signals using compressive sampling. IEEE Trans Geosci Remote Sens 49(1):488–499

    Article  Google Scholar 

  5. Candes EJ (2008) The restricted isometry property and its implications for compressed sensing. Comptes Rendus Mathematique 346(9):589–592

    Article  MathSciNet  Google Scholar 

  6. Candes EJ, Tao T (2005) Decoding by linear programming. IEEE Trans Inf Theory 51(12):4203–4215

    Article  MathSciNet  Google Scholar 

  7. Candes EJ, Wakin M (2008) An introduction to compressive sampling. In: IEEE signal processing magazine, pp 21–30

  8. Candes EJ, Romberg J, Tao T (2006) Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Trans Inf Theory 52(2):489–509

    Article  MathSciNet  Google Scholar 

  9. Dai W, Milenkovic O (2009) Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans Inf Theory 55(5):2230–2249

    Article  MathSciNet  Google Scholar 

  10. Do TT, Gan L, Nguyen N, Tran TD (2008) Sparsity adaptive matching pursuit algorithm for practical compressed sensing. In: Asilomar conference on signals, systems, and computers, pp 581–587

  11. Donoho D (2006) Compressed sensing. IEEE Trans Inf Theory 52:1289–1306

    Article  MathSciNet  Google Scholar 

  12. Duarte M, Davenport MA, Takhar D, Laska J, Sun T, Kelly K, Baraniuk R (2008) Single-pixel imaging via compressive sampling. IEEE Signal Proc Mag 25(2):83

    Article  Google Scholar 

  13. Fang L, Li S, McNabb RP, Nie Q, Kuo AN, Toth CA, Izatt JA, Farsiu S (2013) Fast acquisition and reconstruction of optical coherence tomography images via sparse representation. IEEE Trans Med Imaging 32(11):2034–2049

    Article  Google Scholar 

  14. Hegde C, Sankaranarayanan AC, Yin W, Baraniuk R (2015) A convex approach for learning near-Isometric linear embeddings. IEEE Trans Signal Process 63(22):6109–6121

    Article  MathSciNet  Google Scholar 

  15. Kajbaf H, Case JT, Yang Z, Zheng YR (2013) Compressed sensing for SAR-based wideband three-dimensional microwave imaging system using non-uniform fast fourier transform. IET Radar Sonar Navig 7(6):658–670

    Article  Google Scholar 

  16. Kowalski M, Piszczek M, Szustakowski M, Ciurapinski W (2012) Single-pixel camera simulation tool and the first results of analysis of image quality. In: Annals of DAAAM for 2012 & proceedings of the 23rd international DAAAM symposium, vol 23, no 1, ISSN 2304–1382

  17. Lawrie BJ, Pooser RC (2013) Toward real-time quantum imaging with a single pixel camera. Opt Express 21(6):7549–7559

    Article  Google Scholar 

  18. Lingala SG, Jacob M (2013) Blind compressive sensing dynamic MRI. IEEE Trans Med Imaging 32(6):1132–1145

    Article  Google Scholar 

  19. Liu E, Temlyakov VN (2012) The orthogonal super greedy algorithm and applications in compressed sensing. IEEE Trans Inf Theory 58(4):2040–2047

    Article  MathSciNet  Google Scholar 

  20. Liu P, Kie B (2014) Eom compressive sensing of noisy multispectral images. IEEE Geosci Remote Sens Lett 11(11):1931–1935

    Article  Google Scholar 

  21. Lustig M, Donoho D, Pauly J (2007) Sparse MRI:the application of compressed sensing for rapid MR imaging. Magn Reson Med 58(6):1182–1195

    Article  Google Scholar 

  22. Lustig M, Donoho D, Santos J, Pauly J (2008) Compressed sensing MRI. IEEE Signal Proc Mag 25(2):72–82

    Article  Google Scholar 

  23. Mallat SG, Zhang Z (1993) Matching pursuits with time-frequency dictionaries. IEEE Trans Signal Process 41(12):3397–3415

    Article  Google Scholar 

  24. Mangia M, Pareschi F, Cambareri V et al (2017) Rakeness-based design of low-complexity compressed Sensing. In: IEEE transactions on circuits and systems I: Regular Papers, pp 1–13

  25. Mota JFC, Xavier J, Aguiar PMQ, Puschel M (2012) Distributed basis pursuit. IEEE Trans Signal Process 60(4):1942–1956

    Article  MathSciNet  Google Scholar 

  26. Needell D, Tropp J (2009) CosaMP: Iterative signal recovery from incomplete and inaccurate samples. Appl Comput Harmon Anal 26(3):301–321

    Article  MathSciNet  Google Scholar 

  27. Needell D, Vershynin R (2010) Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit. IEEE J Sel Top Sign Proces 4(2):310–316

    Article  Google Scholar 

  28. Petrovici MA, Coltuc D, Datcu M, Vasile T (2015) Rate-distortion performance of compressive sensing in single pixel camera. In: 2015 IEEE international conference industrial technology (ICIT), pp 1747–1751

  29. Romberg J (2008) Compressive sensing. IEEE Signal Proc Mag, pp 118–121

  30. Rossi M, Haimovichn AM, Eldar YC (2014) Spatial compressive sensing for MIMO radar. IEEE Trans Signal Process 62(2):419–430

    Article  MathSciNet  Google Scholar 

  31. Sankaranarayanan AC, Xu L, Studer C, Li Y, Kelly K, Baraniuk R (2015) Video compressive sensing for spatial multiplexing cameras using motion-Flow models. SIAM J Imag Sci 8(3):1489– 1518

    Article  MathSciNet  Google Scholar 

  32. Shir azinia A, Chatterjee S, Skoglund M (2014) Joint source-channel vector quantization for compressed sensing. IEEE Trans Signal Process 62(14):3667–3681

    MathSciNet  MATH  Google Scholar 

  33. Takhar D, Laska J, Wakin M, Duarte M, Baron D, Sarvotham S, Kelly K, Baraniuk R (2006) A new compressive imaging camera architecture using optical-domain compression. IS&T/SPIE Computational Imaging IV, vol 6065

  34. Tropp J (2004) Greed is good: Algorithmic results for sparse approximation. IEEE Trans Inf Theory 50(10):2231–2242

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  36. Wang L, Lu K, Liu P (2015) Compressed sensing of a remote sensing image based on the priors of the reference image. IEEE Geosci Remote Sens Lett 12(4):736–740

    Article  Google Scholar 

  37. Yang J, Thompson J, Huang X, Jin T, Zhou Z (2013) Random-frequency SAR imaging based on compressed sensing. IEEE Trans Geosci Remote Sens 51(2):983–994

    Article  Google Scholar 

  38. Yuan J, Usman A, Reid SA et al (2017) Three-dimensional black-blood T2 mapping with compressed sensing and data-driven parallel imaging in the carotid artery. Magn Reson Imaging 37:62–69

    Article  Google Scholar 

  39. Zeng WJ, So HC, Jiang X (2016) Outlier-robust greedy pursuit algorithms in lp-space for sparse approximation. IEEE Trans Signal Process 64(1):60–75

    Article  MathSciNet  Google Scholar 

  40. Zhu X, Bamler R (2010) Tomographic SAR inversion by L1-Norm Regularizationthe compressive sensing approach. IEEE Trans Geosci Remote Sens 48(10):3839–3846

    Article  Google Scholar 

Download references

Acknowledgment

The authors would like to thank their colleagues for many useful comments. In particular, they are grateful to Xuefei Bai of Shanxi University for many discussions on the OMP and CoSaMP code. This work was supported by the National Science Foundation of China (No. 61273294) and Youth Foundation of Shanxi Province, China (201601D202040). F. Hao’s work was supported by the Fundamental Research Funds for the Central Universities, China (Grant No. GK201703059) and the Natural Science Foundation for Young Scientists of Shanxi Province, China (Grant No. 2015021102). D.S. Park’s work was supported by Basic Science Research program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (No. NRF-2017R1A2B1008421).

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, Taiyuan Normal University, Taiyuan, 030619, China

    Huijuan Guo & Suqing Han

  2. School of Computer Science, Shaanxi Normal University, Xi’an, 710119, China

    Fei Hao

  3. Department of Computer Software Engineering, Soonchunhyang University, Asan, Korea

    Doo-Soon Park

  4. Department of Mathematics and Computer Science, University of Exeter, Exeter, UK

    Geyong Min

Authors
  1. Huijuan Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Suqing Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fei Hao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Doo-Soon Park
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Geyong Min
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Suqing Han.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Guo, H., Han, S., Hao, F. et al. SOSP: a stepwise optimal sparsity pursuit algorithm for practical compressed sensing. Multimed Tools Appl 78, 3–26 (2019). https://doi.org/10.1007/s11042-017-4920-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-017-4920-6

Keywords

Search

Navigation