### 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(kn^{1/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 Θ(n^{1/k}) bits of memory per processor, which is quite small for most practical applications.

Original language | English |
---|---|

Pages (from-to) | 32-39 |

Number of pages | 8 |

Journal | Proceedings of the International Conference on Parallel Processing |

Volume | 3 |

Publication status | Published - 1 Dec 1989 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Hardware and Architecture

### Cite this

*Proceedings of the International Conference on Parallel Processing*,

*3*, 32-39.

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

Research output: Contribution to journal › Conference article

*Proceedings of the International Conference on Parallel Processing*, vol. 3, pp. 32-39.

}

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 -