Thresholding Greedy Pursuit for Sparse Recovery Problems
From MaRDI portal
Abstract: We study here sparse recovery problems in the presence of additive noise. We analyze a thresholding version of the CoSaMP algorithm, named Thresholding Greedy Pursuit (TGP). We demonstrate that an appropriate choice of thresholding parameter, even without the knowledge of sparsity level of the signal and strength of the noise, can result in exact recovery with no false discoveries as the dimension of the data increases to infinity.
This page was built for publication: Thresholding Greedy Pursuit for Sparse Recovery Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6363435)
