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.
Keywords connected component labeling - comparison - union-find