Connected Component Labeling Techniques on Modern Architectures

  • Costantino Grana
  • Daniele Borghesani
  • Rita Cucchiara
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5716)


In this paper we present an overview of the historical evolution of connected component labeling algorithms, and in particular the ones applied on images stored in raster scan order. This brief survey aims at providing a comprehensive comparison of their performance on modern architectures, since the high availability of memory and the presence of caches make some solutions more suitable and fast. Moreover we propose a new strategy for label propagation based on a 2x2 blocks, which allows to improve the performance of many existing algorithms. The tests are conducted on high resolution images obtained from digitized historical manuscripts and a set of transformations is applied in order to show the algorithms behavior at different image resolutions and with a varying number of labels.


connected component labeling comparison union-find 


  1. 1.
    Rosenfeld, A., Pfaltz, J.L.: Sequential Operations in Digital Picture Processing. Journal of the ACM 13(4), 471–494 (1966)CrossRefzbMATHGoogle Scholar
  2. 2.
    Haralick, R.M.: Some neighborhood operations. In: Real Time Parallel Computing: Image Analysis, pp. 11–35. Plenum Press, New York (1981)CrossRefGoogle Scholar
  3. 3.
    Lumia, R., Shapiro, L.G., Zuniga, O.A.: A New Connected Components Algorithm for Virtual Memory Computers. Computer Vision Graphics and Image Processing 22(2), 287–300 (1983)CrossRefGoogle Scholar
  4. 4.
    Schwartz, J.T., Sharjr, M., Siegel, A.: An efficient algorithm for finding connected components in a binary image. Robotics Research Technical Report 38. New York Univ. New York (1985)Google Scholar
  5. 5.
    Samet, H., Tamminen, M.: An Improved Approach to connected component labeling of images. In: International Conference on Computer Vision And Pattern Recognition, pp. 312–318 (1986)Google Scholar
  6. 6.
    Dillencourt, M.B., Samet, H., Tamminen, M.: A general approach to connected-component labeling for arbitrary image representations. Journal of the ACM 39(2), 253–280 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Di Stefano, L., Bulgarelli, A.: A simple and efficient connected components labeling algorithm. In: 10th International Conference on Image Analysis and Processing, pp. 322–327 (1999)Google Scholar
  8. 8.
    Suzuki, K., Horiba, I., Sugie, N.: Linear-time connected-component labeling based on sequential local operations. Comput. Vis. Image Underst. 89(1), 1–23 (2003)CrossRefzbMATHGoogle Scholar
  9. 9.
    Chang, F., Chen, C.J.: A component-labeling algorithm using contour tracing technique. In: 7th International Conference on Document Analysis and Recognition, pp. 741–745 (2003)Google Scholar
  10. 10.
    Freeman, H.: Techniques for the Digital Computer Analysis of Chain-Encoded Arbitrary Plane Curves. In: 17th National Electronics Conference, pp. 412–432 (1961)Google Scholar
  11. 11.
    Pavlidis, T.: Algorithms for graphics and image processing. Computer Science Press, Rockville MD (1982)CrossRefzbMATHGoogle Scholar
  12. 12.
    Wu, K., Otoo, E., Shoshani, A.: Optimizing connected component labeling algorithms. In: SPIE Conference on Medical Imaging, vol. 5747, pp. 1965–1976 (2005)Google Scholar
  13. 13.
    Fiorio, C., Gustedt, J.: Two Linear Time Union-Find Strategies for Image Processing. Theor. Comput. Sci. 154, 165–181 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    He, L., Chao, Y., Suzuki, K.: A Linear-Time Two-Scan Labeling Algorithm. In: IEEE International Conference on Image Processing, vol. 5, pp. 241–244 (2007)Google Scholar
  15. 15.
    He, L., Chao, Y., Suzuki, K.: A Run-Based Two-Scan Labeling Algorithm. IEEE Transactions on Image Processing 17(5), 749–756 (2008)MathSciNetCrossRefGoogle Scholar
  16. 16.
    He, L., Chao, T., Suzuki, K., Wu, K.: Fast connected-component labeling. Pattern Recognition (2008) (in press)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Costantino Grana
    • 1
  • Daniele Borghesani
    • 1
  • Rita Cucchiara
    • 1
  1. 1.Dipartimento di Ingegneria dell’InformazioneUniversità degli Studi di Modena e Reggio EmiliaModenaItaly

Personalised recommendations