Machine learning foundations· 1984
Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
Resample from local neighbors.
On the reading lists
- #153 in the Top 500 (2026 edition)
- #99 of 100 papers to read in your lifetime (2026 edition)
- #12 in Machine learning foundations (2026 edition)
Why it matters
Popularized Gibbs sampling and Markov random fields for Bayesian image restoration.
Condensed from the expert lists' notes.
Inside the paper
- The problem
- Restoring a degraded image requires choosing a plausible original among many images compatible with noisy observations. A local improvement procedure can become trapped in a solution that is not the most probable overall.
- The idea
- Describe images and their boundaries with a probabilistic model, combine it with a model of degradation, and search for a high-probability restoration using random local updates. Gradually lowering a temperature makes the search increasingly favor better configurations.
- How it works
- Define an image model with local interactions between pixel intensities and boundary elements, and combine it with the likelihood of the observed image.
- At each update, sample a new local value from its conditional distribution given the current neighboring values.
- Use a temperature parameter to control the distribution of updates and reduce it gradually as the process runs.
- Read the resulting image as an estimate of the original; boundary elements help the model represent discontinuities between regions.
- What it showed
- The authors establish convergence results for the sampler and a sufficiently slow cooling schedule under their assumptions. They also show restorations of simple images degraded by noise and blur, including intermediate stages of the search.
- Read it for
- Read Sections II and VIII for the observation and posterior models, then Sections X and XI for the computational method. Section XIII and its figures show the restorations; the detailed proofs in Section XII can wait.
Written in our own words from the paper itself. A draft the editors have not yet reviewed.
Reading it
Difficulty: Advanced
Read this first: Markov random fields; Equation of State Calculations by Fast Computing Machines.
The record
Editor's notes
- Readability check: pass: Introduces the Gibbs sampler; long but foundational. (AI draft (Claude), not yet reviewed, 2026-10-29)
Data sources
Catalogue data from OpenAlex (CC0), Crossref (CC0 metadata; no abstracts are shown), arXiv, and Papers With Code (CC BY-SA 4.0). Each count names its source. See the method.