Abstract
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.
Chapter PDF
Similar content being viewed by others
References
Rosenfeld, A., Pfaltz, J.L.: Sequential Operations in Digital Picture Processing. Journal of the ACM 13(4), 471–494 (1966)
Haralick, R.M.: Some neighborhood operations. In: Real Time Parallel Computing: Image Analysis, pp. 11–35. Plenum Press, New York (1981)
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)
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)
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)
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)
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)
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)
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)
Freeman, H.: Techniques for the Digital Computer Analysis of Chain-Encoded Arbitrary Plane Curves. In: 17th National Electronics Conference, pp. 412–432 (1961)
Pavlidis, T.: Algorithms for graphics and image processing. Computer Science Press, Rockville MD (1982)
Wu, K., Otoo, E., Shoshani, A.: Optimizing connected component labeling algorithms. In: SPIE Conference on Medical Imaging, vol. 5747, pp. 1965–1976 (2005)
Fiorio, C., Gustedt, J.: Two Linear Time Union-Find Strategies for Image Processing. Theor. Comput. Sci. 154, 165–181 (1996)
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)
He, L., Chao, Y., Suzuki, K.: A Run-Based Two-Scan Labeling Algorithm. IEEE Transactions on Image Processing 17(5), 749–756 (2008)
He, L., Chao, T., Suzuki, K., Wu, K.: Fast connected-component labeling. Pattern Recognition (2008) (in press)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grana, C., Borghesani, D., Cucchiara, R. (2009). Connected Component Labeling Techniques on Modern Architectures. In: Foggia, P., Sansone, C., Vento, M. (eds) Image Analysis and Processing – ICIAP 2009. ICIAP 2009. Lecture Notes in Computer Science, vol 5716. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04146-4_87
Download citation
DOI: https://doi.org/10.1007/978-3-642-04146-4_87
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04145-7
Online ISBN: 978-3-642-04146-4
eBook Packages: Computer ScienceComputer Science (R0)