Swendsen-Wang Cuts

Swendsen-Wang Cuts - A fast stochastic graph partition algorithm. that samples a probability model using low level cues to speed up convergence.

Publications:

• L. Ding, A. Barbu. Scalable Subspace Clustering with Application to Motion Segmentation. Current Trends in Bayesian Methodology with Applications, Chapman & Hall/CRC Press. Editors: Dipak K. Dey, Umesh Singh and A. Loganathan. pp 267-286, 2015 (pdf)
• A. Barbu, S.C. Zhu. Generalizing Swendsen-Wang for Image Analysis. J. Comp. Graph. Stat. 16, No 4, 2007 (pdf)
• A. Barbu, S.C. Zhu. Generalizing Swendsen-Wang to sampling arbitrary posterior probabilities, PAMI, 27, August 2005 (pdf)
• A. Barbu, S.C. Zhu. Multigrid and Multi-level Swendsen-Wang Cuts for Hierarchic Graph Partition, CVPR 2004 (pdf)