An efficient run-based Connected Component Labeling algorithm for processing holes
Abstract
This article introduces a new connected component labeling and analysis algorithm framework that is able to compute in one pass the foreground and the background labels as well as the adjacency tree. The computation of features (bounding boxes, first statistical moments, Euler number) is done on-the-fly. The transitive closure enables an efficient hole processing that can be filled while their features are merged with the surrounding connected component without the need to rescan the image. A comparison with State-of-the-Art shows that this new algorithm can do all these computations faster than all existing algorithms processing foreground and background connected components or holes.
Domains
Signal and Image processing Automatic Hardware Architecture [cs.AR] Data Structures and Algorithms [cs.DS] Computer Vision and Pattern Recognition [cs.CV] Signal and Image Processing Image Processing [eess.IV] Robotics [cs.RO] Discrete Mathematics [cs.DM] Software Engineering [cs.SE] Distributed, Parallel, and Cluster Computing [cs.DC] Computer Arithmetic
Origin : Files produced by the author(s)