Hypercube and shuffle-exchange algorithms for image-component labeling. Technical report
Technical Report
·
OSTI ID:6601250
This paper presents algorithms for labeling the connected components of a binary image using a hypercube or shuffle-exchange computer. The algorithms label the components of an sq 1 + N x sq 1 + N pixel image in O(long sq of N) time using a hypercube or shuffle-exchange computer with N processors and a constant amount of memory per processor. The algorithms that are presented are the first to solve this problem in O(log sq of N) time. The algorithms are based on a divide-and-conquer approach and use as a subroutine an O(log N) time PRAM algorithm for labeling the connected components of a graph. The simulation of the PRAM by the hypercube and shuffle-exchange computers is particularly efficient because the PRAM that is being simulated has only O(N to the 3/4 power) processors and memory cells.
- Research Organization:
- Washington Univ., Seattle (USA). Dept. of Computer Science
- OSTI ID:
- 6601250
- Report Number(s):
- AD-A-197574/7/XAB; TR-87-04-03
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel algorithms and architectures for binary image component labeling
Odd even shifts in SIMD hypercubes
Supporting divide-and-conquer algorithms for image processing
Book
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:5545411
Odd even shifts in SIMD hypercubes
Journal Article
·
Sun Dec 31 23:00:00 EST 1989
· IEEE Transactions on Parallel and Distributed Systems; (USA)
·
OSTI ID:6541073
Supporting divide-and-conquer algorithms for image processing
Journal Article
·
Sat Jan 31 23:00:00 EST 1987
· J. Parallel Distrib. Comput.; (United States)
·
OSTI ID:6984858