Hierarchical Image Segmentation Based on Semidefinite Programming
Lists
Only you see this
Abstract
Image segmentation based on graph representations has been a very active field of research recently. One major reason is that pairwise similarities (encoded by a graph) are also applicable in general situations where prototypical image descriptors as partitioning cues are no longer adequate. In this context, we recently proposed a novel convex programming approach for segmentation in terms of optimal graph cuts which compares favorably with alternative methods in several aspects. In this paper we present a fully elaborated version of this approach along several directions: first, an image preprocessing method is proposed to reduce the problem size by several orders of magnitude. Furthermore, we argue that the hierarchical partition tree is a natural data structure as opposed to enforcing multiway cuts directly. In this context, we address various aspects regarding the fully automatic computation of the final segmentation. Experimental results illustrate the encouraging performance of our approach for unsupervised image segmentation.
BibTeX
@inproceedings{keuchel2004hierarchical,
author = {Jens Keuchel and Matthias Heiler and Christoph Schnörr},
title = {{Hierarchical Image Segmentation Based on Semidefinite Programming}},
booktitle = {DAGM-Symposium},
year = {2004},
doi = {10.1007/978-3-540-28649-3\_15},
}Loading related content...