Unsupervised image segmentation using Markov Random Field models
Lecture notes in computer sciencePublished 1 January 1997
Simon A. Barker, P. J. Rayner
Citations19
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
We present an unsupervised segmentation algorithm based on a Markov Random Field model for noisy images. The algorithm finds the the most likely number of classes, their associated model parameters and generates a corresponding segmentation of the image into these classes. This is achieved according to the MAP criterion. To facilitate this, an MCMC algorithm is formulated to allow the direct sampling of all the above parameters from the posterior distribution of the image. To allow the number of classes to be sampled, a reversible jump is incorporated into the Markov Chain. The jump enables the possible splitting and combining of classes and consequently, their associated regions within the image. Experimental results are presented showing rapid convergence of the algorithm to accurate solutions.
Keywords
Computer ScienceMathematics
IEEE Transactions on Pattern Analysis and Machine IntelligenceStochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
17,980 Citations1984Stuart Geman, Donald Geman
The analogy between images and statistical mechanics systems is made and the analogous operation under the posterior distribution yields the maximum a posteriori (MAP) estimate of the image given the degraded observations, creating a highly parallel ``relaxation'' algorithm for MAP estimation.
BiometrikaReversible jump Markov chain Monte Carlo computation and Bayesian model determination
5,929 Citations1995Peter J. Green
A new framework for the construction of reversible Markov chain samplers that jump between parameter subspaces of differing dimensionality is proposed, which is flexible and entirely constructive, and should have wide applicability in model determination problems.
Journal of the Royal Statistical Society Series B (Statistical Methodology)On the Statistical Analysis of Dirty Pictures
4,228 Citations1986Julian Besag
A simple, iterative method of reconstruction is proposed, which does not depend on these large-scale characteristics of the random field, and is illustrated by computer simulations in which the original scene is not directly related to the assumed random field.
The Annals of StatisticsMarkov Chains for Exploring Posterior Distributions
3,472 Citations1994Luke Tierney
This paper outlines some of the basic methods and strategies of Markov chain methods and discusses some related theoretical and practical issues.
Springer series in statisticsIntroduction to Metropolis, Rosenbluth, Rosenbluth, Teller, and Teller (1953) Equations of State Calculations by Fast Computing Machines. J. Chem. Phys.,21, 1087–1092. and Geman and Geman (1984) Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images. IEEE Trans. Pattern Anal. Machine Intelligence,6, 721–741.
1,550 Citations1997Peter J. Huber
On Bayesian Analysis of Mixtures with an Unknown Number of Components
937 Citations1997Sylvia Richardson, Peter J. Green
IEEE Transactions on Pattern Analysis and Machine IntelligenceBoundary detection by constrained optimization
481 Citations1990Donald Geman, Stuart Geman +2 more
A statistical framework is used for finding boundaries and for partitioning scenes into homogeneous regions and incorporates a measure of disparity between certain spatial features of block pairs of pixel gray levels, using the Kolmogorov-Smirnov nonparametric measures of difference between the distributions of these features.
IEEE Transactions on Pattern Analysis and Machine IntelligenceMarkov random field models for unsupervised segmentation of textured color images
419 Citations1995D. Panjwani, Glenn Healey
An unsupervised segmentation algorithm which uses Markov random field models for color textures which characterize a texture in terms of spatial interaction within each color plane and interaction between different color planes is presented.
IEEE Transactions on Pattern Analysis and Machine IntelligenceUnsupervised texture segmentation using Markov random field models
380 Citations1991B.S. Manjunath, Rama Chellappa
The results of the adaptive segmentation algorithm of Lakshamanan and Derin are compared with a simple nearest-neighbor classification scheme to show that if enough information is available, simple techniques could be used as alternatives to computationally expensive schemes.
CVGIP Graphical Models and Image ProcessingUnsupervised segmentation of noisy and textured images using Markov random fields
155 Citations1992Chee Sun Won, Haluk Derin
Special forms of the general unsupervised segmentation algorithm are developed for the segmentation of noisy and textured images, which yield good segmentations, accurate estimates for the parameters, and the correct number of regions.
IEEE Transactions on Image ProcessingA Markov random field model-based approach to unsupervised texture segmentation using local and global spatial statistics
91 Citations1995Charles Kervrann, Fabrice Heitz
An unsupervised texture segmentation method that does not require knowledge about the different texture regions, their parameters, or the number of available texture classes to be known a priori is presented.
CVGIP Graphical Models and Image ProcessingMaximum likelihood unsupervised textured image segmentation
49 Citations1992Fernand S. Cohen, Zhigang Fan
An algorithm for segmenting an image that is composed of an unknown number of regions c and the segmentation Sc, which results into an optimum number of classes c ∗ ; an “optimum” window-based coarse segmentation S c∗ of the image; and a ML estimate of the parameters.
CVGIP Graphical Models and Image ProcessingGibbs Random Fields, Fuzzy Clustering, and the Unsupervised Segmentation of Textured Images
32 Citations1993Khac Hieu Nguyen, Paul R. Cohen
An unsupervised segmentation strategy for textured images, based on a hierarchical model in terms of discrete Markov Random Fields, where the textures are modeled as Gaussian Gibbs Fields, while the image partition is modeled as a Markov Mesh Random Field.
Cluster validation for unsupervised stochastic model-based image segmentation
9 Citations2002David A. Langan, J.W. Modestino +1 more
This work investigates the cluster validation problem associated with the use of a previously developed unsupervised segmentation algorithm based upon the expectation-maximization (EM) algorithm and proposes a model-fitting technique in which the complete data log-likelihood functional is modeled as an exponential function in the number of classes acting, and the class estimate is related to the rise time.