A new approach for parallel region growing algorithm in image segmentation using MATLAB on GPU architecture

Author(s):  
Abhaya Kumar Sahoo ◽  
Gaurav Kumar ◽  
Ghungura Mishra ◽  
Rachita Misra
2008 ◽  
Vol 205 (2) ◽  
pp. 807-814 ◽  
Author(s):  
Yunfeng Lu ◽  
Jun Miao ◽  
Lijuan Duan ◽  
Yuanhua Qiao ◽  
Ruixin Jia

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.


Author(s):  
P. N. Happ ◽  
R. S. Ferreira ◽  
G. A. O. P. Costa ◽  
R. Q. Feitosa ◽  
C. Bentes ◽  
...  

2019 ◽  
Vol 65 (No. 8) ◽  
pp. 321-329
Author(s):  
Haitao Wang ◽  
Yanli Chen

Because the image fire smoke segmentation algorithm can not extract white, gray and black smoke at the same time, a smoke image segmentation algorithm is proposed by combining rough set and region growth method. The R component of the image is extracted in the RGB colour space, the roughness histogram is constructed according to the statistical histogram of the R component, and the appropriate valley value in the roughness histogram is selected as the segmentation threshold, the image is roughly segmented. Relative to the background image, the smoke belongs to the motion information, and the motion region is extracted by the interframe difference method to eliminate static interference. Smoke has a unique colour feature, a smoke colour model is created in the RGB colour space, the motion disturbances of similar colour are removed and the suspected smoke areas are obtained. The seed point is selected in the region, and the region is grown on the result of rough segmentation, the smoke region is extracted. The experimental results show that the algorithm can segment white, gray and black smoke at the same time, and the irregular information of smoke edges is relatively complete. Compared with the existing algorithms, the average segmentation accuracy, recall rate and F-value are increased by 19%, 21.5% and 20%, respectively.<br /><br />


2005 ◽  
Vol 152 (6) ◽  
pp. 579 ◽  
Author(s):  
T. Morimoto ◽  
Y. Harada ◽  
T. Koide ◽  
H.J. Mattausch

Sign in / Sign up

Export Citation Format

Share Document