Parameterless discrete regularization on graphs for color image filtering
Résumé
A discrete regularization framework on graphs is proposed and studied for color image filtering purposes when images are represented by grid graphs. Image filtering is considered as a variational problem which consists in minimizing an appropriate energy function. In this paper, we propose a general discrete regularization framework defined on weighted graphs which can be seen as a discrete analogue of classical regularization theory. With this formulation, we propose a family of fast and simple anisotropic linear and nonlinear filters. The parameters of the proposed discrete regularization are estimated to have a parameterless filtering.
Domaines
Traitement des images [eess.IV]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...