Parallelization strategy for elementary morphological operators on graphs: distance-based algorithms and implementation on multicore shared-memory architecture

DOI10.1007/s10851-017-0737-1zbMath1419.68202OpenAlexW2614692147MaRDI QIDQ2403751

Imane Youkana, Jean Cousty, Rachida Saouli, Mohamed Akil

Publication date: 12 September 2017

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10851-017-0737-1

zbMATH Keywords

parallel algorithmdistance mapsgraph-based mathematical morphologymulticores/multithreaded architectures

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel distance transforms on a linear array architecture
• Collapses and watersheds in pseudomanifolds of arbitrary dimension
• A Comparison of Some Morphological Filters for Improving OCR Performance
• Some Morphological Operators in Graph Spaces
• 2D Subquadratic Separable Distance Transformation for Path-Based Norms
• Parallel Prefix Computation
• The algebraic basis of mathematical morphology I. Dilations and erosions
• Efficient binary and grey level morphological operations on a massively parallel processor
• Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences
• Parallelization Strategy for Elementary Morphological Operators on Graphs

This page was built for publication: Parallelization strategy for elementary morphological operators on graphs: distance-based algorithms and implementation on multicore shared-memory architecture