Anal. Theory Appl., 37 (2021), pp. 289-310.
Published online: 2021-09
[An open-access article; the PDF is free to any online user.]
Cited by
- BibTex
- RIS
- TXT
Weighted $\ell_p$ ($0<p\leq1$) minimization has been extensively studied as an effective way to reconstruct a sparse signal from compressively sampled measurements when some prior support information of the signal is available. In this paper, we consider the recovery guarantees of $k$-sparse signals via the weighted $\ell_p$ ($0<p\leq1$) minimization when arbitrarily many support priors are given. Our analysis enables an extension to existing works that assume only a single support prior is used.
}, issn = {1573-8175}, doi = {https://doi.org/10.4208/ata.2021.lu80.02}, url = {http://global-sci.org/intro/article_detail/ata/19876.html} }Weighted $\ell_p$ ($0<p\leq1$) minimization has been extensively studied as an effective way to reconstruct a sparse signal from compressively sampled measurements when some prior support information of the signal is available. In this paper, we consider the recovery guarantees of $k$-sparse signals via the weighted $\ell_p$ ($0<p\leq1$) minimization when arbitrarily many support priors are given. Our analysis enables an extension to existing works that assume only a single support prior is used.