An efficient projected subgradient algorithm for blind image deconvolution using an L<inf>1</inf>-TV cost function
Lists
Only you see this
Abstract
Traditional blind image iterative algorithms are designed for Gaussian noise by using the L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> -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 L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> -norm error term. Because of using the subgradient technique, the proposed subgradient algorithm can minimize the L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> -TV cost function directly. By contrast, existing L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> norm-based image restoration algorithms only minimize the approximate L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> 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.
BibTeX
@inproceedings{xia2012efficient,
author = {Wenyao Xia and Dimitrios Hatzinakos},
title = {{An efficient projected subgradient algorithm for blind image deconvolution using an L\<inf\>1\</inf\>-TV cost function}},
booktitle = {ICIP},
year = {2012},
doi = {10.1109/icip.2012.6467542},
}Loading related content...