DocumentCode :
1870221
Title :
Parallelization research on watershed algorithm
Author :
Suping Wu ; Yingshuai Hu
Author_Institution :
School of Mathematics and Computer Science, Ningxia University, Yinchuan, China
fYear :
2012
fDate :
3-5 March 2012
Firstpage :
1524
Lastpage :
1527
Abstract :
Watershed algorithm is an effective and efficient image segmentation method. However, due to the influence of noise and fine-grained of flat region, too many local extremum can be detected by algorithm, which easily lead to numerous small regions appearing in the follow-up segmentation and over-segmentation. This paper combines the watershed and seeded region growing algorithm to eliminate the phenomenon of over-segmentation, which gets a better result. But when the image size grows bigger and bigger, the number of region segmented by watershed algorithm and the computation of region merging will both increase sharply, which eventually results in that the process of segmenting image to consume much more time. In order to speed up the segmentation, in this paper a parallel method based on MPI is presented, which is composed of watershed algorithm and region merging. Experiment results show that the given algorithm has a good speedup.
Keywords :
MPI; Parallel Computing; Region Merging; Watershed;
fLanguage :
English
Publisher :
iet
Conference_Titel :
Automatic Control and Artificial Intelligence (ACAI 2012), International Conference on
Conference_Location :
Xiamen
Electronic_ISBN :
978-1-84919-537-9
Type :
conf
DOI :
10.1049/cp.2012.1272
Filename :
6492879
Link To Document :
بازگشت