• DocumentCode
    3355548
  • Title

    Gradient projection for linearly constrained convex optimization in sparse signal recovery

  • Author

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

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Duke Univ., Durham, NC, USA
  • fYear
    2010
  • fDate
    26-29 Sept. 2010
  • Firstpage
    3361
  • Lastpage
    3364
  • 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.
  • Keywords
    convex programming; gradient methods; signal processing; ℓ2-ℓ1 compressed sensing minimization; gradient projection; linearly constrained convex optimization; nonnegativity constraints; sparse signal recovery; Arrays; Convex functions; Image reconstruction; Imaging; Minimization; Optimization; Pixel; Gradient projection; Lagrange multipliers; compressed sensing; convex optimization; sparsity; wavelets;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Image Processing (ICIP), 2010 17th IEEE International Conference on
  • Conference_Location
    Hong Kong
  • ISSN
    1522-4880
  • Print_ISBN
    978-1-4244-7992-4
  • Electronic_ISBN
    1522-4880
  • Type

    conf

  • DOI
    10.1109/ICIP.2010.5652815
  • Filename
    5652815