DMCA
Parameterless discrete regularization on graphs for color image filtering (2007)
| Venue: | in Image Analysis and Recognition, ser. Lecture Notes in Computer Science |
| Citations: | 4 - 4 self |
BibTeX
@INPROCEEDINGS{Lezoray07parameterlessdiscrete,
author = {Olivier Lezoray and Sébastien Bougleux and Abderrahim Elmoataz},
title = {Parameterless discrete regularization on graphs for color image filtering},
booktitle = {in Image Analysis and Recognition, ser. Lecture Notes in Computer Science},
year = {2007}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. 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. 1
Keyphrases
color image filtering parameterless discrete regularization general discrete regularization framework classical regularization theory discrete regularization simple anisotropic discrete analogue parameterless filtering image filtering grid graph appropriate energy function color image filtering purpose nonlinear filter discrete regularization framework variational problem weighted graph
