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
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.
Integrity signals
Registry
Cites
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.
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
A Threshold Selection Method from Gray-Level Histograms
Otsu, N. (1979) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1979.4310076 · Cited by 43,398
(1982) · Elsevier eBooks · doi:10.1016/c2009-0-21955-6 · Cited by 4,596
Haralock, R. M., & Shapiro, L. G. (1991) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 3,933
Warshall, S. (1962) · Journal of the ACM · doi:10.1145/321105.321107 · Cited by 1,683
Sequential Operations in Digital Picture Processing
Rosenfeld, A., & Pfaltz, J. L. (1966) · Journal of the ACM · doi:10.1145/321356.321357 · Cited by 1,675
Brownrigg, D. R. K. (1992) · Computer Physics Communications · doi:10.1016/0010-4655(92)90019-u · Cited by 920
A general approach to connected-component labeling for arbitrary image representations
Dillencourt, M. B., Samet, H., & Tamminen, M. (1992) · Journal of the ACM · doi:10.1145/128749.128750 · Cited by 512
Handbook of image processing operators
Klette, R., & Zamperoni, P. (1996) · Medical Entomology and Zoology · Cited by 211
Hypermedia image processing reference
Fisher, R. B. (1996) · Wiley eBooks · Cited by 152
Cited by
Wang, W.-C., Chen, S.-L., Chen, L.-B., & Chang, W.-J. (2017) · IEEE Access · doi:10.1109/access.2016.2631658 · Cited by 118
Metadata
- Authors
- Di Stefano, L., & Bulgarelli, A.
- Venue
- Proceedings 10th International Conference on Image Analysis and Processing
- Publisher
- IEEE Comput. Soc
- 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.