Abstract

We present an unsupervised segmentation algorithm comprising an annealing process to select the maximum a posteriori (MAP) realization of a hierarchical Markov random field (MRF) model. The algorithm consists of a sampling framework which unifies the processes of model selection, parameter estimation and image segmentation, in a single Markov chain. To achieve this, reversible jumps are incorporated into the Markov chain to allow movement between model spaces. By using partial decoupling to segment the MRF it is possible to generate jump proposals efficiently while providing a mechanism for the use of deterministic methods, such as Gabor filtering, to speed up convergence.

Keywords

Markov random fieldImage segmentationArtificial intelligenceComputer scienceMaximum a posteriori estimationSimulated annealingMarkov chainSegmentationPattern recognition (psychology)Markov processScale-space segmentationRandom fieldComputer visionAlgorithmMathematicsMachine learningMaximum likelihoodStatistics

Affiliated Institutions

Related Publications

Publication Info

Year
2002
Type
article
Volume
5
Pages
2757-2760
Citations
12
Access
Closed

External Links

Social Impact

Altmetric

Social media, news, blog, policy document mentions

Citation Metrics

12
OpenAlex

Cite This

Simon A. Barker, P. J. Rayner (2002). Unsupervised image segmentation. , 5 , 2757-2760. https://doi.org/10.1109/icassp.1998.678094

Identifiers

DOI
10.1109/icassp.1998.678094