Two parallel strategies of split-merge algorithm for image segmentation

Author

Xuejing, Gong ; Linlin, Ci ; Kangze, Yao

Author_Institution

Beijing Inst. of Technol., Beijing

Volume

2

fYear

2007

fDate

2-4 Nov. 2007

Firstpage

840

Lastpage

845

Abstract

Split-merge algorithm is a general approach for image segmentation based on region growing. Firstly a new merge criterion is proposed to reduce the execution time of the algorithm by decreasing the number of iterations at the merge stage. Then, two strategies for its parallel implementation are discussed by analyzing their difference in load balance, communication complexity and scalability. In the end, the experimental data indicate the efficiency of the algorithm and the parallel strategies.

Keywords

computational complexity; image segmentation; iterative methods; communication complexity; communication scalability; image segmentation; iterations number; load balance; region growing; split-merge algorithm; Algorithm design and analysis; Image analysis; Image segmentation; Notice of Violation; Partitioning algorithms; Pattern analysis; Pattern recognition; Region 3; Region 6; Wavelet analysis; load balance; merge criteria; speedup; split-merge algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Wavelet Analysis and Pattern Recognition, 2007. ICWAPR '07. International Conference on

Conference_Location

Beijing

Print_ISBN

978-1-4244-1065-1

Electronic_ISBN

978-1-4244-1066-8

Type

conf

DOI

10.1109/ICWAPR.2007.4420786

Filename

4420786