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...

Full description

Saved in:
Bibliographic Details
Published in:2008 IEEE Conference on Computer Vision and Pattern Recognition pp. 1 - 8
Main Authors: Duchenne, Olivier, Audibert, Jean-Yves, Keriven, Renaud, Ponce, Jean, Segonne, Florent
Format: Conference Proceeding
Language:English
Published: IEEE 01.06.2008
Subjects:
ISBN:9781424422425, 1424422426
ISSN:1063-6919, 1063-6919
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISBN:9781424422425
1424422426
ISSN:1063-6919
1063-6919
DOI:10.1109/CVPR.2008.4587419