Please use this identifier to cite or link to this item:
|Title:||Minimization of a detail-preserving regularization functional for impulse noise removal|
|Authors:||Cai, J.-F. |
Di Fiore, C.
|Source:||Cai, J.-F., Chan, R.H., Di Fiore, C. (2007-09). Minimization of a detail-preserving regularization functional for impulse noise removal. Journal of Mathematical Imaging and Vision 29 (1) : 79-91. ScholarBank@NUS Repository. https://doi.org/10.1007/s10851-007-0027-4|
|Abstract:||Recently, a powerful two-phase method for restoring images corrupted with high level impulse noise has been developed. The main drawback of the method is the computational efficiency of the second phase which requires the minimization of a non-smooth objective functional. However, it was pointed out in (Chan et al. in Proc. ICIP 2005, pp. 125-128) that the non-smooth data-fitting term in the functional can be deleted since the restoration in the second phase is applied to noisy pixels only. In this paper, we study the analytic properties of the resulting new functional f. We show that f, which is defined in terms of edge-preserving potential functions φ α , inherits many nice properties from φ α , including the first and second order Lipschitz continuity, strong convexity, and positive definiteness of its Hessian. Moreover, we use these results to establish the convergence of optimization methods applied to f. In particular, we prove the global convergence of some conjugate gradient-type methods and of a recently proposed low complexity quasi-Newton algorithm. Numerical experiments are given to illustrate the convergence and efficiency of the two methods. © 2007 Springer Science+Business Media, LLC.|
|Source Title:||Journal of Mathematical Imaging and Vision|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 15, 2018
WEB OF SCIENCETM
checked on Jan 31, 2018
checked on Feb 19, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.