
Proceedings Paper
On accelerated hard thresholding methods for sparse approximationFormat | Member Price | Non-Member Price |
---|---|---|
$17.00 | $21.00 |
Paper Abstract
We propose and analyze acceleration schemes for hard thresholding methods with applications to sparse approximation
in linear inverse systems. Our acceleration schemes fuse combinatorial, sparse projection algorithms
with convex optimization algebra to provide computationally efficient and robust sparse recovery methods. We
compare and contrast the (dis)advantages of the proposed schemes with the state-of-the-art, not only within
hard thresholding methods, but also within convex sparse recovery algorithms.
Paper Details
Date Published: 27 September 2011
PDF: 11 pages
Proc. SPIE 8138, Wavelets and Sparsity XIV, 813811 (27 September 2011); doi: 10.1117/12.894386
Published in SPIE Proceedings Vol. 8138:
Wavelets and Sparsity XIV
Manos Papadakis; Dimitri Van De Ville; Vivek K. Goyal, Editor(s)
PDF: 11 pages
Proc. SPIE 8138, Wavelets and Sparsity XIV, 813811 (27 September 2011); doi: 10.1117/12.894386
Show Author Affiliations
Volkan Cevher, Swiss Institute of Technology (Switzerland)
Published in SPIE Proceedings Vol. 8138:
Wavelets and Sparsity XIV
Manos Papadakis; Dimitri Van De Ville; Vivek K. Goyal, Editor(s)
© SPIE. Terms of Use
