A new fast iterative algorithm is proposed to denoise images affected by Gaussian additive noise, by solving a constrained optimization problem. A family of functionals parameterized by a few hyperparameters already proposed in the literature to solve denoising problems is considered. The algorithm estimates jointly the image and the hyperparameters, therefore providing an automatic method. Each member of the family is made up of a coherence with the data term and a term enforcing a roughness penalty and preserving jump discontinuities. Assuming we know the noise variance, an adequacy constraint is also considered. The algorithm computes a member of the family and a minimizer of it which satisfies the constraint. A convergence proof is provided. We then consider a heuristic version of the algorithm which gives restorations of comparable quality whose computational complexity is a linear function of the pixels number. Experimental results on synthetic and real data are presented. Moreover, numerical comparisons with several fast denoising methods are provided.

A fast automatic algorithm for image denoising by a regularization method

Barone P;Caramia M
2005

Abstract

A new fast iterative algorithm is proposed to denoise images affected by Gaussian additive noise, by solving a constrained optimization problem. A family of functionals parameterized by a few hyperparameters already proposed in the literature to solve denoising problems is considered. The algorithm estimates jointly the image and the hyperparameters, therefore providing an automatic method. Each member of the family is made up of a coherence with the data term and a term enforcing a roughness penalty and preserving jump discontinuities. Assuming we know the noise variance, an adequacy constraint is also considered. The algorithm computes a member of the family and a minimizer of it which satisfies the constraint. A convergence proof is provided. We then consider a heuristic version of the algorithm which gives restorations of comparable quality whose computational complexity is a linear function of the pixels number. Experimental results on synthetic and real data are presented. Moreover, numerical comparisons with several fast denoising methods are provided.
2005
Istituto Applicazioni del Calcolo ''Mauro Picone''
Denoising
Steepest descent
Ottimizzazione convessa
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/161713
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact