In-Place Algorithm for Connected Components Labeling
Full Text
Close
The Journal of Pattern Recognition Research (JPRR) provides an international forum for the electronic publication of high-quality research and industrial experience articles in all areas of pattern recognition, machine learning, and artificial intelligence. JPRR is committed to rigorous yet rapid reviewing. Final versions are published electronically
(ISSN 1558-884X) immediately upon acceptance.
In-Place Algorithm for Connected Components Labeling
Tetsuo Asano, Hiroshi Tanaka
JPRR Vol 5, No 1 (2010); doi:10.13176/11.218 
Download
Tetsuo Asano, Hiroshi Tanaka
Abstract
Connected components labeling of a binary image is one of the most fundamental operations in image processing.  This paper presents two linear-time algorithms on this topics, one for just reporting the number of connected components and the other for labeling every element of value 1 (or white pixel) by its component index.  An important feature here is that they can be implemented without using any extra array other than the one for an input image and they are suitable for embedded software.
JPRR Vol 5, No 1 (2010); doi:10.13176/11.218 | Full Text  | Share this paper: