Image Smoothing and Segmentation by Graph Regularization
We propose a discrete regularization framework on weighted graphs of arbitrary topology, which leads to a family of nonlinear filters, such as the bilateral filter or the TV digital filter. This framework, which minimizes a loss function plus a regularization term, is parameterized by a weight function defined as a similarity measure. It is applicable to several problems in image processing, data analysis and classification. We apply this framework to the image smoothing and segmentation problems.
Unable to display preview. Download preview PDF.
- 1.Morel, J.M., Solimini, S.: Variational methods in image segmentation. Birkhauser Boston Inc., Cambridge (1995)Google Scholar
- 3.Osher, S., Shen, J.: Digitized PDE method for data restoration. In: Anastassiou, E.G.A. (ed.) Analytical-Computational methods in Applied Mathematics, pp. 751–771. Chapman & Hall/CRC (2000)Google Scholar
- 5.Zhou, D., Schölkopf, 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
- 11.Tomasi, C., Manduchi, R.: Bilateral filtering for gray and color images. In: ICCV 1998: Proceedings of the Sixth International Conference on Computer Vision, Washington, DC, USA, pp. 839–846. IEEE Computer Society, Los Alamitos (1998)Google Scholar