Abstract
In this chapter several variations of the original algorithm are discussed and the concepts of reversible jumps and diffusion are covered. Applications include simple image segmentation, furniture arrangement, and people counting.
Nicholas Metropolis seated with the MANIAC computer in the background.
“Most of us have grown so blase about computer developments and capabilities—even some that are spectacular—that it is difficult to believe or imagine there was a time when we suffered the noisy, painstakingly slow, electromechanical devices that chomped away on punched cards”
– Nicholas Metropolis
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
- 2.
- 3.
We use the term “vertices” instead of “symbols” (in the traditional definition of PCFG) to be consistent with the notations in graphical models.
References
Bremaud P (1999) Markov chains: Gibbs fields, Monte Carlo simulation, and queues, vol 31. Springer, New York
Ching FDK, Binggeli C (2012) Interior design illustrated. Wiley, Hoboken
Diaconis P, Hanlon P (1992) Eigen-analysis for some examples of the metropolis algorithm. Contemp Math 138:99–117
Dongarra J, Sullivan F (2000) Guest editors introduction: the top 10 algorithms. Comput Sci Eng 2(1):22–23
Ge W, Collins RT (2009) Marked point processes for crowd counting. In: CVPR. IEEE, pp 2913–2920
Geman S, Hwang C-R (1986) Diffusions for global optimization. SIAM J Control Optim 24(5):1031–1043
Green PJ (1995) Reversible jump Markov chain monte carlo computation and Bayesian model determination. Biometrika 82(4):711–732
Grenander ULF, Miller MI (1994) Representations of knowledge in complex systems. J R Stat Soc Ser B (Methodol) 56(4):549–603
Han F, Tu Z, Zhu S-C (2004) Range image segmentation by an effective jump-diffusion method. IEEE Trans Pattern Anal Mach Intell 26(9):1138–1153
Hastings WK (1970) Monte carlo sampling methods using Markov chains and their applications. Biometrika 57(1):97–109
Kirkpatrick S, Vecchi MP, et al (1983) Optimization by simulated annealing. Science 220(4598):671–680
Liu JS (1996) Metropolized independent sampling with comparisons to rejection sampling and importance sampling. Stat Comput 6(2):113–119
Maciuca R, Zhu S-C (2006) First hitting time analysis of the independence metropolis sampler. J Theor Probab 19(1):235–261
Mengersen KL, Tweedie RL, et al (1996) Rates of convergence of the hastings and metropolis algorithms. Ann Stat 24(1):101–121
Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953) Equation of state calculations by fast computing machines. J Chem Phys 21(6):1087–1092
Metropolis N, Ulam S (1949) The monte carlo method. J Am Stat Assoc 44(247):335–341
Mitton M, Nystuen C (2011) Residential interior design: a guide to planning spaces. Wiley, Hoboken
Qi S, Zhu Y, Huang S, Jiang C, Zhu S-C (2018) Human-centric indoor scene synthesis using stochastic grammar. In: Conference on computer vision and pattern recognition (CVPR)
Smith RL, Tierney L (1996) Exact transition probabilities for the independence metropolis sampler. Preprint
Tu Z, Zhu S-C (2002) Image segmentation by data-driven markov chain monte carlo. IEEE Trans Pattern Anal Mach Intell 24(5):657–673
Yu L-F, Yeung SK, Tang C-K, Terzopoulos D, Chan TF, Osher S (2011) Make it home: automatic optimization of furniture arrangement. ACM Trans Graph 30(4):86
Zhu S-C, Mumford D (2007) A stochastic grammar of images. Now Publishers Inc, Hanover
Zhu SC, Yuille A (1996) Region competition: unifying snakes, region growing, and bayes/MDL for multiband image segmentation. IEEE Trans Pattern Anal Mach Intell 18(9):884–900
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Barbu, A., Zhu, SC. (2020). Metropolis Methods and Variants. In: Monte Carlo Methods. Springer, Singapore. https://doi.org/10.1007/978-981-13-2971-5_4
Download citation
DOI: https://doi.org/10.1007/978-981-13-2971-5_4
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-2970-8
Online ISBN: 978-981-13-2971-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)