Gradient projection for linearly constrained convex optimization in sparse signal recovery

Zachary T. Harmany, Daniel Thompson, Rebecca Willett, Roummel F. Marcia

Abstract

The ℓ 2 -ℓ 1 compressed sensing minimization problem can be solved efficiently by gradient projection. In imaging applications, the signal of interest corresponds to nonnegative pixel intensities; thus, with additional nonnegativity constraints on the reconstruction, the resulting constrained minimization problem becomes more challenging to solve. In this paper, we propose a gradient projection approach for sparse signal recovery where the reconstruction is subject to nonnegativity constraints. Numerical results are presented to demonstrate the effectiveness of this approach.
BibTeX
@inproceedings{harmany2010gradient,
  author = {Zachary T. Harmany and Daniel Thompson and Rebecca Willett and Roummel F. Marcia},
  title = {{Gradient projection for linearly constrained convex optimization in sparse signal recovery}},
  booktitle = {ICIP},
  year = {2010},
  doi = {10.1109/icip.2010.5652815},
}

Loading related content...

Figure