An Experimental Comparison of Discrete and Continuous Shape Optimization Methods

Maria Klodt, Thomas Schoenemann, Kalin Kolev, Marek Schikora, Daniel Cremers

Abstract

Shape optimization is a problem which arises in numerous computer vision problems such as image segmentation and multiview reconstruction. In this paper, we focus on a certain class of binary labeling problems which can be globally optimized both in a spatially discrete setting and in a spatially continuous setting. The main contribution of this paper is to present a quantitative comparison of the reconstruction accuracy and computation times which allows to assess some of the strengths and limitations of both approaches. We also present a novel method to approximate length regularity in a graph cut based framework: Instead of using pairwise terms we introduce higher order terms. These allow to represent a more accurate discretization of the L 2-norm in the length term.
BibTeX
@inproceedings{klodt2008experimental,
  author = {Maria Klodt and Thomas Schoenemann and Kalin Kolev and Marek Schikora and Daniel Cremers},
  title = {{An Experimental Comparison of Discrete and Continuous Shape Optimization Methods}},
  booktitle = {European Conference on Computer Vision},
  year = {2008},
  doi = {10.1007/978-3-540-88682-2\_26},
}

Loading related content...

Figure