The Community for Technology Leaders
Green Image
<p>An important midlevel task for computer vision is addressed. The problem consists of labeling connected components in N/sup 1/2/*N/sup 2/2/ binary images. This task can be solved with parallel computers by using a simple and novel algorithm. The parallel computing model used is a synchronous fine-grained shared-memory model where only one processor can read from or write to the same memory location at a given time. This model is known as the exclusive-read exclusive-write parallel RAM (EREW PRAM). Using this model, the algorithm presented has O(log N) complexity. The algorithm can run on parallel machines other than the EREW PRAM. In particular, it offers an optimal image component labeling algorithm for mesh-connected computers.</p>
parallel algorithm; parallel processing; EREW PRAM algorithm; image component labeling; computer vision; binary images; synchronous fine-grained shared-memory model; exclusive-read exclusive-write parallel RAM; mesh-connected computers; computational complexity; computer vision; parallel algorithms; random-access storage

J. Sanz, L. Snyder and R. Cypher, "An EREW PRAM Algorithm for Image Component Labeling," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 11, no. , pp. 258-262, 1989.
92 ms
(Ver 3.3 (11022016))