Segmentation by transduction - École des Ponts ParisTech Access content directly
Conference Papers Year : 2008

Segmentation by transduction


This paper addresses the problem of segmenting an image into regions consistent with user-supplied seeds (e.g., a sparse set of broad brush strokes). We view this task as a statistical transductive inference, in which some pixels are already associated with given zones and the remaining ones need to be classified. Our method relies on the Laplacian graph regularizer, a powerful manifold learning tool that is based on the estimation of variants of the Laplace-Beltrami operator and is tightly related to diffusion processes. Segmentation is modeled as the task of finding matting coefficients for unclassified pixels given known matting coefficients for seed pixels. The proposed algorithm essentially relies on a high margin assumption in the space of pixel characteristics. It is simple, fast, and accurate, as demonstrated by qualitative results on natural images and a quantitative comparison with state-of-the-art methods on the Microsoft GrabCut segmentation database.
Fichier principal
Vignette du fichier
CVPR08a.pdf (558.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00834989 , version 1 (18-06-2013)



Olivier Duchenne, Jean-Yves Audibert, Renaud Keriven, Jean Ponce, Florent Ségonne. Segmentation by transduction. CVPR 2008 - IEEE Conference on Computer Vision and Pattern Recognition, Jun 2008, Anchorage, United States. pp.1-8, ⟨10.1109/CVPR.2008.4587419⟩. ⟨hal-00834989⟩
348 View
392 Download



Gmail Facebook X LinkedIn More