Open AccessA fast and memory-efficient two-pass connected-component labeling algorithm for binary images
Author(s) -
Bilal Bataineh
Publication year - 2019
Publication title -
turkish journal of electrical engineering and computer sciences/elektrik
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.225
H-Index - 30
eISSN - 1303-6203
pISSN - 1300-0632
DOI - 10.3906/elk-1703-351
Subject(s) - connected component labeling , computer science , tracing , pipeline (software) , connected component , algorithm , binary number , component (thermodynamics) , process (computing) , binary image , set (abstract data type) , image (mathematics) , base (topology) , pattern recognition (psychology) , image processing , artificial intelligence , image segmentation , mathematics , arithmetic , mathematical analysis , physics , programming language , thermodynamics , scale space segmentation , operating system
Connected-component labeling is an important process in image analysis and pattern recognition. It aims to deduct the connected components by giving a unique label value for each individual component. Many algorithms have been proposed, but they still face several problems such as slow execution time, falling in the pipeline, requiring a huge amount of memory with high resolution, being noisy, and giving irregular images. In this work, a fast and memory- efficient connected-component labeling algorithm for binary images is proposed. The proposed algorithm is based on a new run-base tracing method with a new resolving process to find the final equivalent label values. A set of experiments were conducted on different types of binary images. The proposed algorithm showed high performance compared to the other algorithms.