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

DOI10.1007/S10851-017-0737-1MaRDI QIDQ2403751zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

parallel algorithmdistance mapsgraph-based mathematical morphologymulticores/multithreaded architectures

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3902440 (Why is no real title available?)
• scientific article; zbMATH DE number 914826 (Why is no real title available?)
• 2D subquadratic separable distance transformation for path-based norms
• A comparison of some morphological filters for improving OCR performance
• Algebraic foundations of morphology
• Collapses and watersheds in pseudomanifolds of arbitrary dimension
• Efficient binary and grey level morphological operations on a massively parallel processor
• Introduction to algorithms.
• Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences
• Parallel Prefix Computation
• Parallel distance transforms on a linear array architecture
• Parallelization strategy for elementary morphological operators on graphs
• Some Morphological Operators in Graph Spaces
• The algebraic basis of mathematical morphology I. Dilations and erosions

Cited in

(1)

• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2403751)