A New Run-based Connected Component Labeling for Efficiently Analyzing and Processing Holes

TL;DR

This paper presents a novel run-based connected component labeling algorithm that efficiently analyzes and processes holes by computing adjacency and features on-the-fly, significantly improving speed over existing methods.

Contribution

The new algorithm introduces a run-based approach with on-the-fly feature computation and transitive closure for efficient hole processing in connected component analysis.

Findings

Faster than existing algorithms for component labeling

Efficient hole filling without rescanning the image

On-the-fly feature computation enhances performance

Abstract

This article introduces a new connected component labeling and analysis algorithm for foreground and background labeling that computes 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 existing algorithms shows that this new algorithm can do all these computations faster than algorithms processing black and white components.