Fast optimization for multichannel total variation minimization with non-quadratic fidelity

Authors:
Juyong Zhang;Chunlin Wu
Affiliations:
Division of Computer Communications, School of Computer Engineering, Nanyang Technological University, Singapore;Department of Mathematics, National University of Singapore, Singapore
Venue:
Signal Processing
Year:
2011

Citing 5
Cited 0

Atomic Decomposition by Basis Pursuit

SIAM Journal on Scientific Computing
Convex analysis and variational problems

Convex analysis and variational problems
An Algorithm for Total Variation Minimization and Applications

Journal of Mathematical Imaging and Vision
A Variational Approach to Remove Outliers and Impulse Noise

Journal of Mathematical Imaging and Vision
Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision

SSVM '09 Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision

Quantified Score

Hi-index	0.08

Visualization

Abstract

Total variation (TV) has been proved very successful in image processing, and it has been combined with various non-quadratic fidelities for non-Gaussian noise removal. However, these models are hard to solve because TV is non-differentiable and nonlinear, and non-quadratic fidelity term is also nonlinear and even non-differentiable for some special cases. This prevents their widespread use in practical applications. Very recently, it was found that the augmented Lagrangian method is extremely efficient for this kind of models. However, only the single-channel case (e.g., gray images) is considered. In this paper, we propose a general computational framework based on augmented Lagrangian method for multichannel TV minimization with non-quadratic fidelity, and then show how to apply it to two special cases: L^1 and Kullback-Leibler (KL) fidelities, two common and important data terms for blurry images corrupted by impulsive noise or Poisson noise, respectively. For these typical fidelities, we show that the sub-problems either can be fast solved by FFT or have closed form solutions. The experiments demonstrate that our algorithm can fast restore high quality images.