Color image segmentation algorithm: An approach to image segmentation through ellipsoidal clustering and edge detection

Author(s):  
Michael Linger
2011 ◽  
Vol 214 ◽  
pp. 693-698
Author(s):  
Rui Geng

The colony intellectual behavior performed by many organisms in nature can solve various kinds of problems on scientific and technological research. Bees are a socialized insect colony, which perform different types of activities according to their different divisions of labor, and achieve information sharing and exchanges among the bee colony to find the optimal solution for problems. According to this characteristic, researchers have proposed the algorithm of bee colony for solving combinatorial optimization problems. In this paper, it will describe the implementation process of such an image segmentation algorithm, and the result shows that this method is a potential image segmentation algorithm.


2012 ◽  
Vol 461 ◽  
pp. 526-531
Author(s):  
Xiao Hong Zhang ◽  
Hong Mei Ning

Fuzzy C-mean algorithm (FCM) has been well used in the field of color image segmentation. But it is sensitive to initial clustering center and membership matrix, and likely converges into the local minimum, which causes the quality of image segmentation lower. By use of the properties-ergodicity, randomicity of chaos, a new image segmentation algorithm is proposed, which combines the chaos particle swarm optimization (CPSO) and FCM clustering. Some experimental results are shown that this method not only has the ability to prevent the particles to convergence to local optimum, but also has faster convergence and higher accuracy for segmentation. Using the feature distance instead of Euclidian distance, robustness of this method is enhanced.


Author(s):  
VASILEIOS MEZARIS ◽  
IOANNIS KOMPATSIARIS ◽  
MICHAEL G. STRINTZIS

In this paper, a color image segmentation algorithm and an approach to large-format image segmentation are presented, both focused on breaking down images to semantic objects for object-based multimedia applications. The proposed color image segmentation algorithm performs the segmentation in the combined intensity–texture–position feature space in order to produce connected regions that correspond to the real-life objects shown in the image. A preprocessing stage of conditional image filtering and a modified K-Means-with-connectivity-constraint pixel classification algorithm are used to allow for seamless integration of the different pixel features. Unsupervised operation of the segmentation algorithm is enabled by means of an initial clustering procedure. The large-format image segmentation scheme employs the aforementioned segmentation algorithm, providing an elegant framework for the fast segmentation of relatively large images. In this framework, the segmentation algorithm is applied to reduced versions of the original images, in order to speed-up the completion of the segmentation, resulting in a coarse-grained segmentation mask. The final fine-grained segmentation mask is produced with partial reclassification of the pixels of the original image to the already formed regions, using a Bayes classifier. As shown by experimental evaluation, this novel scheme provides fast segmentation with high perceptual segmentation quality.


Sign in / Sign up

Export Citation Format

Share Document