Abstract

A new algorithm for unsupervised textured image segmentation is presented. The image comprises M textured regions, each of which is modeled by a stationary Gaussian Markov random field. A feature vector is computed for each pixel in the original image where these vectors are normally distributed and cluster about some vector means. Thus, the problem is reduced to one of restoring a vector valued underlying field embedded in additive Gaussian noise. The vector means corresponding to the different regions are estimated by using the expectation-maximization (EM) algorithm. An iterative algorithm is used with the underlying field modeled as a multilevel logistic Markov random field. The results obtained on two-region and four-region textured images are impressive, and the classification error is less than 3%. The algorithm is not limited to textured images but can also be applied to any vector-valued signals. >

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.