Image Smoothing and Segmentation by Graph Regularization.

Bibliographic Details
Title: Image Smoothing and Segmentation by Graph Regularization.
Authors: Bebis, George, Boyle, Richard, Koracin, Darko, Parvin, Bahram, Bougleux, Sébastien, Elmoataz, Abderrahim
Source: Advances in Visual Computing; 2005, p745-752, 8p
Abstract: 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. [ABSTRACT FROM AUTHOR]
Copyright of Advances in Visual Computing is the property of Springer eBooks and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
DOI: 10.1007/11595755_95
Database: Supplemental Index