Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 252

The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.

A simple and efficient connected components labeling algorithm

Di Stefano, L., Bulgarelli, A. · 2003 · Proceedings 10th International Conference on Image Analysis and Processing

Abstract

We describe a two-scan algorithm for labeling connected components in binary images in raster format. Unlike the classical two-scan approach, our algorithm processes equivalences during the first scan by merging equivalence classes as soon as a new equivalence is found. We show that this significantly improves the efficiency of the labeling process with respect to the classical approach. The data structure used to support the handling of equivalences is a 1D-array. This renders the more frequent operation of finding class identifiers very fast, while the less-frequent class-merging operation has a relatively high computational cost. Nonetheless, it is possible to reduce significantly the merging cost by two slight modifications to the algorithm's basic structure. The idea of merging equivalence classes is present also in Samet's general labeling algorithm. However when considering the case of binary images in raster format this algorithm is much more complex than the one we describe in this paper.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/iciap.1999.797615

Cites

9 of 9 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 9 references

Metadata

Authors
Di Stefano, L., & Bulgarelli, A.
Venue
Proceedings 10th International Conference on Image Analysis and Processing
Published
2003-01-20
Pages
322-327
OpenAlex
W2116442452
Cited by
252
References
9
FWCI
2.71
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A simple and efficient connected components labeling algorithm. https://app.cochat.ai/papers/10.1109/iciap.1999.797615
The paper
Di Stefano, L., & Bulgarelli, A. (2003). A simple and efficient connected components labeling algorithm. Proceedings 10th International Conference on Image Analysis and Processing. https://doi.org/10.1109/iciap.1999.797615

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.