Filtered gradient compressive sensing reconstruction algorithm for sparse and structured measurement matrices

Yuri H. Mejia; Henry Arguello

doi:10.1117/12.2224276

4 May 2016 Filtered gradient compressive sensing reconstruction algorithm for sparse and structured measurement matrices

Yuri H. Mejia, Henry Arguello

Author Affiliations +

Proceedings Volume 9857, Compressive Sensing V: From Diverse Modalities to Big Data Analytics; 98570F (2016) https://doi.org/10.1117/12.2224276
Event: SPIE Commercial + Scientific Sensing and Imaging, 2016, Baltimore, MD, United States

Abstract

Compressive sensing state-of-the-art proposes random Gaussian and Bernoulli as measurement matrices. Nev- ertheless, often the design of the measurement matrix is subject to physical constraints, and therefore it is frequently not possible that the matrix follows a Gaussian or Bernoulli distribution. Examples of these lim- itations are the structured and sparse matrices of the compressive X-Ray, and compressive spectral imaging systems. A standard algorithm for recovering sparse signals consists in minimizing an objective function that includes a quadratic error term combined with a sparsity-inducing regularization term. This problem can be solved using the iterative algorithms for solving linear inverse problems. This class of methods, which can be viewed as an extension of the classical gradient algorithm, is attractive due to its simplicity. However, current algorithms are slow for getting a high quality image reconstruction because they do not exploit the structured and sparsity characteristics of the compressive measurement matrices. This paper proposes the development of a gradient-based algorithm for compressive sensing reconstruction by including a filtering step that yields improved quality using less iterations. This algorithm modifies the iterative solution such that it forces to converge to a filtered version of the residual A^T y, where y is the measurement vector and A is the compressive measurement matrix. We show that the algorithm including the filtering step converges faster than the unfiltered version. We design various filters that are motivated by the structure of A^T y. Extensive simulation results using various sparse and structured matrices highlight the relative performance gain over the existing iterative process.

Citation Download Citation

Yuri H. Mejia and Henry Arguello "Filtered gradient compressive sensing reconstruction algorithm for sparse and structured measurement matrices", Proc. SPIE 9857, Compressive Sensing V: From Diverse Modalities to Big Data Analytics, 98570F (4 May 2016); https://doi.org/10.1117/12.2224276

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

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
6 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Reconstruction algorithms

Matrices

Transmittance

Compressed sensing

Algorithm development

Coded apertures

Image compression

Show All Keywords

Keywords/Phrases

Search In:

Publication Years