Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03689462
Contributor : Lionel Lacassagne Connect in order to contact the contributor
Submitted on : Tuesday, June 7, 2022 - 11:42:40 AM
Last modification on : Thursday, June 9, 2022 - 3:37:24 AM

File

BNBW22_FLSL+holes.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03689462, version 1

Citation

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⟩

Share

Metrics

Record views

30

Files downloads

7