An accelerated random coordinate descent algorithm for compressed sensing

Dongfang Chen; Ningtao Zhang

doi:10.1117/12.913495

1 October 2011 An accelerated random coordinate descent algorithm for compressed sensing

Dongfang Chen, Ningtao Zhang

Proceedings Volume 8285, International Conference on Graphic and Image Processing (ICGIP 2011); 82856O (2011) https://doi.org/10.1117/12.913495
Event: 2011 International Conference on Graphic and Image Processing, 2011, Cairo, Egypt

Abstract

This paper introduces a new accelerated random coordinate descent algorithm for solving problems in the field of compressive sensing, and more generally, in the field of signal and image reconstruction from indirect or incomplete measurements. This algorithm is inspired by recent progress in convex optimization development of coordinate descent. Our method is very efficient for solving compressive sensing data recovery problems. Numerical experiments show the performance of our algorithm to solve high-dimensional optimization problems.

Citation Download Citation

Dongfang Chen and Ningtao Zhang "An accelerated random coordinate descent algorithm for compressed sensing", Proc. SPIE 8285, International Conference on Graphic and Image Processing (ICGIP 2011), 82856O (1 October 2011); https://doi.org/10.1117/12.913495

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