Unsupervised color-texture image segmentation
β Scribed by Sheng-yang Yu; Yan Zhang; Yong-gang Wang; Jie Yang
- Publisher
- Chinese Electronic Periodical Services
- Year
- 2008
- Tongue
- English
- Weight
- 378 KB
- Volume
- 13
- Category
- Article
- ISSN
- 1007-1172
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The K-means Iterative Fisher (KIF) algorithm is a robust, unsupervised clustering algorithm applied here to the problem of image texture segmentation. The KIF algorithm involves two steps. First, K-means is applied. Second, the K-means class assignments are used to estimate parameters required for a
We derive real-time global optimization methods for several clustering optimization problems commonly used in unsupervised texture segmentation. Speed is achieved by exploiting the image neighborhood relation of features to design a multiscale optimization technique, while accuracy and global optimi
Image segmentation is very essential and critical to image processing and pattern recognition. This survey provides a summary of color image segmentation techniques available now. Basically, color segmentation approaches are based on monochrome segmentation approaches operating in di!erent color spa
In this paper we describe a color image segmentation system that performs color clustering in a color space and then color region segmentation in the image domain. For color segmentation, we developed a fuzzy clustering algorithm that iteratively generates color clusters using a uniquely de"ned fuzz