A New Parallel MIMD Connected Component Labeling Algorithm
暂无分享,去创建一个
A new parallel MIMD Connected Component Labeling algorithm of binary objects is presented. The binary image is sliced uniformly between the processors. Since objects can occur at the boundaries of each slice, interprocessor communication is needed to spread the information about which objects are touching the boundary. The essential difference to other previously described parallel labeling algorithms is in the way the proposed algorithm constructs the equivalence tables and how they are merged between the processor in the network. An iPSC/2 is used to verify the algorithm by empirical tests.
[1] Lennart Thurfjell,et al. A new three-dimensional connected components labeling algorithm with simultaneous object feature extraction capability , 1992, CVGIP Graph. Model. Image Process..