Please use this identifier to cite or link to this item:
Title: Fast optimization for multichannel total variation minimization with non-quadratic fidelity
Authors: Zhang, J.
Wu, C. 
Keywords: Augmented Lagrangian method
Image restoration
Impulse noise
Poisson noise
Total variation
Issue Date: Aug-2011
Source: Zhang, J., Wu, C. (2011-08). Fast optimization for multichannel total variation minimization with non-quadratic fidelity. Signal Processing 91 (8) : 1933-1940. ScholarBank@NUS Repository.
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 KullbackLeibler (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. © 2011 Elsevier B.V. All rights reserved.
Source Title: Signal Processing
ISSN: 01651684
DOI: 10.1016/j.sigpro.2011.02.015
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Mar 8, 2018


checked on Feb 7, 2018

Page view(s)

checked on Mar 12, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.