Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems
Figueiredo, M.A.T.
Nowak, R.D.
Wright, S.J.
Inst. Superior Tecnico, Lisbon;
This paper appears in: Selected Topics in Signal Processing, IEEE Journal of
Publication Date: Dec. 2007
Volume: 1,
Issue: 4
On page(s): 586-597
ISSN: 1932-4553
INSPEC Accession Number: 9742903
Digital Object Identifier: 10.1109/JSTSP.2007.910281
Current Version Published: 2008-01-07
Abstract
Many problems in signal processing and statistical inference involve finding sparse solutions to under-determined, or ill-conditioned, linear systems of equations. A standard approach consists in minimizing an objective function which includes a quadratic (squared ) error term combined with a sparseness-inducing regularization term. Basis pursuit, the least absolute shrinkage and selection operator (LASSO), wavelet-based deconvolution, and compressed sensing are a few well-known examples of this approach. This paper proposes gradient projection (GP) algorithms for the bound-constrained quadratic programming (BCQP) formulation of these problems. We test variants of this approach that select the line search parameters in different ways, including techniques based on the Barzilai-Borwein method. Computational experiments show that these GP approaches perform well in a wide range of applications, often being significantly faster (in terms of computation time) than competing methods. Although the performance of GP methods tends to degrade as the regularization term is de-emphasized, we show how they can be embedded in a continuation scheme to recover their efficient practical performance.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
