Dyadic partition-based training schemes for TV/TGV denoising
From MaRDI portal
Publication:6510076
arXiv2305.07150MaRDI QIDQ6510076FDOQ6510076
Authors: Elisa Davoli, Rita Ferreira, Irene Fonseca, José A. Iglesias 
Abstract: Due to their ability to handle discontinuous images while having a well-understood behavior, regularizations with total variation (TV) and total generalized variation (TGV) are some of the best-known methods in image denoising. However, like other variational models including a fidelity term, they crucially depend on the choice of their tuning parameters. A remedy is to choose these automatically through multilevel approaches, for example by optimizing performance on noisy/clean image pairs. In this work, we consider such methods with space-dependent parameters which are piecewise constant on dyadic grids, with the grid itself being part of the minimization. We prove existence of minimizers for fixed discontinuous parameters, that box constraints for the values of the parameters lead to existence of finite optimal partitions, and converse results for well-prepared data. On the numerical side, we consider a simple subdivision scheme for optimal partitions built on top of any other bilevel optimization method for scalar parameters, and demonstrate its improved performance on some representative test images when compared with constant optimized parameters.
Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computing methodologies for image processing (68U10) Functions of bounded variation, generalizations (26A45) Existence theories for free problems in two or more independent variables (49J10)
This page was built for publication: Dyadic partition-based training schemes for TV/TGV denoising
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6510076)
