Paper
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
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image segmentation

Image processing

Raster graphics

Current controlled current source

Image processing algorithms and systems

Binary data

Photography

RELATED CONTENT

Archiving of line-drawing images
Proceedings of SPIE (November 21 1995)
A Skeletonizing Algorithm With Improved Isotropy
Proceedings of SPIE (November 20 1986)
Text segmentation for automatic document processing
Proceedings of SPIE (January 07 1999)
Fast opening functions and morphological granulometries
Proceedings of SPIE (June 30 1994)
Connectivity-preserving morphological image transformations
Proceedings of SPIE (November 01 1991)

Back to Top