Skip to main content
Log in

Stable recovery of approximately block k-sparse signals with partial block support information via weighted \(\ell _2/\ell _p\,(0<p\le 1)\) minimization

  • Published:
Computational and Applied Mathematics Aims and scope Submit manuscript

Abstract

In practical applications, some sparse signals have structural characteristics of block sparsity. Under the hypothesis of removing the requirements on the noise in recent literature concerning the \(\ell _2/\ell _p\,(0<p\le 1)\) minimization method, uniform block restricted isometry property (B-RIP) condition is established for the stable recovery of approximately block k-sparse signals with partial block support information by employing the weighted \(\ell _2/\ell _p\) minimization method. Compared with the state-of-the-art results, the newly-obtained results present more relaxed sufficient condition for block sparse signal recovery, and meanwhile provide more precise reconstruction error estimations in different noise settings. Numerical experiments demonstrate that the new method exhibits a substantial increase in the reconstruction quality for highly undersampled block structural signals.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Similar content being viewed by others

Data availability

All relevant data are within the paper.

References

  • Cai T, Zhang A (2013) Sharp RIC bound for sparse signal and low-rank matrix recovery. Appl Comput Harmon Anal 35(1):74–93

    Article  MathSciNet  Google Scholar 

  • Cai T, Zhang A (2014) Sparse representation of a polytope and recovery of sparse signals and low-rank matrices. IEEE Trans Inform Theory 60(1):122–132

    Article  MathSciNet  Google Scholar 

  • Candès E, Romberg J, Tao T (2006) Stable signal recovery from incomplete and inaccurate measurements. Commun Pure Appl Math 59(8):1207–1223

    Article  MathSciNet  Google Scholar 

  • Candès E, Tao T (2005) Decoding by linear programming. IEEE Trans Inform Theory 51(12):4203–4215

    Article  MathSciNet  Google Scholar 

  • Candès E, Tao T (2007) The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). Ann Stat 35(6):2313–2351

    MathSciNet  Google Scholar 

  • Chartrand R, Yin W (2008) Iteratively reweighted algorithms for compressive sensing, in: Proc. International Conference on Acoustics, Speech, and Signal Processing, IEEE, Las Vegas, NV, USA, pp. 3869–3872

  • Chen W, Li Y (2019) The high order block RIP condition for signal recovery. J Comput Math 37(1):61–75

    Article  MathSciNet  Google Scholar 

  • Donoho DL (2006) Compressed sensing. IEEE Trans Inform Theory 52(4):1289–1306

    Article  MathSciNet  Google Scholar 

  • Donodo DL, Elad M, Temlyakov VN (2006) Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Trans Inform Theory 52(1):6–18

    Article  MathSciNet  Google Scholar 

  • Du B, Wan A (2023) Stable and robust recovery of approximately \(k\)-sparse signals with partial support information in noise settings via weighted \(\ell _p\, (0<p\le 1)\) minimization. J Comput Math 41(6):1137–1170

    Article  MathSciNet  Google Scholar 

  • Du Q, Fowler JE (2007) Hyperspectral image compression using JPEG2000 and principal component analysis. IEEE Geosci Remote Sens Lett 4(2):201–205

    Article  Google Scholar 

  • Eldar YC, Mishali M (2009) Robust recovery of signals from a structured union of subspaces. IEEE Trans Inform Theory 55(11):5302–5316

    Article  MathSciNet  Google Scholar 

  • Foucart S, Lai M (2009) Sparsest solutions of underdetermined linear systems via \(\ell _q\)-minimization for \(0<q\le 1\). Appl Comput Harmon Anal 26(3):395–407

    Article  MathSciNet  Google Scholar 

  • Foucart S, Rauhut H (2013) A Mathematical Introduction to Compressive Sensing. Birkhäuser, Boston

    Book  Google Scholar 

  • Ge H, Chen W, Ng M (2020) New RIP bounds for recovery of sparse signals with partial support information via weighted \(\ell _p\) minimization. IEEE Trans Inform Theory 66(6):3914–3928

    Article  MathSciNet  Google Scholar 

  • Ghadermarzy N, Mansour H, Yilmaz Ö (2014) Non-convex compressed sensing using partial support information. Sampling Theory Signal Image Proc 13(3):251–272

    MathSciNet  Google Scholar 

  • Hennenfent G, Herrmann F (2008) Simply denoise: wavefield reconstruction via jittered undersampling. Geophysics 73(3):19–28

    Article  Google Scholar 

  • Huang J, Zhang T (2010) The benefit of group sparsity. Ann Stat 38(4):1978–2004

    Article  MathSciNet  Google Scholar 

  • Jacques L (2010) A short note on compressed sensing with partially known signal support. Signal Process 90(12):3308–3312

    Article  Google Scholar 

  • Kang L, Lu C (2009) Distributed compressive video sensing, in: Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) 1169–1172

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

    Article  Google Scholar 

  • Majumdar A, Ward RK (2010) Compressed sensing of color images. Signal Process 90(12):3122–3127

    Article  Google Scholar 

  • Parvaresh F, Vikalo H, Misra S, Hassibi B (2008) Recovering sparse signals using sparse measurement matrices in compressed DNA microarrays. J Sel Topics Signal Process 2(3):275–285

    Article  Google Scholar 

  • Stojnic M, Parvaresh F, Hassibi B (2009) On the reconstruction of block-sparse signals with an optimal number of measurements. IEEE Trans Signal Process 57(8):3075–3085

    Article  MathSciNet  Google Scholar 

  • Sun Q (2012) Recovery of sparsest signals via \(\ell _q\)-minimization. Appl Comput Harmon Anal 32(3):329–341

    Article  MathSciNet  Google Scholar 

  • Vaswani N, Lu W (2010) Modified-CS: modifying compressive sensing for problems with partially known support. IEEE Trans Signal Process 58(9):4595–4607

    Article  MathSciNet  Google Scholar 

  • Vidal R, Ma Y (2006) A unified algebraic approach to 2-D and 3-D motion segmentation and estimation. J Math Imaging Vision 25(3):403–421

    Article  MathSciNet  Google Scholar 

  • Wan A (2020) Stable recovery of approximately \(k\)-sparse signals in noisy cases via \(\ell _p\) minimization. Neurocomputing 406:159–168

    Article  Google Scholar 

  • Wan A (2020) Uniform RIP conditions for recovery of sparse signals by \(\ell _p\, (0<p\le 1)\) minimization. IEEE Trans Signal Process 68:5379–5394

    Article  MathSciNet  Google Scholar 

  • Wang Y, Wang J, Xu Z (2013) On recovery of block-sparse signals via mixed \(\ell _2/\ell _q (0 < q \le 1)\) norm minimization. EURASIP J Adv Signal Proc 76:1–17

    Google Scholar 

  • Wang Y, Wang J, Xu Z (2014) Restricted \(p\)-isometry properties of nonconvex block-sparse compressed sensing. Signal Process 104:188–196

    Article  Google Scholar 

  • Weizman L, Eldar Y, Bashat D (2015) Compressed sensing for longitudinal MRI: an adaptive-weighted approach. Med Phys 42(9):5195–5208

    Article  Google Scholar 

  • Xiao R, Fu Y, Wan A (2023) Upper bound of null space constant \(\rho (p, t, A, k)\) and high-order restricted isometry constant \(\delta _{tk}\) for sparse recovery via \(\ell _p\) minimization. IEEE Trans Signal Process 71:2927–2935

    Article  MathSciNet  Google Scholar 

  • Zhou J, Huang W (2022) Block sparse representation of a polytope and non-convex compressed sensing. Scientia Sinica Mathematica 52:105–120

    Article  Google Scholar 

  • Zhou Z, Yu J (2019) Recovery analysis for weighted mixed \(\ell _2/\ell _p\) minimization with \(0<p\le 1\). J Comput Appl Math 352(15):210–222

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the National Natural Science Foundation of China under Grant number 12171496, in part by Guangdong Basic and Applied Basic Research Foundation under Grant number 2024A1515012057.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Anhua Wan.

Ethics declarations

Conflict of interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

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

Liu, W., Wan, A. Stable recovery of approximately block k-sparse signals with partial block support information via weighted \(\ell _2/\ell _p\,(0<p\le 1)\) minimization. Comp. Appl. Math. 43, 185 (2024). https://doi.org/10.1007/s40314-024-02714-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s40314-024-02714-6

Keywords

Mathematics Subject Classification

Navigation