Fast algorithms for image labeling on a reconfigurable network of processors

H. M. Alnuweiri*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Citations (Scopus)

Abstract

This paper presents constant-time algorithms for labeling the connected components of images on a network of processors with a wide reconfigurable bus. The algorithms are based on a processor indexing scheme which employs constant-weight codes. The use of such codes enables identifying a single representative processor for each component in a constant number of steps. The proposed algorithms can label an NN image or an N-vertex graph in O(1) time using Theta (N2) processors, which is optimal. Furthermore, the proposed techniques lead to O(log N/log log N)-time labeling algorithms on a network of N2 processors with a reconfigurable bus of width O(log N) bits.

Original languageEnglish
Title of host publicationProceedings of 7th International Parallel Processing Symposium, IPPS 1993
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages569-575
Number of pages7
ISBN (Electronic)0818634421, 9780818634420
DOIs
Publication statusPublished - 1993
Externally publishedYes
Event7th International Parallel Processing Symposium, IPPS 1993 - Newport, United States
Duration: 13 Apr 199316 Apr 1993

Publication series

NameProceedings of 7th International Parallel Processing Symposium, IPPS 1993

Conference

Conference7th International Parallel Processing Symposium, IPPS 1993
Country/TerritoryUnited States
CityNewport
Period13/04/9316/04/93

Fingerprint

Dive into the research topics of 'Fast algorithms for image labeling on a reconfigurable network of processors'. Together they form a unique fingerprint.

Cite this