Unsupervised Image Partitioning with Semidefinite Programming

Jens Keuchel, Christoph Schnörr, Christian Schellewald, Daniel Cremers

Abstract

We apply a novel optimization technique, semidefinite programming, to the unsupervised partitioning of images. Representing images by graphs which encode pairwise (dis)similarities of local image features, a partition of the image into coherent groups is computed by determining optimal balanced graph cuts. Unlike recent work in the literature, we do not make any assumption concerning the objective criterion like metric pairwise interactions, for example. Moreover, no tuning parameter is necessary to compute the solution. We prove that, from the optimization point of view, our approach cannot perform worse than spectral relaxation approaches which, conversely, may completely fail for the unsupervised choice of the eigenvector threshold.
BibTeX
@inproceedings{keuchel2002unsupervised,
  author = {Jens Keuchel and Christoph Schnörr and Christian Schellewald and Daniel Cremers},
  title = {{Unsupervised Image Partitioning with Semidefinite Programming}},
  booktitle = {DAGM-Symposium},
  year = {2002},
  doi = {10.1007/3-540-45783-6\_18},
}

Loading related content...

Figure