Parallelization Strategy for Elementary Morphological Operators on Graphs - HAL Accéder directement au contenu
Communication dans un congrès Année : 2016

Parallelization Strategy for Elementary Morphological Operators on Graphs

Résumé

This article focuses on the graph-based mathematical morphology operators presented in [J. Cousty et al, Morphological ltering on graphs, CVIU 2013]. These operators depend on a size parameter that species the number of iterations of elementary dilations/erosions. Thus, the associated running times increase with the size parameter. In this article, we present distance maps that allow us to recover (by thresh-olding) all considered dilations and erosions. The algorithms based on distance maps allow the operators to be computed with a single linear-time iteration, without any dependence to the size parameter. Then, we investigate a parallelization strategy to compute these distance maps. The idea is to build iteratively the successive level-sets of the distance maps, each level set being traversed in parallel. Under some reasonable assumptions about the graph and sets to be dilated, our parallel algorithm runs in O(n/p + K log 2 p) where n, p, and K are the size of the graph, the number of available processors, and the number of distinct level-sets of the distance map, respectively.
Fichier principal
Vignette du fichier
ParMorph.pdf ( 259.67 Ko ) Télécharger
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01344753, version 1 (12-07-2016)

Identifiants

Citer

Imane Youkana, Jean Cousty, Rachida Saouli, Mohamed Akil. Parallelization Strategy for Elementary Morphological Operators on Graphs. 19th IAPR International Conference on Discrete Geometry for Computer Imagery, Apr 2016, Nantes, France. pp.311--322, ⟨10.1007/978-3-319-32360-2_24⟩. ⟨hal-01344753⟩
126 Consultations
137 Téléchargements
Dernière date de mise à jour le 26/06/2024
comment ces indicateurs sont-ils produits

Altmetric

Partager

Gmail Facebook Twitter LinkedIn Plus