A Linear-Time Two-Scan Labeling Algorithm

This paper presents a fast linear-time two-scan algorithm for labeling connected components in binary images. In the first scan, provisional labels are assigned to object pixels in the same way as do most conventional labeling algorithms. To improve efficiency, we use corresponding equivalent label sets and a representative label table for resolving label equivalences. When the first scan is finished, all provisional labels belonging to each connected component in a given image are combined in the corresponding equivalent label set, and they are assigned a unique representative label with the representative label table. During the second scan, by use of the completed representative label table, all provisional labels belonging to each connected component are replaced by their representative label. Our algorithm is very simple in principle, and is easy to implement. Experimental results demonstrated that the efficiency of our algorithm is superior to that of other labeling algorithms.

[1]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[2]  E. Dubois,et al.  Digital picture processing , 1985, Proceedings of the IEEE.

[3]  N. Otsu A threshold selection method from gray level histograms , 1979 .

[4]  Ronald Lumia,et al.  A new three dimensional connected components algorithm , 1982, Comput. Graph. Image Process..

[5]  RosenfeldAzriel,et al.  Sequential Operations in Digital Picture Processing , 1966 .

[6]  Kenji Suzuki,et al.  Linear-time connected-component labeling based on sequential local operations , 2003, Comput. Vis. Image Underst..

[7]  Azriel Rosenfeld,et al.  Sequential Operations in Digital Picture Processing , 1966, JACM.

[8]  D Marr,et al.  Theory of edge detection , 1979, Proceedings of the Royal Society of London. Series B. Biological Sciences.

[9]  Chun-Jen Chen,et al.  A linear-time component-labeling algorithm using contour tracing technique , 2004, Comput. Vis. Image Underst..

[10]  Christophe Fiorio,et al.  Two Linear Time Union-Find Strategies for Image Processing , 1996, Theor. Comput. Sci..