Parallel asynchronous connected components in a mesh

Leviald introduced a parallel synchronous algorithm for counting the number of connected components in a binary image embedded in an n × n mesh of processors that runs in time O( n).We describe a parallel asynchronous algorithm for the same problem achieving the same time bound.

Saved in:
Bibliographic Details
Published in:Information processing letters 1991-06, Vol.38 (5), p.257-263
Main Authors: Hambrusch, Susanne, Luby, Michael
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Artificial intelligence
Asynchronous processors
Computer science
control theory
systems
connected components
Exact sciences and technology
image processing
Image processing system
Information processing
Mathematical analysis
meshes
parallel algorithms
Parallel processing
Pattern recognition. Digital image processing. Computational geometry
Theory
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Leviald introduced a parallel synchronous algorithm for counting the number of connected components in a binary image embedded in an n × n mesh of processors that runs in time O( n).We describe a parallel asynchronous algorithm for the same problem achieving the same time bound.
ISSN:0020-0190
1872-6119
DOI:10.1016/0020-0190(91)90068-S