Abstract
We empirically show how applying a pure greedy algorithm cyclically
can recover compressively sampled sparse signals as well
as other more computationally complex approaches, such as orthogonal greedy algorithms,
iterative thresholding, and $\ell_1$-minimization.
can recover compressively sampled sparse signals as well
as other more computationally complex approaches, such as orthogonal greedy algorithms,
iterative thresholding, and $\ell_1$-minimization.
Originalsprog | Engelsk |
---|---|
Publikationsdato | 2011 |
Status | Udgivet - 2011 |
Begivenhed | SPARS2011 - Edinburgh, Storbritannien Varighed: 27 jun. 2011 → … |
Konference
Konference | SPARS2011 |
---|---|
Land/Område | Storbritannien |
By | Edinburgh |
Periode | 27/06/2011 → … |