Comparison of three-color image segmentation algorithms in four color spaces

Author(s):  
John M. Gauch ◽  
Chi W. Hsia
2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Dina Khattab ◽  
Hala Mousher Ebied ◽  
Ashraf Saad Hussein ◽  
Mohamed Fahmy Tolba

This paper presents a comparative study using different color spaces to evaluate the performance of color image segmentation using the automatic GrabCut technique. GrabCut is considered as one of the semiautomatic image segmentation techniques, since it requires user interaction for the initialization of the segmentation process. The automation of the GrabCut technique is proposed as a modification of the original semiautomatic one in order to eliminate the user interaction. The automatic GrabCut utilizes the unsupervised Orchard and Bouman clustering technique for the initialization phase. Comparisons with the original GrabCut show the efficiency of the proposed automatic technique in terms of segmentation, quality, and accuracy. As no explicit color space is recommended for every segmentation problem, automatic GrabCut is applied withRGB,HSV,CMY,XYZ, andYUVcolor spaces. The comparative study and experimental results using different color images show thatRGBcolor space is the best color space representation for the set of the images used.


2012 ◽  
Vol 63 (1) ◽  
Author(s):  
Peter Lukáč ◽  
Róbert Hudec ◽  
Miroslav Benčo ◽  
Zuzana Dubcová ◽  
Martina Zachariášová ◽  
...  

2020 ◽  
Author(s):  
Anand Swaminathan ◽  
K.Venkata Subramaniyan ◽  
Tiruppathirajan G. ◽  
Rajkumar J

Image segmentation is an important pre-processing step towards higher level tasks such as object recognition, computer vision or image compression. Most of the existing segmentation algorithms deal with grayscale images only. But in the modern world, color images are extensively used in many situations. A new approach for color image segmentation is presented in this paper. There are many ways to deal with image segmentation problem and in these techniques; a particular class of algorithms traces their origin from region-based methods. These algorithms group homogeneous pixels, which are connected to primitive regions. They are easy to implement and are promising. Therefore, here one of the most efficient region-based segmentation algorithms is explained. The color image is quantized adaptively, using a wavelet transform. Then the region growing process is adopted. As preprocess, before actual region merging, small regions are eliminated by merging them with neighbor regions depending upon color similarity. After this, homogeneous regions are merged to get segmented output.


2020 ◽  
Author(s):  
Anand Swaminathan ◽  
K.Venkata Subramaniyan ◽  
Tiruppathirajan G. ◽  
Rajkumar J

Image segmentation is an important pre-processing step towards higher level tasks such as object recognition, computer vision or image compression. Most of the existing segmentation algorithms deal with grayscale images only. But in the modern world, color images are extensively used in many situations. A new approach for color image segmentation is presented in this paper. There are many ways to deal with image segmentation problem and in these techniques; a particular class of algorithms traces their origin from region-based methods. These algorithms group homogeneous pixels, which are connected to primitive regions. They are easy to implement and are promising. Therefore, here one of the most efficient region-based segmentation algorithms is explained. The color image is quantized adaptively, using a wavelet transform. Then the region growing process is adopted. As preprocess, before actual region merging, small regions are eliminated by merging them with neighbor regions depending upon color similarity. After this, homogeneous regions are merged to get segmented output.


Sign in / Sign up

Export Citation Format

Share Document