• DocumentCode
    60968
  • Title

    Convex Denoising using Non-Convex Tight Frame Regularization

  • Author

    Parekh, Ankit ; Selesnick, Ivan W.

  • Author_Institution
    Dept. of Math., New York Univ., New York, NY, USA
  • Volume
    22
  • Issue
    10
  • fYear
    2015
  • fDate
    Oct. 2015
  • Firstpage
    1786
  • Lastpage
    1790
  • Abstract
    This letter considers the problem of signal denoising using a sparse tight-frame analysis prior. The l1 norm has been extensively used as a regularizer to promote sparsity; however, it tends to under-estimate non-zero values of the underlying signal. To more accurately estimate non-zero values, we propose the use of a non-convex regularizer, chosen so as to ensure convexity of the objective function. The convexity of the objective function is ensured by constraining the parameter of the non-convex penalty. We use ADMM to obtain a solution and show how to guarantee that ADMM converges to the global optimum of the objective function. We illustrate the proposed method for 1D and 2D signal denoising.
  • Keywords
    convex programming; signal denoising; convex denoising; nonconvex penalty; nonconvex regularizer; nonconvex tight frame regularization; objective function; signal denoising; sparse tight frame analysis; under estimate nonzero values; Computer vision; Convergence; Image reconstruction; Linear programming; Noise reduction; Signal denoising; Transforms; Analysis model; convex optimization; non-convex regularization; sparse signal; tight frame;
  • fLanguage
    English
  • Journal_Title
    Signal Processing Letters, IEEE
  • Publisher
    ieee
  • ISSN
    1070-9908
  • Type

    jour

  • DOI
    10.1109/LSP.2015.2432095
  • Filename
    7105866