Fast connected-component labeling

  • Authors:

  • Lifeng He;Yuyan Chao;Kenji Suzuki;Kesheng Wu

  • Affiliations:

  • Graduate School of Information Science and Technology, Aichi Prefectural University, Nagakute, Aichi 480-1198, Japan and ShaanXi University of Science & Technology, Xi'an Shannxi 710021, China;Graduate School of Environment Management, Nagoya Sangyo University, Aichi 488-8711, Japan and ShaanXi University of Science & Technology, Xi'an Shannxi 710021, China;Department of Radiology, Division of the Biological Sciences, The University of Chicago, Chicago, IL 60637, USA;Lawrence Berkeley National Laboratory, University of California, Berkeley, CA, USA

  • Venue:
  • Pattern Recognition
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

Labeling of connected components in a binary image is one of the most fundamental operations in pattern recognition: labeling is required whenever a computer needs to recognize objects (connected components) in a binary image. This paper presents a fast two-scan algorithm for labeling of connected components in binary images. We propose an efficient procedure for assigning provisional labels to object pixels and checking label equivalence. Our algorithm is very simple in principle, easy to implement, and suitable for hardware and parallel implementation. We show the correctness of our algorithm, analyze its complexity, and compare it with other labeling algorithms. Experimental results demonstrated that our algorithm is superior to conventional labeling algorithms.