Abstract
Unlike conventional raster-scan based connected-component labeling algorithms which detect the connectivity of object pixels by processing pixels in an image one by one, this paper presents an efficient run-based two-scan labeling algorithm: the run data obtained during the scan are recorded in a queue, and are used for detecting the connectivity later. Moreover, unlike conventional label-equivalence-based algorithms which resolve label equivalences between provisional labels that are assigned during the first scan, our algorithm resolve label equivalences between the representative labels of equivalent provisional label sets. In our algorithm, at any time, all provisional labels that are assigned to a connected component are combined in a set, and the smallest label is used as the representative label. The corresponding relation of a provisional label to its representative label is recorded in a table. Whenever different connected components are found to be connected, all provisional label sets concerned with these connected components are merged together, and the smallest provisional label is taken as the representative label. When the first scan is finished, all provisional labels that were assigned to each connected component in the given image will have a unique representative label. During the second scan, we need only to replace each provisional label with its representative label. Experimental results on various types of images demonstrate that our algorithm is the fastest of all conventional labeling algorithms.
This work was partially supported by the TOYOAKI Scholarship Foundation, Japan, and the Research Abroad Project of Aichi Prefectural University, Japan.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ballard, D.H.: Computer Vision. Prentice-Hall, Englewood, New Jesey (1982)
Chang, F., Chen, C.J., Lu, C.J.: A linear-time component-labeling algorithm using contour tracing technique. Computer Vision and Image Understanding 93, 206–220 (2004)
Gonzalez, R.C., Woods, R.E.: Digital Image Processing. Addison-Wesley, Reading (1992)
Gotoh, T., Ohta, Y., Yoshida, M., Shirai, Y.: Component labeling algorithm for video rate processing. In: Proc. SPIE, April 1987. Advances in Image Processing, vol. 804, pp. 217–224 (1987)
Haralick, R.M.: Some neighborhood operations. In: Real Time/Parallel Computing Image Analysis, pp. 11–35. Plenum Press, New York (1981)
Haralick, R.M., Shapiro, L.G.: Computer and Robot Vision, vol. I, pp. 28–48. Addison-Wesley, Reading, MA (1992)
Hashizume, A., Suzuki, R., Yokouchi, H., et al.: An algorithm of automated RBC classification and its evaluation. Bio. Medical Engineering 28(1), 25–32 (1990)
Hu, Q., Qian, G., Nowinski, W.L.: Fast connected-component labeling in three-dimensional binary images based on iterative recursion. Computer Vision and Image Understanding 99, 414–434 (2005)
Komeichi, M., Ohta, Y., Gotoh, T., Mima, T., Yoshida, M.: Video-rate labeling processor. In: Proc. SPIE, September 1988. Image Processing II, vol. 1027, pp. 69–76 (1988)
Lumia, R., Shapiro, L., Zungia, O.: A new connected components algorithm for virtual memory computers. Computer Vision, Graphics, and Image Processing 22(2), 287–300 (1983)
Lumia, R.: A new three-dimensional connected components algorithm. Computer Vision, Graphics, and Image Processing 23(2), 207–217 (1983)
Naoi, S.: High-speed labeling method using adaptive variable window size for character shape feature. In: IEEE Asian Conf. Computer Vision, December 1995, vol. 1, pp. 408–411 (1995)
Otsu, N.: A threshold selection method from gray-level histograms. IEEE Trans. Systems Man and Cybernetics 9, 62–66 (1979)
Ronsen, C., Denjiver, P.A.: Connected Components in Binary Images: The Detection Problem. Research Studies Press (1984)
Rosenfeld, A., Pfalts, J.L.: Sequential operations in digital picture processing. Journal of ACM 13(4), 471–494 (1966)
Rosenfeld, A.: Connectivity in digital pictures. Journal of ACM 17(1), 146–160 (1970)
Rosenfeld, A., Kak, A.C.: Digital Picture Processing, 2nd edn., vol. 2. Academic Press, San Diego, CA (1982)
Shima, Y., Murakami, T., Koga, M., Yashiro, H., Fujisawa, H.: A high-speed algorithm for propagation-type labeling based on block sorting of runs in binary images. In: Proceedings of 10th International Conference on Pattern Recognition, pp. 655–658 (1990)
Shirai, Y.: Labeling connected regions. In: Three-Dimensional Computer Vision, pp. 86–89. Springer, Heidelberg (1987)
Suzuki, K., Horiba, I., Sugie, N.: Linear-time connected-component labeling based on sequential local operations. Computer Vision and Image Understanding 89, 1–23 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, L., Chao, Y., Suzuki, K. (2007). A Run-Based Two-Scan Labeling Algorithm. In: Kamel, M., Campilho, A. (eds) Image Analysis and Recognition. ICIAR 2007. Lecture Notes in Computer Science, vol 4633. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74260-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-74260-9_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74258-6
Online ISBN: 978-3-540-74260-9
eBook Packages: Computer ScienceComputer Science (R0)