A comparative review of two-pass connected component labeling algorithms

Authors:
Uriel H. Hernandez-Belmonte;Victor Ayala-Ramirez;Raul E. Sanchez-Yanez
Affiliations:
Universidad de Guanajuato DICIS, Salamanca, Mexico;Universidad de Guanajuato DICIS, Salamanca, Mexico;Universidad de Guanajuato DICIS, Salamanca, Mexico
Venue:
MICAI'11 Proceedings of the 10th international conference on Artificial Intelligence: advances in Soft Computing - Volume Part II
Year:
2011

Citing 10
Cited 0

Connected component labeling using modified linear quadtrees

Proceedings on Graphics Interface '86/Vision Interface '86
A general approach to connected-component labeling for arbitrary image representations

Journal of the ACM (JACM)
Two linear time Union-Find strategies for image processing

Theoretical Computer Science
Sequential Operations in Digital Picture Processing

Journal of the ACM (JACM)
A Simple and Efficient Connected Components Labeling Algorithm

ICIAP '99 Proceedings of the 10th International Conference on Image Analysis and Processing
A Component-Labeling Algorithm Using Contour Tracing Technique

ICDAR '03 Proceedings of the Seventh International Conference on Document Analysis and Recognition - Volume 2
A linear-time component-labeling algorithm using contour tracing technique

Computer Vision and Image Understanding
Optimizing two-pass connected-component labeling algorithms

Pattern Analysis & Applications
Fast connected-component labeling

Pattern Recognition
A Run-Based Two-Scan Labeling Algorithm

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we show a comparative review of Connected Component Labeling (CCL) methods, focused in two-pass variants, including their elements and implementation issues. We analyze the main elements used by these CCL algorithms and their importance for the performance of the methods using them. We present some experiments using a complex image set and evaluating the performance of each algorithm under analysis.