Fast relative newton algorithm for blind deconvolution of images
Lists
Only you see this
Abstract
We present an efficient Newton-like algorithm for quasimaximum likelihood (QML) blind deconvolution of images. This algorithm exploits the sparse structure of the Hessian. An optimal distribution-shaping approach by means of sparsification allows one to use simple and convenient sparsity prior for processing of a wide range of natural images. Simulation results demonstrate the efficiency of the proposed method.
BibTeX
@inproceedings{bronstein2004fast,
author = {Alexander M. Bronstein and Michael Zibulevsky and Michael M. Bronstein and Yehoshua Y. Zeevi},
title = {{Fast relative newton algorithm for blind deconvolution of images}},
booktitle = {ICIP},
year = {2004},
doi = {10.1109/icip.2004.1419528},
}Loading related content...