Elsevier

Pattern Recognition

Volume 35, Issue 4, April 2002, Pages 771-782
Pattern Recognition

MRF-based texture segmentation using wavelet decomposed images

https://doi.org/10.1016/S0031-3203(01)00077-2Get rights and content

Abstract

In recent textured image segmentation, Bayesian approaches capitalizing on computational efficiency of multiresolution representations have received much attention. Most of the previous researches have been based on multiresolution stochastic models which use the Gaussian pyramid image decomposition. In this paper, motivated by nonredundant directional selectivity and highly discriminative nature of the wavelet representation, we present an unsupervised textured image segmentation algorithm based on a multiscale stochastic modeling over the wavelet decomposition of image. The model, using doubly stochastic Markov random fields, captures intrascale statistical dependencies over the wavelet decomposed image and intrascale and interscale dependencies over the corresponding multiresolution region image.

Introduction

An important problem in image processing is segmentation of an image into disjoint regions which may possess the same average gray level but differ in the spatial distribution of gray levels (texture). Segmentation of images based on textural features is a critical preliminary operation in various image processing applications ranging from computer vision to remote sensing. In the last decade, there has been considerable interest in Bayesian estimation techniques in conjunction with Markov random fields (MRFs) for segmenting textured images. These methods use distinct stochastic processes to model textures covering each region and typically an MRF with smooth spatial behavior to model a region image. Segmentation of an image is then achieved by finding an approximate Maximum a posteriori (MAP) estimate of the unknown region image given the observed image.

Recently, motivated by the importance of utilizing information at various scales, a number of authors proposed multiresolution approaches to textured image segmentation, mainly to capitalize on computational efficiency of multiresolution models. Multiresolution approaches make it possible to capture and utilize correlations over a set of neighborhoods of increasing size by making use of multiresolution representations for the region image and single [1], [2] or multiresolution representations [3], [4] for the observed image. Bouman et al. [1] used a Gaussian autoregressive model for the observed image. The MAP estimate of the region image at the coarsest resolution is approximated first, using iterated conditional modes (ICM) [5], and the result is then used as an initial condition for segmentation at the next finer level of resolution, and the process is continued until individual pixels are classified at the finest resolution. Krishnamachari et al. [3] used a Gauss Markov random field (GMRF) to model the observed image at each resolution with the assumption that the random variables at a given resolution are independent of the random variables at other levels. It was assumed that the GMRF parameters at the finest resolution are known. The MAP estimate is approximated at each resolution using ICM first at the coarsest level and then progressively at finer levels. Comer et al. [4] proposed a multiresolution Gaussian autoregressive model for the observed image which takes into account the correlation between adjacent levels of resolutions. It was assumed that the parameters of the Gibbs distribution of the region process are known. Segmentation is achieved there as the maximum posterior marginals (MPM) estimate rather than the MAP estimate.

Most of the previous multiresolution approaches, however, have been based on modeling of the region and/or observed image over the lattice structure which corresponds to the Gaussian pyramid decomposition [6] of the observed image. In this paper, we propose a multiresolution Bayesian approach based on modeling over the lattice structure which corresponds to the wavelet decomposition [7] of the observed image. The wavelet decomposition of an image, as opposed to the Gaussian pyramid decomposition, results in nonredundant and direction (horizontal, vertical, diagonal) sensitive features at different scales and hence allows more selective feature extraction in space-frequency domain. It might also be easier to model the nonredundant and direction sensitive subbands of a wavelet decomposed image than to model each subband of a Gaussian pyramid decomposed image where the image at a resolution contains all the information in the lower resolutions.

The proposed modeling scheme captures, over the wavelet pyramidal lattice, significant intrascale and interscale statistical dependencies in the region image and intrascale statistical dependencies in the observed image, using doubly stochastic MRFs. To estimate model parameters, a version of the expectation-maximization (EM) algorithm [8] is used where the Baum function is approximated using the mean-field-based decomposition of a posteriori probability of the region process [9]. The mean-field-based decomposition is also used in finding the MAP estimate of the region process.

The paper is organized as follows. In Section 2, a doubly stochastic MRF model, usually used to model textured images, is described. The proposed multiscale stochastic model of textured images in wavelet domain is presented in Section 3. The corresponding EM-based parameter estimation and MAP-based image segmentation algorithms are given in Section 4. Simulation results are given in Section 5, followed by concluding results in Section 6.

Section snippets

Ordinary textured image modeling

An image consisting of different regions of textures is usually modeled by a hierarchical Markov random field (HMRF) which consists of two layers. In the following we give a brief description of MRF and the HMRF and then introduce a typical specific model for textured images.

Image modeling in wavelet domain

Let yL denote the original image and wL=W(yL) the J-level wavelet transformed image. In what follows, we model the collection of two interacting random variables (xL,wL), which form a doubly stochastic random process, using HMRFs. For the J-level wavelet transform, the lattice L can be decomposed asL={LL(J),LH(J),HL(J),HH(J),…,LH(1),HL(1),HH(1)}which corresponds to 3J+1 subbands of the decomposed image wL. Here the first L or H, respectively refers to a low or high frequency passband in the

Unsupervised segmentation algorithm

We have already proposed an unsupervised textured image segmentation method where the mean-field-based decomposition of a posteriori probability is used for parameter estimation and image segmentation [9]. Image segmentation for wavelet transformed images can follow the method for original images, although the procedures for wavelet transformed images become more complex.

Simulation results

To evaluate the performance of the proposed unsupervised segmentation method, we applied the method to seven 256×256 images shown in Figs. 2(a) 3 4 5 6 7 8(a). Among them, Figs. 2(a)–6(a) are synthesized textured images consisting of three natural textures from the Brodatz album [13]. All part (b)s of the figures are derived segmentation results using given original images, part (c)s are those using only the LL(1) subimage wLL(1), part (d)s are those using four decomposed subimages of the

Conclusions

In this paper, we presented a wavelet-based multiresolution Bayesian approach to the problem of segmenting textured images. The approach makes use of the modeling power of MRF models and the multiscale and highly discriminative nature of the wavelet representation, and underlies a multiscale segmentation algorithm which, as shown by experimental results, uses effectively the statistical regularities over multiple scales. Incorporating interscale correlations, which exist over wavelet

Acknowledgements

This work was partly supported by Basic Research 21 for Breakthroughs in Info-communication Project of Japan Ministry of Posts and Telecommunications.

About the Author—HIDEKI NODA received B.E. and M.E. in Electronics Engineering from Kyushu University, Japan, in 1973 and 1975, respectively, and Dr. Eng. degree in Electrical Engineering from Kyushu Institute of Technology, Japan, in 1993. He worked in Daini-Seikosha Ltd. from 1975 to 1978, in National Research Institute of Police Science, Japan National Police Agency from 1978 to 1989 and then in Communications Research Laboratory, Japan Ministry of Posts and Telecommunications from 1989 to

References (15)

  • C.S. Won et al.

    Unsupervised segmentation of noisy and textured images using Markov random fields

    CVGIP: Graphical Models Image Process.

    (1992)
  • C.A. Bouman et al.

    Multiple resolution segmentation of textured images

    IEEE Trans. Pattern Anal. Mach. Intell.

    (1991)
  • C.A. Bouman et al.

    A multiscale random field model for Bayesian image segmentation

    IEEE Trans. Image Process.

    (1994)
  • S. Krishnamachari, R. Chellappa, Multiresolution Gauss Markov random field models, Technical Report, University of...
  • M.L. Comer et al.

    Segmentation of textured images using a multiresolution Gaussian autoregressive model

    IEEE Trans. Image Process.

    (1999)
  • J.E. Besag

    On the statistical analysis of dirty pictures

    J. Roy. Stat. Soc. B

    (1986)
  • P.J. Burt et al.

    The Laplacian pyramid as a compact image mode

    IEEE Trans. Commun.

    (1983)
There are more references available in the full text version of this article.

Cited by (72)

  • Hierarchical semantic model and scattering mechanism based PolSAR image classification

    2016, Pattern Recognition
    Citation Excerpt :

    However, they are difficult to distinguish the hybrid type from other ground objects for PolSAR images as the imaging mechanisms between them are totally different. ( 3) Regularization criterion based approaches, such as Markov Random Field (MRF)[13–15] and contour criterion [16–18]. ( 4) Bayesian models based approaches [19–21], such as the non-Gaussian models [22,23].

  • Image segmentation based on hierarchical belief propagation with variable weighting parameters

    2014, Optik
    Citation Excerpt :

    The purpose of segmentation is to partition an image into several homogeneous regions. Many approaches have been proposed to solve this problem, such as the Markov Random Field (MRF) model [9–12], the threshold method [7,13], the active contour and level set-based method [14–16], mean shift [17,18] etc. Among these methods, Markov random field (MRF) model has been widely employed for its intrinsic capability of coping with the presence of noise and reducing the impact of intraclass variations.

  • Multigranularity Multiclass-Layer Markov Random Field Model for Improving Remote Sensing Image Classification

    2022, 2021 IEEE 23rd International Conference on High Performance Computing and Communications, 7th International Conference on Data Science and Systems, 19th International Conference on Smart City and 7th International Conference on Dependability in Sensor, Cloud and Big Data Systems and Applications, HPCC-DSS-SmartCity-DependSys 2021
View all citing articles on Scopus

About the Author—HIDEKI NODA received B.E. and M.E. in Electronics Engineering from Kyushu University, Japan, in 1973 and 1975, respectively, and Dr. Eng. degree in Electrical Engineering from Kyushu Institute of Technology, Japan, in 1993. He worked in Daini-Seikosha Ltd. from 1975 to 1978, in National Research Institute of Police Science, Japan National Police Agency from 1978 to 1989 and then in Communications Research Laboratory, Japan Ministry of Posts and Telecommunications from 1989 to 1995. In 1995, he moved to Kyushu Institute of Technology where he is now an associate professor in the Department of Electrical, Electronic & Computer Engineering. His research interests include speaker and speech recognition, image processing and neural networks.

About the Author—MAHDAD NOURI SHIRAZI was born in 1963 in Iran. He received his M.Sc and Ph.D degrees in Electrical Engineering from Tottori University and Kobe University, Japan, respectively. In 1993 he became a post-doctoral research fellow at the Communications Research Laboratory of Japan Ministry of Posts and Telecommunications, funded by the Japan Science and Technology Agency. Since 1995 he has been at the same laboratory, currently as a senior research scientist. His research interests include neural networks, pattern recognition, and image processing.

About the Author—EIJI KAWAGUCHI received the Dr. Eng. degree from the Department of Electronics Engineering at Kyushu University, Japan in 1971. Currently, he is a professor of Computer Engineering at Kyushu Institute of Technology. His research interests include speech recognition, pattern understanding, image processing and knowledge engineering as well as natural language understanding and semantic modeling.

View full text