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)
Linear-time connected-component labeling based on sequential local operations
Computer Vision and Image Understanding
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
Fast connected-component labeling
Pattern Recognition
A Run-Based Two-Scan Labeling Algorithm
IEEE Transactions on Image Processing
A genetic algorithm-based clustering and two-scan labelling for colour image segmentation
International Journal of Computational Vision and Robotics
| Hi-index | 0.00 |
In this paper we present an overview of the historical evolution of connected component labeling algorithms, and in particular the ones applied on images stored in raster scan order. This brief survey aims at providing a comprehensive comparison of their performance on modern architectures, since the high availability of memory and the presence of caches make some solutions more suitable and fast. Moreover we propose a new strategy for label propagation based on a 2x2 blocks, which allows to improve the performance of many existing algorithms. The tests are conducted on high resolution images obtained from digitized historical manuscripts and a set of transformations is applied in order to show the algorithms behavior at different image resolutions and with a varying number of labels.