A New Algorithm for Binary Connected Components Labeling
Chen Bai-sheng · Computer Engineering and Applications Journal · 2006
A new algorithm based on region-growing for binary connected components labeling is proposed in this paper.Compared with the traditional method,the characteristic of the algorithm is that all the connected components are labeled in a single scan of the input binary image and the problem of labeling redundancy,which most improved methods have to deal with,is avoided.Otherwise,the computation of the algorithm is independent of the shapes of the connected components.At the end of this paper,the computation complexity of the algorithm is discussed,and comparative experiments with traditional method and two of its improved methods are made.The experimental results show the proposed algorithm high efficiency and robustness.