Parallelization strategy for elementary morphological operators on graphs: distance-based algorithms and implementation on multicore shared-memory architecture
DOI10.1007/S10851-017-0737-1zbMATH Open1419.68202OpenAlexW2614692147MaRDI QIDQ2403751FDOQ2403751
Authors: 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
Recommendations
- Parallelization strategy for elementary morphological operators on graphs
- Optimal implementation of morphological operations on neighborhood-connected parallel computers
- scientific article; zbMATH DE number 4128411
- scientific article; zbMATH DE number 1262867
- scientific article; zbMATH DE number 811530
- An efficient parallel graph edge matching algorithm and its applications
- Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
- scientific article; zbMATH DE number 1985710
parallel algorithmdistance mapsgraph-based mathematical morphologymulticores/multithreaded architectures
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10) Parallel algorithms in computer science (68W10)
Cites Work
- Introduction to algorithms.
- Algebraic foundations of morphology
- Title not available (Why is that?)
- The algebraic basis of mathematical morphology I. Dilations and erosions
- Parallel Prefix Computation
- Title not available (Why is that?)
- Some Morphological Operators in Graph Spaces
- Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences
- Parallel distance transforms on a linear array architecture
- 2D subquadratic separable distance transformation for path-based norms
- Collapses and watersheds in pseudomanifolds of arbitrary dimension
- A comparison of some morphological filters for improving OCR performance
- Efficient binary and grey level morphological operations on a massively parallel processor
- Parallelization strategy for elementary morphological operators on graphs
Cited In (1)
This page was built for publication: Parallelization strategy for elementary morphological operators on graphs: distance-based algorithms and implementation on multicore shared-memory architecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2403751)
