An efficient run-based Connected Component Labeling algorithm for processing holes - Archive ouverte HAL Access content directly
Conference Papers Year :

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.
Fichier principal
Vignette du fichier
BNBW22_FLSL+holes.pdf (519.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03689462 , version 1 (07-06-2022)

Identifiers

  • HAL Id : hal-03689462 , version 1

Cite

Florian Lemaitre, Nathan Maurice, Lionel Lacassagne. An efficient run-based Connected Component Labeling algorithm for processing holes. Binary is the new Black and White workshop @ IEEE ICIAP 2022, May 2022, Lecce, Italy. ⟨hal-03689462⟩
57 View
226 Download

Share

Gmail Facebook Twitter LinkedIn More