TY  - JOUR
AU  - Götz, Markus
AU  - Cavallaro, Gabriele
AU  - Geraud, Thierry
AU  - Book, Matthias
AU  - Riedel, Morris
TI  - Parallel Computation of Component Trees on Distributed Memory Machines
JO  - IEEE transactions on parallel and distributed systems
VL  - 29
IS  - 11
SN  - 1045-9219
CY  - New York, NY
PB  - IEEE
M1  - FZJ-2018-02533
SP  - 2582 -
PY  - 2018
AB  - Component trees are region-based representations that encode the inclusion relationship of the threshold sets of an image. These representations are one of the most promising strategies for the analysis and the interpretation of spatial information of complex scenes as they allow the simple and efficient implementation of connected filters. This work proposes a new efficient hybrid algorithm for the parallel computation of two particular component trees—the max- and min-tree—in shared and distributed memory environments. For the node-local computation a modified version of the flooding-based algorithm of Salembier is employed. A novel tuple-based merging scheme allows to merge the acquired partial images into a globally correct view. Using the proposed approach a speed-up of up to 44.88 using 128 processing cores on eight-bit gray-scale images could be achieved. This is more than a five-fold increase over the state-of-the-art shared-memory algorithm, while also requiring only one-thirty-second of the memory.
LB  - PUB:(DE-HGF)16
UR  - <Go to ISI:>//WOS:000447046200014
DO  - DOI:10.1109/TPDS.2018.2829724
UR  - https://juser.fz-juelich.de/record/845250
ER  -