Constant-Time Parallel Algorithms for Image Labeling on a Reconfigurable Network of Processors

Authors:
H. M. Alnuweiri
Affiliations:
-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1994

Citing 8
Cited 3

Image understanding architecture and applications

Advances in Machine Vision
Connection autonomy in SIMD computers: a VLSI implementation

Journal of Parallel and Distributed Computing
Polymorphic-Torus Network

IEEE Transactions on Computers
Meshes with reconfigurable buses

Proceedings of the fifth MIT conference on Advanced research in VLSI
Two-dimensional processor array with a reconfigurable bus system is at least as powerful as CRCW model

Information Processing Letters
The power of reconfiguration

Journal of Parallel and Distributed Computing
Parallel Architectures and Algorithms for Image Component Labeling

IEEE Transactions on Pattern Analysis and Machine Intelligence
Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems

IEEE Transactions on Parallel and Distributed Systems

Parallel Constant-Time Connectivity Algorithms on a Reconfigurable Network of Processors

IEEE Transactions on Parallel and Distributed Systems
2D Object Recognition on a Reconfigurable Mesh

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
The spin-wave nanoscale reconfigurable mesh and the labeling problem

ACM Journal on Emerging Technologies in Computing Systems (JETC)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A constant-time algorithm for labeling the connected components of an N/spl times/Nimage on a reconfigurable network of N/sup 3/ processors is presented. The maincontribution of the algorithm is a novel constant-time technique for determining theminimum-labeled PE in each component. The number of processors used by the algorithm can be reduced to N/sup 2+(1/d/), for any 1/spl les/d/spl les/log N, if O(d) time is allowed.