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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on parallel and distributed systems Jg. 29; H. 11; S. 2582 - 2598
Hauptverfasser: Gotz, Markus, Cavallaro, Gabriele, Geraud, Thierry, Book, Matthias, Riedel, Morris
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.11.2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Institute of Electrical and Electronics Engineers
Schlagworte:
Algorithms
Component-trees
Computer memory
Computer Science
connected component labeling
Distributed memory
Distributed, Parallel, and Cluster Computing
Electronic mail
Flooding
Gray-scale
high-performance computing
hybrid application
Image acquisition
Image Processing
Image resolution
max-tree
Merging
Morphology
MPI
multithreading
Parallel processing
Remote sensing
Representations
Shape
Spatial data
threshold decomposition
Trees
Connected Component Labeling
Component-Trees
Multithreading
Threshold Decomposition
MPI
High-Performance Computing
Max-Tree
Hybrid Application
ISSN:1045-9219, 1558-2183
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1045-9219
1558-2183
DOI:10.1109/TPDS.2018.2829724