The Community for Technology Leaders
Green Image
<p>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.</p>
Index Termsparallel algorithms; reconfigurable architectures; image recognition; multiprocessorinterconnection networks; computational complexity; constant-time parallel algorithms;image labeling; reconfigurable network of processors; minimum-labeled PE; timecomplexity

H. Alnuweiri, "Constant-Time Parallel Algorithms for Image Labeling on a Reconfigurable Network of Processors," in IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 320-326, 1994.
88 ms
(Ver 3.3 (11022016))