A New Framework for Connected Components Labeling of Binary Images

  • Tetsuo Asano
  • Sergey Bereg
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7655)

Abstract

Given a binary image of n pixels, assign integral labels to all pixels so that any background pixel has label 0 and any two foreground pixels have the same positive integral labels, if and only if they belong to the same connected components. This problem is referred to as ’Connected Components Labeling’ and it is one of the most fundamental problems in image processing and analysis. This paper presents a new algorithmic framework for the problem. From an algorithmic point of view, the problem can be solved in O(n) time and O(n) space. We propose new algorithms which use smaller work space without much sacrifice of the running time. More specifically, assuming that an input binary image is given by a read-only array, our algorithm outputs correct labels in the raster order in O(n logn) time using only \(O(\sqrt{n})\) work space. Some applications of the algorithms are also given.

Keywords

Connected component Limited work space Computational complexity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alnuweiri, H.M., Prasanna, V.K.: Parallel architectures and algorithms for image component labeling. IEEE Trans. Pattern Anal. Mach. Intell. 14(10), 1024–1034 (1992)Google Scholar
  2. 2.
    Asano, T.: Do We Need a Stack to Erase a Component in a Binary Image? In: Boldi, P. (ed.) FUN 2010. LNCS, vol. 6099, pp. 16–27. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  3. 3.
    Asano, T., Bereg, S., Kirkpatrick, D.: Finding Nearest Larger Neighbors. In: Albers, S., Alt, H., Näher, S. (eds.) Festschrift Mehlhorn. LNCS, vol. 5760, pp. 249–260. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  4. 4.
    de Berg, M., van Kreveld, M., van Oostrum, R., Overmars, M.: Simple traversal of a subdivision without extra storage. International Journal of Geographic Information Systems 11, 359–373 (1997)CrossRefGoogle Scholar
  5. 5.
    Bhattacharya, P.: Connected component labeling for binary images on a reconfigurable mesh architectures. J. Syst. Arch. 42(4), 309–313 (1996)CrossRefGoogle Scholar
  6. 6.
    Bose, P., Morin, P.: An improved algorithm for subdivision traversal without extra storage. Int. J. Comput. Geometry Appl. 12(4), 297–308 (2002)MathSciNetMATHCrossRefGoogle Scholar
  7. 7.
    Chang, F., Chen, C.J., Lu, C.J.: A linear-time component-labeling algorithm using contour tracing technique. Comput. Vis. Image Understand. 93, 206–220 (2004)CrossRefGoogle Scholar
  8. 8.
    Choudhary, A., Thakur, R.: Connected component labeling on coarse grain parallel computers: An experimental study. J. Parallel Distrib. Comput. 20, 78–83 (1994)MATHCrossRefGoogle Scholar
  9. 9.
    Dillencourt, M.B., Samet, H., Tamminen, M.: A general approach to connected-component labeling for arbitrary image representations. J. ACM 39(2), 253–280 (1992)MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    Goto, T., Ohta, Y., Yoshida, M., Shirai, Y.: High speed algorithm for component labeling. Trans. IEICE J72-D-II(2), 247–255 (1989) (in Japanese)Google Scholar
  11. 11.
    He, L., Chao, Y., Suzuki, K.: A run-based two-scan labeling algorithm. IEEE Trans. on Image Processing 17(5), 749–756 (2008)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Digital Picture Analysis. Elsevier (2004)Google Scholar
  13. 13.
    Malgouyres, R., More, M.: On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology. Theoretical Computer Science 283, 67–108 (2002)MathSciNetMATHCrossRefGoogle Scholar
  14. 14.
    Munro, J.I., Suwanda, H.: Implicitdatastructures for fast search and update. J. of Computer and System Sciences 21(2), 236–250 (1980)MathSciNetMATHCrossRefGoogle Scholar
  15. 15.
    Rosenfeld, A., Pfalts, J.L.: Sequential operations in digital picture processing. J. ACM 13(4), 471–494 (1966)MATHCrossRefGoogle Scholar
  16. 16.
    Rosenfeld, A.: Connectivity in digital pictures. J. ACM 17(1), 146–160 (1970)MathSciNetMATHCrossRefGoogle Scholar
  17. 17.
    Rosenfeld, A., Kak, A.C.: Digital Picture Processing, 2nd edn., vol. 2. Academic, San Diego (1982)Google Scholar
  18. 18.
    Samet, H.: Connected component labeling using quadtrees. J. ACM 28(3), 487–501 (1981)MathSciNetMATHCrossRefGoogle Scholar
  19. 19.
    Suzuki, K., Horiba, I., Sugie, N.: Linear-time connected-component labeling based on sequential local operations. Comput. Vis. Image Understand. 89, 1–23 (2003)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Tetsuo Asano
    • 1
  • Sergey Bereg
    • 2
  1. 1.Japan Advanced Institute of Science and Technology (JAIST)IshikawaJapan
  2. 2.Department of Computer ScienceUniversity of Texas at DallasUSA

Personalised recommendations