Graph partition by Swendsen-Wang cuts

Proceedings of the IEEE International Conference on Computer Vision

Volumn 1, Issue , 2003, Pages 320-329

  Barbu, Adrian ^a   Zhu, Song Chun ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; GRAPH THEORY; IMAGE SEGMENTATION; MATHEMATICAL MODELS; OPTIMIZATION; PERSONAL COMPUTERS; PROBABILITY; SPECTRUM ANALYSIS;

GRAPH PARTITION PROBLEMS; SPECTRAL GRAPH ANALYSIS; SWENDSEN-WANG METHOD;

COMPUTER VISION;

EID: 0344120271     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/iccv.2003.1238362     Document Type: Conference Paper

References (12)

1. P. J. Green, "Reversible jump MCMC comput. and Bayes. model determination", Biometrika, 82, 711-32 1995
2. T. Hofmann, J.M. Buhmann, "Pairwise data clustering by deterministic annealing", PAMI, 19(1), 1-14, 1997.
3. A.K. Jain, R. Dubes, Algorithms for Clustering Data, Prentice Hall, Englewood Cliffs, NJ, 1988.
4. S. Geman, D. Geman, "Stochastic relaxation, Gibbs distrib., Bayesian restoration of img", PAMI, vol. 6, 721-741, 1984.
5. S. Kirkpatrick, C. Gelatt, M. Vecchi, "Optimization by simulated annealing", Science, 220(4598), 671-680, 1983.
6. V. Kolmogorov, R. Zabih, "What energy functions can be min. via graph cuts?", ECCV, 2002
7. N. Metropolis, et al. "Eqns of the state calculation by fast computing machines", J. Chem. Phys, 21, 1087-91, 1953.
8. S. Roy, I. Cox, "A max-flow formulation of the n-camera stereo correspondence problem", ICCV, 1998.
9. J. Shi, J. Malik, "Normalized cuts and image segmentation", PAMI, 22, no 8, pp. 888-905, 2000.
10. Z.W. Tu, S. C. Zhu, "Image segmentation by data-driven MCMC", PAMI, 24, no. 5, 2002.
11. R.H. Swendsen, J.S. Wang, "Nonuniversal critical dynamics in MC simulations", Phys. Rev. Lett., 58 no. 2, pp.86-88, 1987
12. Z. Wu and R. Leahy, "An optimal graph theoretic approach to data clustering PAMI, vol.15, 1101-1113, 1993.