Parallel Algorithm for Concurrent Computation of Connected Component Tree

Authors:
P. Matas;E. Dokládalová;M. Akil;T. Grandpierre;L. Najman;M. Poupa;V. Georgiev
Affiliations:
IGM, Unité Mixte CNRS-UMLV-ESIEE UMR8049, Université Paris-Est, Noisy le Grand, France 93162 and Department of Applied Electronics and Telecommunications, University of West Bohemia, Plz ...;IGM, Unité Mixte CNRS-UMLV-ESIEE UMR8049, Université Paris-Est, Noisy le Grand, France 93162;IGM, Unité Mixte CNRS-UMLV-ESIEE UMR8049, Université Paris-Est, Noisy le Grand, France 93162;IGM, Unité Mixte CNRS-UMLV-ESIEE UMR8049, Université Paris-Est, Noisy le Grand, France 93162;IGM, Unité Mixte CNRS-UMLV-ESIEE UMR8049, Université Paris-Est, Noisy le Grand, France 93162;Department of Applied Electronics and Telecommunications, University of West Bohemia, Plzeň, Czech Republic 306 14;Department of Applied Electronics and Telecommunications, University of West Bohemia, Plzeň, Czech Republic 306 14
Venue:
ACIVS '08 Proceedings of the 10th International Conference on Advanced Concepts for Intelligent Vision Systems
Year:
2008

Citing 7
Cited 1

Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
Efficient Algorithms to Implement the Confinement Tree

DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Quasi-Linear Algorithms for the Topological Watershed

Journal of Mathematical Imaging and Vision
Concurrent Computation of Attribute Filters on Shared Memory Parallel Machines

IEEE Transactions on Pattern Analysis and Machine Intelligence
Simple and optimal output-sensitive construction of contour trees using monotone paths

Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Antiextensive connected operators for image and sequence processing

IEEE Transactions on Image Processing
Building the Component Tree in Quasi-Linear Time

IEEE Transactions on Image Processing

Towards a parallel topological watershed: first results

ISMM'11 Proceedings of the 10th international conference on Mathematical morphology and its applications to image and signal processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper proposes a new parallel connected-component-tree construction algorithm based on line independent building and progressive merging of partial 1-D trees. Two parallelization strategies were developed: the parallelism maximization strategy, which balances the workload of the processes, and the communication minimization strategy, which minimizes communication among the processes. The new algorithm is able to process any pixel data type, thanks to not using a hierarchical queue. The algorithm needs only the input and output buffers and a small stack. A speedup of 3.57 compared to the sequential algorithm was obtained on Opteron 4-core shared memory ccNUMA architecture. Performance comparison with existing state of the art is also discussed.