Abstract
The segmentation of a gray scale image of regions of uniform or slowly varying intensity is discussed. A Gibbsian representation is given for a partition of a lattice with no labels. The homogeneity of each segment is measured by the sample variance of observations. In a region merging algorithm, the posterior probability of the segmentation is gradually increased. It is shown how to simulate partitions with the Gibbs sampler and how to combine information in simulated segmentations. When the segments cannot be grouped into genuine classes, the segmentation methods are preferable to classification by Iterated Conditional Modes (ICM) or by the Maximizer of Posterior Marginals (MPM).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
