Opin vísindi

Parallel Computation of Component Trees on Distributed Memory Machines

Show simple item record

dc.contributor Háskóli Íslands (HÍ)
dc.contributor University of Iceland (UI)
dc.contributor.author Gotz, Markus
dc.contributor.author Cavallaro, Gabriele
dc.contributor.author Geraud, Thierry
dc.contributor.author Book, Matthias
dc.contributor.author Riedel, Morris
dc.date.accessioned 2019-12-19T10:50:51Z
dc.date.available 2019-12-19T10:50:51Z
dc.date.issued 2018-11-01
dc.identifier.citation Gotz, M. et al., 2018. Parallel Computation of Component Trees on Distributed Memory Machines. IEEE Transactions on Parallel and Distributed Systems, 29(11), pp.2582–2598.
dc.identifier.issn 1045-9219
dc.identifier.uri https://hdl.handle.net/20.500.11815/1409
dc.description Publisher's version (útgefin grein)
dc.description.abstract 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.
dc.description.sponsorship The authors would like to thank Igancio Toledo and Martin Kornmesser for making the ESO/VVV Survey/D. Minniti image with the id eso1242a publicly available.
dc.format.extent 2582-2598
dc.language.iso en
dc.publisher Institute of Electrical and Electronics Engineers (IEEE)
dc.relation.ispartofseries IEEE Transactions on Parallel and Distributed Systems;29(11)
dc.rights info:eu-repo/semantics/openAccess
dc.subject Image resolution
dc.subject Remote sensing
dc.subject Morphology
dc.subject Parallel algorithms
dc.subject Reiknirit
dc.subject Fjarkönnun
dc.subject Myndvinnsla
dc.title Parallel Computation of Component Trees on Distributed Memory Machines
dc.type info:eu-repo/semantics/article
dcterms.license Open Access. This work is licensed under a Creative Commons Attribution 3.0 License. For more information, see http://creativecommons.org/licenses/by/3.0/
dc.description.version Peer Reviewed
dc.identifier.journal IEEE Transactions on Parallel and Distributed Systems
dc.identifier.doi 10.1109/TPDS.2018.2829724
dc.relation.url http://xplorestaging.ieee.org/ielx7/71/8486815/08360392.pdf?arnumber=8360392
dc.contributor.department Iðnaðarverkfræði-, vélaverkfræði- og tölvunarfræðideild (HÍ)
dc.contributor.department Faculty of Industrial Eng., Mechanical Eng. and Computer Science (UI)
dc.contributor.school Verkfræði- og náttúruvísindasvið (HÍ)
dc.contributor.school School of Engineering and Natural Sciences (UI)


Files in this item

This item appears in the following Collection(s)

Show simple item record