Loading…

A multiplicative regularization approach for deblurring problems

In this work, an iterative inversion algorithm for deblurring and deconvolution is considered. The algorithm is based on the conjugate gradient scheme and uses the so-called weighted L/sub 2/-norm regularizer to obtain a reliable solution. The regularizer is included as a multiplicative constraint....

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on image processing 2004-11, Vol.13 (11), p.1524-1532
Main Authors: Abubakar, A., van den Berg, P.M., Habashy, T.M., Braunisch, H.
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this work, an iterative inversion algorithm for deblurring and deconvolution is considered. The algorithm is based on the conjugate gradient scheme and uses the so-called weighted L/sub 2/-norm regularizer to obtain a reliable solution. The regularizer is included as a multiplicative constraint. In this way, the appropriate regularization parameter will be controlled by the optimization process itself. In fact, the misfit in the error in the space of the blurring operator is the regularization parameter. Then, no a priori knowledge on the blurred data or image is needed. If noise is present, the misfit in the error consisting of the blurring operator will remain at a large value during the optimization process; therefore, the weight of the regularization factor will be more significant. Hence, the noise will, at all times, be suppressed in the reconstruction process. Although one may argue that, by including the regularization factor as a multiplicative constraint, the linearity of the problem has been lost, careful analysis shows that, under certain restrictions, no new local minima are introduced. Numerical testing shows that the proposed algorithm works effectively and efficiently in various practical applications.
ISSN:1057-7149
1941-0042
DOI:10.1109/TIP.2004.836172