Graph Partition by Swendsen-Wang Cuts

  • Authors:
  • Adrian Barbu;Song-Chun Zhu

  • Affiliations:
  • -;-

  • Venue:
  • ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Vision tasks, such as segmentation, grouping, recognition, can beformulated as graph partition problems. The recent literaturewitnessed two popular graph cut algorithms: the Ncut using spectralgraph analysis and the minimum-cut using the maximum flowalgorithm. This paper presents a third major approach bygeneralizing the Swendsen-Wang method- a well celebrated algorithmin statistical mechanics. Our algorithm simulates ergodic,reversible Markov chain jumps in the space of graph partitions tosample a posterior probability. At each step, the algorithm splits,merges, or re-groups a sizable subgraph, and achieves fast mixingat low temperature enabling a fast annealing procedure. Experimentsshow it converges in 2-30seconds in a PC for image segmentation.This is 400 times faster than the single-site update Gibbs sampler,and 20-40 times faster than the DDMCMC algorithm. The algorithm canoptimize over the number of models and works for general forms ofposterior probabilities, so it is more general than the existinggraph cut approaches.