Fast Image Labeling using Local Operators on Mesh-Connected Computers

Hussein M. Alnuweiri, V. K. Prasanna Kumar

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

Mesh-connected computers are well suited to local computations that exploit the nearest-neighbor interconnections of the mesh. In this correspondence, a new parallel algorithm is proposed for fast image labeling using local operators on image pixels. The algorithm can be implemented on an n x n mesh-connected computer such that, for any integer k in the range [1, log(2/i)], the algorithm requires Q(knllk)bits of local memory per processor and takes 0(foi) time. Bit-serial processors and communication links can be used without affecting the asymptotic time complexity of the algorithm. The time complexity of the algorithm has very small leading constant factors, which makes it superior to previous mesh computer labeling algorithms for most practical image sizes (e.g., up to 4096 x 4096 images). Furthermore, our algorithm is based on using stacks that can be realized using very fast shift registers within each PE.

Original languageEnglish
Pages (from-to)202-207
Number of pages6
JournalIEEE Transactions on Pattern Analysis and Machine Intelligence
Volume13
Issue number2
DOIs
Publication statusPublished - 1 Jan 1991
Externally publishedYes

Fingerprint

Mesh-connected Computer
Labeling
Operator
Time Complexity
Mesh
Labeling Algorithm
Local Computation
Shift registers
Interconnection
Parallel Algorithms
Nearest Neighbor
Parallel algorithms
Correspondence
Pixel
Telecommunication links
Mathematical operators
Pixels
Integer
Data storage equipment
Range of data

Keywords

  • Image labeling
  • image processing
  • local image operators
  • mesh-connected computers
  • parallel algorithms
  • space-time tradeoffs

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition
  • Computational Theory and Mathematics
  • Artificial Intelligence
  • Applied Mathematics

Cite this

Fast Image Labeling using Local Operators on Mesh-Connected Computers. / Alnuweiri, Hussein M.; Prasanna Kumar, V. K.

In: IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 13, No. 2, 01.01.1991, p. 202-207.

Research output: Contribution to journalArticle

@article{22f1878c1f9c4a84bfe64f58320d74e1,
title = "Fast Image Labeling using Local Operators on Mesh-Connected Computers",
abstract = "Mesh-connected computers are well suited to local computations that exploit the nearest-neighbor interconnections of the mesh. In this correspondence, a new parallel algorithm is proposed for fast image labeling using local operators on image pixels. The algorithm can be implemented on an n x n mesh-connected computer such that, for any integer k in the range [1, log(2/i)], the algorithm requires Q(knllk)bits of local memory per processor and takes 0(foi) time. Bit-serial processors and communication links can be used without affecting the asymptotic time complexity of the algorithm. The time complexity of the algorithm has very small leading constant factors, which makes it superior to previous mesh computer labeling algorithms for most practical image sizes (e.g., up to 4096 x 4096 images). Furthermore, our algorithm is based on using stacks that can be realized using very fast shift registers within each PE.",
keywords = "Image labeling, image processing, local image operators, mesh-connected computers, parallel algorithms, space-time tradeoffs",
author = "Alnuweiri, {Hussein M.} and {Prasanna Kumar}, {V. K.}",
year = "1991",
month = "1",
day = "1",
doi = "10.1109/34.67649",
language = "English",
volume = "13",
pages = "202--207",
journal = "IEEE Transactions on Pattern Analysis and Machine Intelligence",
issn = "0162-8828",
publisher = "IEEE Computer Society",
number = "2",

}

TY - JOUR

T1 - Fast Image Labeling using Local Operators on Mesh-Connected Computers

AU - Alnuweiri, Hussein M.

AU - Prasanna Kumar, V. K.

PY - 1991/1/1

Y1 - 1991/1/1

N2 - Mesh-connected computers are well suited to local computations that exploit the nearest-neighbor interconnections of the mesh. In this correspondence, a new parallel algorithm is proposed for fast image labeling using local operators on image pixels. The algorithm can be implemented on an n x n mesh-connected computer such that, for any integer k in the range [1, log(2/i)], the algorithm requires Q(knllk)bits of local memory per processor and takes 0(foi) time. Bit-serial processors and communication links can be used without affecting the asymptotic time complexity of the algorithm. The time complexity of the algorithm has very small leading constant factors, which makes it superior to previous mesh computer labeling algorithms for most practical image sizes (e.g., up to 4096 x 4096 images). Furthermore, our algorithm is based on using stacks that can be realized using very fast shift registers within each PE.

AB - Mesh-connected computers are well suited to local computations that exploit the nearest-neighbor interconnections of the mesh. In this correspondence, a new parallel algorithm is proposed for fast image labeling using local operators on image pixels. The algorithm can be implemented on an n x n mesh-connected computer such that, for any integer k in the range [1, log(2/i)], the algorithm requires Q(knllk)bits of local memory per processor and takes 0(foi) time. Bit-serial processors and communication links can be used without affecting the asymptotic time complexity of the algorithm. The time complexity of the algorithm has very small leading constant factors, which makes it superior to previous mesh computer labeling algorithms for most practical image sizes (e.g., up to 4096 x 4096 images). Furthermore, our algorithm is based on using stacks that can be realized using very fast shift registers within each PE.

KW - Image labeling

KW - image processing

KW - local image operators

KW - mesh-connected computers

KW - parallel algorithms

KW - space-time tradeoffs

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

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

U2 - 10.1109/34.67649

DO - 10.1109/34.67649

M3 - Article

VL - 13

SP - 202

EP - 207

JO - IEEE Transactions on Pattern Analysis and Machine Intelligence

JF - IEEE Transactions on Pattern Analysis and Machine Intelligence

SN - 0162-8828

IS - 2

ER -