Translator Disclaimer
2 February 2012 A simple and efficient algorithm for connected component labeling in color images
Author Affiliations +
Abstract
Connected component labeling is a fundamental operation in binary image processing. A plethora of algorithms have been proposed for this low-level operation with the early ones dating back to the 1960s. However, very few of these algorithms were designed to handle color images. In this paper, we present a simple algorithm for labeling connected components in color images using an approximately linear-time seed fill algorithm. Experiments on a large set of photographic and synthetic images demonstrate that the proposed algorithm provides fast and accurate labeling without requiring excessive stack space.
© (2012) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
M. Emre Celebi "A simple and efficient algorithm for connected component labeling in color images", Proc. SPIE 8295, Image Processing: Algorithms and Systems X; and Parallel Processing for Imaging Applications II, 82951H (2 February 2012); https://doi.org/10.1117/12.911047
PROCEEDINGS
6 PAGES


SHARE
Advertisement
Advertisement
Back to Top