The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Bayes Smoothing Algorithms for Segmentation of Binary Images Modeled by Markov Random Fields
Abstract
A new image segmentation algorithm is presented, based on recursive Bayes smoothing of images modeled by Markov random fields and corrupted by independent additive noise. The Bayes smoothing algorithm yields the a posteriori distribution of the scene value at each pixel, given the total noisy image, in a recursive way. The a posteriori distribution together with a criterion of optimality then determine a Bayes estimate of the scene. The algorithm presented is an extension of a 1-D Bayes smoothing algorithm to 2-D and it gives the optimum Bayes estimate for the scene value at each pixel. Computational concerns in 2-D, however, necessitate certain simplifying assumptions on the model and approximations on the implementation of the algorithm. In particular, the scene (noiseless image) is modeled as a Markov mesh random field, a special class of Markov random fields, and the Bayes smoothing algorithm is applied on overlapping strips (horizontal/vertical) of the image consisting of several rows (columns). It is assumed that the signal (scene values) vector sequence along the strip is a vector Markov chain. Since signal correlation in one of the dimensions is not fully used along the edges of the strip, estimates are generated only along the middle sections of the strips. The overlapping strips are chosen such that the union of the middle sections of the strips gives the whole image. The Bayes smoothing algorithm presented here is valid for scene random fields consisting of multilevel (discrete) or continuous random variables.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Beitrag zur Theorie des Ferromagnetismus
Ising, E. (1925) · Zeitschrift für Physik · doi:10.1007/bf02980577 · Cited by 3,871
Cited by
On the Statistical Analysis of Dirty Pictures
Besag, J. (1986) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1986.tb01412.x · Cited by 4,191
Modeling and Segmentation of Noisy and Textured Images Using Gibbs Random Fields
Derin, H., & Elliott, H. (1987) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1987.4767871 · Cited by 977
Self-citationA generalized Gaussian image model for edge-preserving MAP estimation
Bouman, C., & Sauer, K. (1993) · IEEE Transactions on Image Processing · doi:10.1109/83.236536 · Cited by 884
A local update strategy for iterative reconstruction from projections
Sauer, K., & Bouman, C. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.193196 · Cited by 494
Random field models in image analysis
Dubes, R. C., & Jain, A. K. (1989) · Journal of Applied Statistics · doi:10.1080/02664768900000014 · Cited by 418
Metadata
- Authors
- Derin, H., Elliott, H., Cristi, R., & Geman, D.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1984-11
- Volume
- PAMI-6
- Issue
- 6
- Pages
- 707-720
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2088059995
- Cited by
- 196
- References
- 1
- FWCI
- 7.07
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Bayes Smoothing Algorithms for Segmentation of Binary Images Modeled by Markov Random Fields. https://app.cochat.ai/papers/10.1109/tpami.1984.4767595
- The paper
- Derin, H., Elliott, H., Cristi, R., & Geman, D. (1984). Bayes Smoothing Algorithms for Segmentation of Binary Images Modeled by Markov Random Fields. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/tpami.1984.4767595
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.