Constrained Image Segmentation from Hierarchical Boundaries
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.
Cite
Text
Arbeláez and Cohen. "Constrained Image Segmentation from Hierarchical Boundaries." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2008. doi:10.1109/CVPR.2008.4587492Markdown
[Arbeláez and Cohen. "Constrained Image Segmentation from Hierarchical Boundaries." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2008.](https://mlanthology.org/cvpr/2008/arbelaez2008cvpr-constrained/) doi:10.1109/CVPR.2008.4587492BibTeX
@inproceedings{arbelaez2008cvpr-constrained,
title = {{Constrained Image Segmentation from Hierarchical Boundaries}},
author = {Arbeláez, Pablo and Cohen, Laurent D.},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {2008},
doi = {10.1109/CVPR.2008.4587492},
url = {https://mlanthology.org/cvpr/2008/arbelaez2008cvpr-constrained/}
}