Hierarchical segmentation using compound Gauss-Markov random fields

The authors discuss an original approach for segmenting still images. In this approach, the image is initially decomposed in several levels of different resolution. The decomposition that has been chosen is a Gaussian pyramid. At each level of the pyramid, the image is modeled by a compound Gauss-Markov random field and the segmentation is obtained by using a maximum a posteriori criterion. The segmentation is carried out first at the top level of the pyramid. Once a level (l) has been segmented, this segmentation is projected onto the following level below it (l-1). The process is iterated until the segmentation at the bottom level (0) is performed.<<ETX>>

[1]  Edward H. Adelson,et al.  The Laplacian Pyramid as a Compact Image Code , 1983, IEEE Trans. Commun..

[2]  Fure-Ching Jeng,et al.  Inhomogeneous Gaussian image models for estimation and restoration , 1988, IEEE Trans. Acoust. Speech Signal Process..

[3]  John W. Woods,et al.  Compound Gauss-Markov random fields for image estimation , 1991, IEEE Trans. Signal Process..

[4]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  A. Gasull,et al.  Coding-oriented segmentation based on Gibbs-Markov random fields and human visual system knowledge , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.

[6]  Hendrik James Antonisse Image segmentation in pyramids , 1982, Comput. Graph. Image Process..