The problem of restoring images corrupted by Poisson noise is common in many application fields and, because of its intrinsic ill posedness, it requires regularization techniques for its solution. The effectiveness of such techniques depends on the value of the regularization parameter balancing data fidelity and regularity of the solution. Here we consider the Total Generalized Variation regularization introduced in [SIAM J. Imag. Sci, 3(3), 492-526, 2010], which has demonstrated its ability of preserving sharp features as well as smooth transition variations, and introduce an automatic strategy for defining the value of the regularization parameter. We solve the corresponding optimization problem by using a 3-block version of ADMM. Preliminary numerical experiments support the proposed approach.
Di Serafino D., Landi G., Viola M. (2021). TGV-based restoration of Poissonian images with automatic estimation of the regularization parameter. 345 E 47TH ST, NEW YORK, NY 10017 USA : Institute of Electrical and Electronics Engineers Inc. [10.1109/ICCSA54496.2021.00028].
TGV-based restoration of Poissonian images with automatic estimation of the regularization parameter
Di Serafino D.;Landi G.;
2021
Abstract
The problem of restoring images corrupted by Poisson noise is common in many application fields and, because of its intrinsic ill posedness, it requires regularization techniques for its solution. The effectiveness of such techniques depends on the value of the regularization parameter balancing data fidelity and regularity of the solution. Here we consider the Total Generalized Variation regularization introduced in [SIAM J. Imag. Sci, 3(3), 492-526, 2010], which has demonstrated its ability of preserving sharp features as well as smooth transition variations, and introduce an automatic strategy for defining the value of the regularization parameter. We solve the corresponding optimization problem by using a 3-block version of ADMM. Preliminary numerical experiments support the proposed approach.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.