Total Variation-Based Image Deconvolution: a Majorization-Minimization Approach
The total variation regularizer is well suited to piecewise smooth images. If we add the fact that these regularizers are convex, we have, perhaps, the reason for the resurgence of interest on TV-based approaches to inverse problems. This paper proposes a new TV-based algorithm for image deconvolution, under the assumptions of linear observations and additive white Gaussian noise. To compute the TV estimate, we propose a majorization-minimization approach, which consists in replacing a difficult optimization problem by a sequence of simpler ones, by relying on convexity arguments. The resulting algorithm has O(N) computational complexity, for finite support convolutional kernels. In a comparison with state-of-the-art methods, the proposed algorithm either outperforms or equals them, with similar computational complexity