A Fast Proximal Gradient Algorithm for Reconstructing Nonnegative Signals with Sparse Transform Coefficients

Thumbnail Image
Date
2014-11-01
Authors
Gu, Renliang
Dogandžić, Aleksandar
Major Professor
Advisor
Committee Member
Journal Title
Journal ISSN
Volume Title
Publisher
Authors
Research Projects
Organizational Units
Journal Issue
Is Version Of
Versions
Series
Department
Electrical and Computer Engineering
Abstract

We develop a fast proximal gradient scheme for reconstructing nonnegative signals that are sparse in a transform domain from underdetermined measurements. This signal model is motivated by tomographic applications where the signal of interest is known to be nonnegative because it represents a tissue or material density. We adopt the unconstrained regularization framework where the objective function to be minimized is a sum of a convex data fidelity (negative log-likelihood (NLL)) term and a regularization term that imposes signal nonnegativity and sparsity via an `1-norm constraint on the signal’s transform coefficients. This objective function is minimized via Nesterov’s proximal-gradient method with function restart, where the proximal mapping is computed via alternating direction method of multipliers (ADMM). To accelerate the convergence, we develop an adaptive continuation scheme and a step-size selection scheme that accounts for varying local Lipschitz constant of the NLL. In the numerical examples, we consider Gaussian linear and Poisson generalized linear measurement models. We compare the proposed penalized NLL minimization approach and existing signal reconstruction methods via compressed sensing and tomographic reconstruction experiments and demonstrate that, by exploiting both the nonnegativity of the underlying signal and sparsity of its wavelet coefficients, we can achieve significantly better reconstruction performance than the existing methods.

Comments

This is a manuscript of a proceeding in Forty-Eighth Asilomar Conference on Signals, Systems and Computers (2014): 1-6. Posted with permission.

Description
Keywords
Citation
DOI
Source
Copyright
Wed Jan 01 00:00:00 UTC 2014