This title appears in the Scientific Report :
2018
Please use the identifier:
http://hdl.handle.net/2128/19786 in citations.
Please use the identifier: http://dx.doi.org/10.1109/TPDS.2018.2829724 in citations.
Parallel Computation of Component Trees on Distributed Memory Machines
Parallel Computation of Component Trees on Distributed Memory Machines
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 effi...
Saved in:
Personal Name(s): | Götz, Markus (Corresponding author) |
---|---|
Cavallaro, Gabriele (Corresponding author) / Geraud, Thierry (Corresponding author) / Book, Matthias (Corresponding author) / Riedel, Morris (Corresponding author) | |
Contributing Institute: |
Jülich Supercomputing Center; JSC |
Published in: | IEEE transactions on parallel and distributed systems, 29 (2018) 11, S. 2582 - |
Imprint: |
New York, NY
IEEE
2018
|
DOI: |
10.1109/TPDS.2018.2829724 |
Document Type: |
Journal Article |
Research Program: |
Doktorand ohne besondere Förderung Data-Intensive Science and Federated Computing |
Link: |
Get full text Get full text OpenAccess Get full text Get full text OpenAccess |
Publikationsportal JuSER |
Please use the identifier: http://dx.doi.org/10.1109/TPDS.2018.2829724 in citations.
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. |