A novel line based connected component labeling algorithm

This paper presents a fast connected component labeling algorithm based on line description method and optimized tree Union-Find strategy. The algorithm transforms the pixel-connected issue, which most of proposed algorithms focus on, into line-connected issue. This algorithm is comprised of three phrases, line extraction, connected component identification and label assignment. The line description method transforms the connected pixels into line form for reducing the scan time. While the new tree Union-Find strategy diminishes the redundant root compare operations. A comparison analysis is performed with other optimized famous component labeling algorithms. Our algorithm has shown an outstanding performance with respect to the processing time, which achieves 1.1~8 times as fast as the other algorithms in various test cases.