2019
DOI: 10.3906/elk-1703-351
|View full text |Cite
|
Sign up to set email alerts
|

A fast and memory-efficient two-pass connected-component labeling algorithm for binary images

Abstract: 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 bin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 19 publications
0
6
0
Order By: Relevance
“…Halıcı and Demirhan [36] worked on multi-person real-time pose tracking with the global nearest neighbor method. Bataineh [24] examined the performance results were shared the resource needs of CCL algorithms. Without regard to, considering the resource capacity of mobile devices, these algorithms were not preferred in our study.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Halıcı and Demirhan [36] worked on multi-person real-time pose tracking with the global nearest neighbor method. Bataineh [24] examined the performance results were shared the resource needs of CCL algorithms. Without regard to, considering the resource capacity of mobile devices, these algorithms were not preferred in our study.…”
Section: Discussionmentioning
confidence: 99%
“…It makes recommendations for high performance by comparing the work done by Bataineh [24] on image-analysis and pattern-recognition algorithms. In the study of Zaitsev [25] on d-dimensional cellular automata, he examined the theoretical background of edge detection algorithms and made some suggestions.…”
Section: Literaturementioning
confidence: 99%
“…After moving object detection, connected region labeling algorithms can be employed to obtain the coordinates of moving regions. Many works are reported in the literature, e.g., [ 24 , 25 , 26 , 27 , 28 , 29 , 30 ], for labeling connected components. However, these methods suffer from high computational complexity.…”
Section: Related Workmentioning
confidence: 99%
“…The unlabeled dataset is essentially divided into labeled groups regardless of the presence of similar patterns [8,9]. These labeled clusters can be used simply to process and analyze large and complex datasets in many applications, such as healthcare [10,11], renewable energy [12,13], image segmentation [14][15][16], data analysis [1,9], social network analysis [17,18], security [19,20], finance and business [21,22], and much more. Many studies on clustering algorithms have been conducted.…”
Section: Introductionmentioning
confidence: 99%