Elsevier

Pattern Recognition

Volume 34, Issue 11, November 2001, Pages 2071-2082
Pattern Recognition

Self-supervised texture segmentation using complementary types of features

https://doi.org/10.1016/S0031-3203(00)00146-1Get rights and content

Abstract

A two-stage texture segmentation approach is proposed where an initial segmentation map is obtained through unsupervised clustering of multiresolution simultaneous autoregressive (MRSAR) features and is followed by self-supervised classification of wavelet features. The regions of “high confidence” and “low confidence” are identified based on the MRSAR segmentation result using multilevel morphological erosion. The second-stage classifier is trained by the “high-confidence” samples and is used to reclassify only the “low-confidence” pixels. The proposed approach leverages on the advantages of both MRSAR and wavelet features. Experimental results show that the misclassification error can be significantly reduced by using complementary types of texture features.

Introduction

Texture is a fundamental characteristic of natural images that, in addition to color, plays an important role in human visual perception and provides information for image understanding and scene interpretation. A large volume of research over the past three decades has addressed the problem of texture segmentation and has produced a number of review articles and comparative studies [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12]. Unsupervised image segmentation may be defined as the problem of separating image regions of uniform texture without prior knowledge of the texture types. Texture segmentation does not pose the same problem as texture differentiation or classification, where a supervised system is trained to differentiate between known textures. Texture differentiation is useful in constrained environments where a limited number of textures is encountered; however, the number of textures in natural images is huge and, in general, the types of textures present in a particular image are not known a priori.

Much of the texture segmentation work has concentrated on extracting features that are suitable for texture modeling, followed by feature clustering or classification so that image regions of uniform texture may be identified [13]. Classic texture features include those derived from Laws filters [14], co-occurrence matrices (CO) [15], [16], and cortex transform modulation functions (CTMF) [17]. More recently, a number of new texture features have been considered for texture analysis and segmentation, including multiresolution simultaneous autoregressive (MRSAR) models [18], [19], [20], Markov random field (MRF) models [21], [22], [23], [24] Gabor filters [25], [26], wavelet coefficients [27], [28], [29], [30], and fractal dimension [21], [31]. The results of comparing the relative merits of the different types of features have been nonconclusive and a clear winner has not emerged in all cases [12]. In general, each set of texture features offers unique advantages but also has limitations compared to other feature types.

Meanwhile, one common problem in using feature clustering for image segmentation is that noise in the extracted features may result in misclassification, which takes the form of holes and other fragments [32]. When trying to minimize the problem due to noisy features, another interesting yet challenging problem in texture segmentation is encountered, which may be described as the boundary effect. It usually appears as inaccurate segmentation of boundaries or superfluous narrow regions at the boundary between two textures [18], [32]. It is conjectured that the boundary effect is caused by misclassification when the trajectory of the feature vectors makes a transition through feature space [26]. To make matters worse, the misclassification may be interpreted as a third texture, depending on the nature of the features for a particular image.

The use of multiple types of features in texture segmentation may be exploited to take full advantage of the strengths of each feature type and alleviate some of the problems, such as the boundary ambiguity encountered when the segmentation is based on a single feature type. Ideally, one would like to select complementary types of features that are not highly correlated and, when combined, can improve the final segmentation result [10]. One method of combining two types of features is to concatenate the feature vectors and perform the classification step on the augmented feature set. This method has been used for combining texture and color features [33] as well as texture features of different types [10]. When this approach is taken, one has to worry about normalization issues and the relative weighting of the features in each feature set, since in most cases the number of parameters in the different feature sets is not equal. In addition, by concatenating all the features into a single vector, the segmentation result is based on a global clustering criterion, even though it may be more suitable to constrain clustering of certain features to a local neighborhood.

A second approach in combining different types of features is to perform a segmentation for each of the feature sets independently, and then combine the segmentation maps into one. The difficulty with this approach is coming up with a selection rule for assigning the appropriate segmentation labels to the final segmentation result, where segmentation maps disagree with each other. The simple rule of assuming that there is a texture boundary in the final segmentation map everywhere that a texture boundary appears in any of the individual segmentation maps does not work well because it results in over-segmentation.

In this paper, a two-stage approach to texture segmentation is proposed where, after the initial segmentation, potential problem regions are identified and reclassified through a second stage of refinement. The first stage of segmentation is based on MRSAR features and a global clustering criterion. The second stage is based on self-supervised clustering of wavelet coefficients applied on the regions of low confidence of the segmentation map. The proposed method can be considered as a novel way of combining different types of texture features. In the next section, the initial segmentation method is described, where an improved way of normalizing MRSAR features is utilized for improved results. In Section 3, a method for extracting the segmentation confidence map using morphological operations is discussed. The segmentation refinement process based on wavelet features is presented in Section 4. Finally, 5 Discussion and conclusions, 6 Summary include experimental results and discussions, respectively.

Section snippets

Initial segmentation using MRSAR coefficients

The simultaneous autoregressive (SAR) model for image representation is formulated byf(i,j)=(p,q)∈Rα(p,q)f(i+p,j+q)+w(i,j)where f(i,j) denotes the intensity of an image pixel at location (i,j), α(p,q) denotes a weighting coefficient, R is the neighborhood region, and w(i,j) is zero-mean Gaussian noise with variance σ2. Note that the mean value of the image intensity has been subtracted. For a given neighborhood R, the model parameters α(p,q) and σ may be computed via least-squares estimation

Boundary refinement

In this section, three alternate methods for texture boundary refinement are described and compared:

(a)boundary refinement using morphological operations;
(b)refinement using adjustable window size; and
(c)self-supervised refinement by wavelet-based reclassification of the low-confidence regions.

It should be noted that the proposed two-stage classification method in (c) may be viewed as a process of combining complementary texture features, as discussed in Section 1.

Experimental results

The results are based on texture mosaic images composed of patterns from the Brodatz set [37] and the VisTex natural scene collection by MIT,1 where the size of each uniform texture patch is 128×128. The uncertainty maps are created by “m-ary” morphological erosion operations. The segmentation results by either MRSAR or wavelet features are obtained using a k-means clustering algorithm. In general, the segmentation maps by

Discussion and conclusions

A two-stage approach to texture segmentation was proposed in this paper, for taking advantage of the relative strengths in different feature types. The two-stage scheme presented in this paper can be generalized beyond MRSAR and wavelet features. The criterion for selecting two sets of features could be based on the following rule: the first set of features that is used for the initial segmentation should have high signal-to-noise ratio in the interior of homogeneous textured regions while the

Summary

A number of different features have been used for texture segmentation in the past, however, no single type of feature has emerged as a clear winner in all cases. Complementary types of features, when carefully chosen, may be used jointly to improve the segmentation results obtained by using any single one of the feature types. In particular, multiresolution simultaneous autoregressive (MRSAR) and wavelet features may be viewed as complementary, in the sense that MRSAR features have large

About the Author—JIEBO LUO received the B.S. and M.S. degrees in electrical engineering from the University of Science and Technology of China, Hefei, China, in 1989 and 1992, respectively. In 1995, he received the Ph.D. degree in electrical engineering from the University of Rochester, Rochester, NY. He was a Research Assistant in the Image Processing Laboratory and the NSF Center for Electronic Imaging Systems at the University of Rochester, from September 1992 to November 1995. In the summer

References (37)

  • A.K. Jain et al.

    Unsupervised texture segmentation using Gabor filters

    Pattern Recognition

    (1991)
  • J.M. Keller et al.

    Texture description and segmentation through fractal geometry

    CVGIP: Graphical Models and Image Process.

    (1989)
  • J. Weszka et al.

    A comparative study of texture measures for terrain classification

    IEEE Trans. System, Man, Cybernetics

    (1976)
  • R.M. Haralick

    Statistical and structural approaches to texture

    Proc. IEEE

    (1979)
  • R.W. Conners et al.

    A theoretical comparison of texture algorithms

    IEEE Trans. Pattern Anal. Mach. Intell.

    (1980)
  • L.V. Gool et al.

    Texture analysis anno

    CVGIP: Graphical Models and Image Processing

    (1985)
  • K.I. Chang, K.W. Bowyer, M. Sivagurunath, Evaluation of texture segmentation algorithms, Proceedings of IEEE...
  • T. Randen et al.

    Filtering for texture classification

    IEEE Trans. Pattern Anal. Mach. Intell.

    (1999)
  • Cited by (0)

    About the Author—JIEBO LUO received the B.S. and M.S. degrees in electrical engineering from the University of Science and Technology of China, Hefei, China, in 1989 and 1992, respectively. In 1995, he received the Ph.D. degree in electrical engineering from the University of Rochester, Rochester, NY. He was a Research Assistant in the Image Processing Laboratory and the NSF Center for Electronic Imaging Systems at the University of Rochester, from September 1992 to November 1995. In the summer of 1995, he was employed at the Joseph C. Wilson Center for Technology of Xerox Corporation, Webster, NY. In 1995, he became a Senior Research Scientist, and is currently a Research Associate in the Imaging Science Technology Laboratory, Imaging Research and Advanced Development, Eastman Kodak Company, Rochester, NY. His research interests include image enhancement and manipulation, digital photography, image and video coding, wavelets and applications, medical imaging, pattern recognition, and computer vision. He has authored over 50 technical papers, and over 10 issued or pending US and European patents. Dr. Luo was the recipient of the Best Student Paper Award for Visual Communication and Image Processing from SPIE in 1994, and a Certificate of Merit for Scientific Exhibit from RSNA in 1998. He has been serving the Rochester Section of the IEEE Signal Processing Society as an officer for the past two years, and was the General Co-Chair of the 2000 IEEE Western New York Workshop on Image Processing. Dr. Luo is a Senior Member of the IEEE and a member of SPIE.

    About the Author—ANDREAS SAVAKIS received the B.S. (Summa Cum Laude) and the M.S. degrees in Electrical Engineering from Old Dominion University in 1984 and 1986 respectively, and the Ph.D. in Electrical Engineering from North Carolina State University in 1991. From 1991 to 1996 he was a Research Scientist at the University of Rochester where he conducted research in the areas of pattern recognition, infrared imaging, digital radiography, and human vision. In 1996, he joined the Eastman Kodak Company and worked at the Business Imaging Division and the Research Laboratories. His research at Kodak involved algorithm development for high-speed scanners, image understanding and multimedia applications. Since Spring 2000 he is Associate Professor at the Computer Engineering Department of the Rochester Institute of Technology, where he currently serves as the department head. His current research interests include image segmentation, scene classification and hardware implementation of imaging algorithms. Dr. Savakis is a Senior Member of the IEEE and member of Eta Kappa Nu, Tau Beta Pi, and Sigma Xi.

    View full text