Issue No. 05 - May (1991 vol. 13)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.134046
<p>The problem of unsupervised segmentation of textured images is considered. The only explicit assumption made is that the intensity data can be modeled by a Gauss Markov random field (GMRF). The image is divided into a number of nonoverlapping regions and the GMRF parameters are computed from each of these regions. A simple clustering method is used to merge these regions. The parameters of the model estimated from the clustered segments are then used in two different schemes, one being all approximation to the maximum a posterior estimate of the labels and the other minimizing the percentage misclassification error. The proposed approach is contrasted with the algorithm of S. Lakshamanan and H. Derin (1989), which uses a simultaneous parameter estimation and segmentation scheme. The results of the adaptive segmentation algorithm of Lakshamanan and Derin are compared with a simple nearest-neighbor classification scheme to show that if enough information is available, simple techniques could be used as alternatives to computationally expensive schemes.</p>
unsupervised texture segmentation; picture processing; pattern recognition; Gauss Markov random field; Markov processes; parameter estimation; pattern recognition; picture processing
R. Chellappa and B. Manjunath, "Unsupervised Texture Segmentation Using Markov Random Field Models," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 13, no. , pp. 478-482, 1991.