Combinatorial Image Analaysis

Volume 7655 of the series Lecture Notes in Computer Science pp 90-102

A New Framework for Connected Components Labeling of Binary Images

  • Tetsuo AsanoAffiliated withJapan Advanced Institute of Science and Technology (JAIST)
  • , Sergey BeregAffiliated withDepartment of Computer Science, University of Texas at Dallas

* Final gross prices may vary according to local VAT.

Get Access


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.


Connected component Limited work space Computational complexity