CONNECTED COMPONENT LABELING FOR BINARY IMAGES ON A RECONFIGURABLE MESH ARCHITECTURE

We show how some existing component labeling algorithms for binary ima ges could be speeded up by using the reconfigurable mesh architecture. Two algorithms are presented, the first one uses the ability of the r econfigurable mesh to perform certain operations in constant time, and the second one uses a bottom-up divide-and-conquer strategy, Both the se algorithms have run times that are logarithmic functions of the ima ge size.