Skip to main content
SpringerLink
Log in

A Comparative Review of Two-Pass Connected Component Labeling Algorithms

  • Conference paper
Advances in Soft Computing (MICAI 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7095))

Included in the following conference series:

Abstract

In this paper, we show a comparative review of Connected Component Labeling (CCL) methods, focused in two-pass variants, including their elements and implementation issues. We analyze the main elements used by these CCL algorithms and their importance for the performance of the methods using them. We present some experiments using a complex image set and evaluating the performance of each algorithm under analysis.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chang, F., Chen, C.-J.: A component-labeling algorithm using contour tracing technique. In: International Conference on Document Analysis and Recognition, pp. 741–745 (2003)

    Google Scholar 

  2. Chang, F., Chen, C.-J., Lu, C.-J.: A linear-time component-labeling algorithm using contour tracing technique. Computer Vision and Image Understanding 93(2), 206–220 (2004)

    Article  Google Scholar 

  3. Di Stefano, L., Bulgarelli, A.: A simple and efficient connected components labeling algorithm. In: International Conference on Image Analysis and Processing, pp. 322–327 (1999)

    Google Scholar 

  4. Dillencourt, M.B., Samet, H.: A general approach to connected-component labeling for arbitrary image representations. Journal of the ACM 39(2), 253–280 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fiorio, C., Gustedt, J.: Two linear time Union Find strategies for image processing. Theoretical Computer Science 154(2), 165–181 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  6. Haralick, R.M.: Some Neighborhood Operations. In: Real Time/Parallel Computing Image Analysis, pp. 11–35. Plenum Press (1981)

    Google Scholar 

  7. He, L., Chao, Y., Suzuki, K.: A linear-time two-scan labeling algorithm. In: International Conference on Image Processing, pp. 241–244 (2007)

    Google Scholar 

  8. He, L., Chao, Y., Suzuki, K.: A run-based two-scan labeling algorithm. IEEE Transactions on Image Processing 17(5), 749–756 (2008)

    Article  MathSciNet  Google Scholar 

  9. He, L., Chao, Y., Suzuki, K., Wu, K.: Fast connected-component labeling. Pattern Recognition 42(9), 1977–1987 (2009)

    Article  MATH  Google Scholar 

  10. Rosenfeld, A., Pfaltz, J.L.: Sequential operations in digital picture processing. Journal of the ACM 13(4), 471–494 (1966)

    Article  MATH  Google Scholar 

  11. Wang, X., Davis, W.A.: Connected component labeling using modified linear quadtrees. In: Graphics Interface 1986, pp. 235–240 (1986)

    Google Scholar 

  12. Wu, K., Otoo, E., Suzuki, K.: Two strategies to speed up connected component labeling algorithms. Tech Report LBNL-59102 (2005)

    Google Scholar 

  13. Wu, K., Otoo, E., Suzuki, K.: Optimizing two-pass connected-component labeling algorithms. Pattern Analysis and Applications 12, 117–135 (2009)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidad de Guanajuato DICIS, Carr. Salamanca-Valle Km. 3.5+1.8, Com. Palo Blanco, 36700, Salamanca, Mexico

    Uriel H. Hernandez-Belmonte, Victor Ayala-Ramirez & Raul E. Sanchez-Yanez

Authors
  1. Uriel H. Hernandez-Belmonte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Victor Ayala-Ramirez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Raul E. Sanchez-Yanez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mexican Petroleum Institute (IMP), Eje Central Lazaro Cardenas Norte, 152, Col. San Bartolo Atepehuacan, CP 07730, Mexico DF, Mexico

    Ildar Batyrshin

  2. National Polytechnic Institute (IPN), Center for Computing Research (CIC), Av. Juan Dios Bátiz, s/n, Col. Nueva Industrial Vallejo, CP 07738, Mexico D.F., Mexico

    Grigori Sidorov

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hernandez-Belmonte, U.H., Ayala-Ramirez, V., Sanchez-Yanez, R.E. (2011). A Comparative Review of Two-Pass Connected Component Labeling Algorithms. In: Batyrshin, I., Sidorov, G. (eds) Advances in Soft Computing. MICAI 2011. Lecture Notes in Computer Science(), vol 7095. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25330-0_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25330-0_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25329-4

  • Online ISBN: 978-3-642-25330-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation