• DocumentCode
    598260
  • Title

    An efficient projected subgradient algorithm for blind image deconvolution using an L1-TV cost function

  • Author

    Wenyao Xia ; Hatzinakos, Dimitrios

  • Author_Institution
    Dept. of Electr. & Comput. & Eng., Univ. of Toronto, Toronto, ON, Canada
  • fYear
    2012
  • fDate
    Sept. 30 2012-Oct. 3 2012
  • Firstpage
    3045
  • Lastpage
    3048
  • Abstract
    Traditional blind image iterative algorithms are designed for Gaussian noise by using the L2-norm error term. For robustness against the influence of non-Gaussian noise, an efficient projected subgradient algorithm for blind image deconvolution is developed, based on a TV cost function with the L1-norm error term. Because of using the subgradient technique, the proposed subgradient algorithm can minimize the L1-TV cost function directly. By contrast, existing L1 norm-based image restoration algorithms only minimize the approximate L1 cost function and assume a known blur. Illustrative examples show that under suboptimal regularization parameters, the projected subgradient algorithm is efficient in producing better image estimate than two traditional blind image iterative algorithms in terms of both ISNR and perception.
  • Keywords
    deconvolution; gradient methods; image restoration; Gaussian noise; ISNR; L1-TV cost function; L1-norm error term; L2-norm error term; approximate cost function minimization; blind image deconvolution; blind image iterative algorithms; image restoration algorithms; nonGaussian noise; perception; subgradient algorithm; suboptimal regularization parameters; Approximation algorithms; Cost function; Deconvolution; Image restoration; Noise; Signal processing algorithms; TV; Blind image deconvolution; L1-TV cost function; non-Gaussian noise; subgradient algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Image Processing (ICIP), 2012 19th IEEE International Conference on
  • Conference_Location
    Orlando, FL
  • ISSN
    1522-4880
  • Print_ISBN
    978-1-4673-2534-9
  • Electronic_ISBN
    1522-4880
  • Type

    conf

  • DOI
    10.1109/ICIP.2012.6467542
  • Filename
    6467542