Majorization-minimization algorithms for wavelet-based image restoration

doi:10.1109/TIP.2007.909318

2007-12-01

491

PRE

Mário A. T. Figueiredo *

José M. Bioucas‐Dias

R.D. Nowak

DOI：10.1109/TIP.2007.909318

原文链接

原文求助

摘要

En 中文

Standard formulations of image/signal deconvolution under wavelet-based priors/regularizers lead to very high-dimensional optimization problems involving the following difficulties: the non-Gaussian (heavy-tailed) wavelet priors lead to objective functions which are nonquadratic, usually nondifferentiable, and sometimes even nonconvex; the presence of the convolution operator destroys the separability which underlies the simplicity of wavelet-based denoising. This paper presents a unified view of several recently proposed algorithms for handling this class of optimization problems, placing them in a common majorization-minimization (MM) framework. One of the classes of algorithms considered (when using quadratic bounds on non-differentiable log-priors) shares the infamous singularity issue (SI) of iteratively reweighted least squares (IRLS) algorithms: the possibility of having to handle infinite weights, which may cause both numerical and convergence issues. In this paper, we prove several new results which strongly support the claim that the SI does not compromise the usefulness of this class of algorithms. Exploiting the unified MM perspective, we introduce a new algorithm, resulting from using l(1) bounds for nonconvex regularizers; the experiments confirm the superior performance of this method, when compared to the one based on quadratic majorization. Finally, an experimental comparison of the several algorithms, reveals their relative merits for different standard types of scenarios.

Keyword:

image deconvolution

image restoration

majorization-minimization (MM) algorithms

optimization

regularization

wavelets