In this paper

a parallel algorithm for labeling a n×n image is presented. It simplifies the previous local operation by combining parallel-shrinking and label-propogating into one phase and decreases room complexities

takes O（n） time on a linear systolic array with n PEs and gets the optimal value of the running time-number of processors product.