Translator Disclaimer
29 April 2005 Optimizing connected component labeling algorithms
Author Affiliations +
Abstract
This paper presents two new strategies that can be used to greatly improve the speed of connected component labeling algorithms. To assign a label to a new object, most connected component labeling algorithms use a scanning step that examines some of its neighbors. The first strategy exploits the dependencies among them to reduce the number of neighbors examined. When considering 8-connected components in a 2D image, this can reduce the number of neighbors examined from four to one in many cases. The second strategy uses an array to store the equivalence information among the labels. This replaces the pointer based rooted trees used to store the same equivalence information. It reduces the memory required and also produces consecutive final labels. Using an array instead of the pointer based rooted trees speeds up the connected component labeling algorithms by a factor of 5 ~ 100 in our tests on random binary images.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kesheng Wu, Ekow Otoo, and Arie Shoshani "Optimizing connected component labeling algorithms", Proc. SPIE 5747, Medical Imaging 2005: Image Processing, (29 April 2005); https://doi.org/10.1117/12.596105
PROCEEDINGS
12 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

A fast Euler number computing algorithm of a binary image
Proceedings of SPIE (October 28 2018)
Hough transform for human action recognition
Proceedings of SPIE (September 27 2016)
Robust scene matching using line segments
Proceedings of SPIE (August 29 2002)
Line Thinning via Merge Split in Run Length Sequences of...
Proceedings of SPIE (February 28 1990)
Principal curve detection in complicated graph images
Proceedings of SPIE (September 19 2001)

Back to Top