mlsanityData to 14 Oct 2026

A Data-driven Loss Weighting Scheme across Heterogeneous Tasks for Image Denoising

arXiv 2301.06081 ↗First posted 9 Dec 2022eess.IV cs.CVcited by 1

Not on the map. Why?

Abstract (arXiv)

In a variational denoising model, weight in the data fidelity term plays the role of enhancing the noise-removal capability. It is profoundly correlated with noise information, while also balancing the data fidelity and regularization terms. However, the difficulty of assigning weight is expected to be substantial when the noise pattern is beyond independent identical Gaussian distribution, e.g., impulse noise, stripe noise, or a mixture of several patterns, etc. Furthermore, how to leverage weight to balance the data fidelity and regularization terms is even less evident. In this work, we propose a data-driven loss weighting (DLW) scheme to address these issues. Specifically, DLW trains a parameterized weight function (i.e., a neural network) that maps the noisy image to the weight. The training is achieved by a bilevel optimization framework, where the lower level problem is solving several denoising models with the same weight predicted by the weight function and the upper level problem minimizes the distance between the restored image and the clean image. In this way, information from both the noise and the regularization can be efficiently extracted to determine the weight function. DLW also facilitates the easy implementation of a trained weight function on denoising models. Numerical results verify the remarkable performance of DLW on improving the ability of various variational denoising models to handle different complex noise. This implies that DLW has the ability to transfer the noise knowledge at the model level to heterogeneous tasks beyond the training ones and the generalization theory underlying DLW is studied, validating its intrinsic transferability.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 0 of its 8 references that are in the map. First posted on arXiv 9 Dec 2022.

Builds on

0 of 8 references.

No references here yet.

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.