Constant-time parallel algorithms for image labeling on a reconfigurable network of processors

A constant-time algorithm for labeling the connected components of an N/spl times/N image on a reconfigurable network of N/sup 3/ processors is presented. The main contribution of the algorithm is a novel constant-time technique for determining the minimum-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.<
>