DocumentCode :
2397752
Title :
Constrained image segmentation from hierarchical boundaries
Author :
Arbeláez, Pablo ; Cohen, Laurent
Author_Institution :
California Univ., Berkeley, CA
fYear :
2008
fDate :
23-28 June 2008
Firstpage :
1
Lastpage :
8
Abstract :
In this paper, we address the problem of constrained segmentation of natural images, in which a human user places one seed point inside each object of interest in the image and the task is to determine the object boundaries. For this purpose, we study the connection between seed-based and hierarchical segmentation. We consider an Ultrametric Contour Map (UCM), the representation of a hierarchy of segmentations as a real-valued boundary image. Starting from a set of seed points, we propose an algorithm for constructing Voronoi tessellations with respect to a distance defined by the UCM. As a result, the main contribution of the paper is a method that allows exploiting the information of any hierarchical scheme for constrained segmentation. Our algorithm is parameter-free, computationally efficient and robust. We prove the interest of the approach proposed by evaluating quantitatively the results with respect to ground-truth data.
Keywords :
boundary-value problems; image representation; image segmentation; Voronoi tessellations; constrained image segmentation; hierarchical boundaries; hierarchical segmentation; natural images; real-valued boundary image; seed-based segmentation; ultrametric contour map; Application software; Biomedical imaging; Computer vision; Detectors; Humans; Image segmentation; Markov random fields; Robustness; Surface morphology; Surface topography;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on
Conference_Location :
Anchorage, AK
ISSN :
1063-6919
Print_ISBN :
978-1-4244-2242-5
Electronic_ISBN :
1063-6919
Type :
conf
DOI :
10.1109/CVPR.2008.4587492
Filename :
4587492
Link To Document :
بازگشت