Coding-oriented segmentation based on Gibbs-Markov random fields and human visual system knowledge
- 1 January 1991
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2749-2752 vol.4
- https://doi.org/10.1109/icassp.1991.150971
Abstract
A new segmentation algorithm for still black and white images is introduced. This algorithm forms the basis of a region-oriented sequence coding technique, currently under development. The algorithm models the human mechanism of selecting regions both by their interior characteristics and their boundaries. This is carried out in two different stages: with a preprocessing that takes into account only gray level information, and with a stochastic model for segmented images that uses both region interior and boundary information. In the stochastic model, the gray level information within the regions is modeled by stationary Gaussian processes, and the boundary information by a Gibbs-Markov random field (GMRF). The segmentation is carried out by finding the most likely realization of the joint process (maximum a posteriori criterion), given the preprocessed image. For decreasing the computational load while avoiding local maxima in the probability function, suboptimal versions of the algorithm are proposed.Keywords
This publication has 5 references indexed in Scilit:
- Discrete-index Markov-type random processesProceedings of the IEEE, 1989
- Toward the unification of three visual laws and two visual models in brightness perceptionIEEE Transactions on Systems, Man, and Cybernetics, 1989
- A parallel approach to the picture restoration algorithm of Geman and Geman on an SIMD machineImage and Vision Computing, 1986
- Second-generation image-coding techniquesProceedings of the IEEE, 1985
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of ImagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984