On accelerated hard thresholding methods for sparse approximation

Volkan Cevher

doi:10.1117/12.894386

27 September 2011 On accelerated hard thresholding methods for sparse approximation

Volkan Cevher

Proceedings Volume 8138, Wavelets and Sparsity XIV; 813811 (2011) https://doi.org/10.1117/12.894386
Event: SPIE Optical Engineering + Applications, 2011, San Diego, California, United States

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.

Citation Download Citation

Volkan Cevher "On accelerated hard thresholding methods for sparse approximation", Proc. SPIE 8138, Wavelets and Sparsity XIV, 813811 (27 September 2011); https://doi.org/10.1117/12.894386

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available