Fast image labeling using local operators on mesh-connected computers

Hussein Alnuweiri, V. K. Prasanna Kumar

Research output: Contribution to journalConference article

1 Citation (Scopus)

Abstract

A parallel algorithm is proposed for fast image labeling on mesh-connected computers using only local operators on image pixels. The algorithm requires O(kn1/k) bits of memory per processor and takes O(kn) time, for any integer k in the range [1, log n]. Bit-serial communication can be used among processors without affecting the asymptotic time complexity of the algorithm. The algorithm has a very small constant factor for the computation time, which makes it superior to previous mesh-computer labeling algorithms for most practical image sizes (e.g., up to 4096 × 4096 images). The algorithm is based on the use of stacks, which can be easily realized by using very fast shift registers within each PE. When k is a constant, the algorithm takes O(n) time and uses Θ(n1/k) bits of memory per processor, which is quite small for most practical applications.

Original languageEnglish
Pages (from-to)32-39
Number of pages8
JournalProceedings of the International Conference on Parallel Processing
Volume3
Publication statusPublished - 1 Dec 1989
Externally publishedYes

Fingerprint

Labeling
Mathematical operators
Data storage equipment
Shift registers
Parallel algorithms
Pixels
Communication

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Fast image labeling using local operators on mesh-connected computers. / Alnuweiri, Hussein; Prasanna Kumar, V. K.

In: Proceedings of the International Conference on Parallel Processing, Vol. 3, 01.12.1989, p. 32-39.

Research output: Contribution to journalConference article

@article{b0e2988c27154949989082a05c0895e5,
title = "Fast image labeling using local operators on mesh-connected computers",
abstract = "A parallel algorithm is proposed for fast image labeling on mesh-connected computers using only local operators on image pixels. The algorithm requires O(kn1/k) bits of memory per processor and takes O(kn) time, for any integer k in the range [1, log n]. Bit-serial communication can be used among processors without affecting the asymptotic time complexity of the algorithm. The algorithm has a very small constant factor for the computation time, which makes it superior to previous mesh-computer labeling algorithms for most practical image sizes (e.g., up to 4096 × 4096 images). The algorithm is based on the use of stacks, which can be easily realized by using very fast shift registers within each PE. When k is a constant, the algorithm takes O(n) time and uses Θ(n1/k) bits of memory per processor, which is quite small for most practical applications.",
author = "Hussein Alnuweiri and {Prasanna Kumar}, {V. K.}",
year = "1989",
month = "12",
day = "1",
language = "English",
volume = "3",
pages = "32--39",
journal = "Proceedings of the International Conference on Parallel Processing",
issn = "0190-3918",

}

TY - JOUR

T1 - Fast image labeling using local operators on mesh-connected computers

AU - Alnuweiri, Hussein

AU - Prasanna Kumar, V. K.

PY - 1989/12/1

Y1 - 1989/12/1

N2 - A parallel algorithm is proposed for fast image labeling on mesh-connected computers using only local operators on image pixels. The algorithm requires O(kn1/k) bits of memory per processor and takes O(kn) time, for any integer k in the range [1, log n]. Bit-serial communication can be used among processors without affecting the asymptotic time complexity of the algorithm. The algorithm has a very small constant factor for the computation time, which makes it superior to previous mesh-computer labeling algorithms for most practical image sizes (e.g., up to 4096 × 4096 images). The algorithm is based on the use of stacks, which can be easily realized by using very fast shift registers within each PE. When k is a constant, the algorithm takes O(n) time and uses Θ(n1/k) bits of memory per processor, which is quite small for most practical applications.

AB - A parallel algorithm is proposed for fast image labeling on mesh-connected computers using only local operators on image pixels. The algorithm requires O(kn1/k) bits of memory per processor and takes O(kn) time, for any integer k in the range [1, log n]. Bit-serial communication can be used among processors without affecting the asymptotic time complexity of the algorithm. The algorithm has a very small constant factor for the computation time, which makes it superior to previous mesh-computer labeling algorithms for most practical image sizes (e.g., up to 4096 × 4096 images). The algorithm is based on the use of stacks, which can be easily realized by using very fast shift registers within each PE. When k is a constant, the algorithm takes O(n) time and uses Θ(n1/k) bits of memory per processor, which is quite small for most practical applications.

UR - http://www.scopus.com/inward/record.url?scp=0024923997&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024923997&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0024923997

VL - 3

SP - 32

EP - 39

JO - Proceedings of the International Conference on Parallel Processing

JF - Proceedings of the International Conference on Parallel Processing

SN - 0190-3918

ER -