Parameterless Discrete Regularization on Graphs for Color Image Filtering
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.
KeywordsWeight Function Color Image Weighted Graph Impulse Noise Restore Image
Unable to display preview. Download preview PDF.
- 2.Chan, T., Shen, J.: Image Processing and Analysis - Variational, PDE, wavelet, and stochastic methods. SIAM (2005)Google Scholar
- 6.Zhou, D., Scholkopf, B.: A regularization framework for learning from graph data. In: ICML Workshop on Statistical Relational Learning and Its Connections to Other Fields, pp. 132–137 (2004)Google Scholar
- 7.Lezoray, O., Bougleux, S., Elmoataz, A.: Graph regularization for color image processing. Computer Vision and Image Understading (in press) (2007)Google Scholar
- 13.Buades, A., Coll, B., Morel, J.: A non local algorithm for image denoising. In: IEEE Int. Conf. on Computer Vision and Pattern Recognition, vol. 2, pp. 60–65. IEEE Computer Society Press, Los Alamitos (2005)Google Scholar