The DOI matches its Crossref record.
Efficient component labeling of images of arbitrary dimension represented by linear bintrees
Abstract
An algorithm is presented to perform connected-component labeling of images of arbitrary dimension that are represented by a linear bintree. The bintree is a generalization of the quadtree data structure that enables dealing with images of arbitrary dimension. The linear bintree is a pointerless representation. The algorithm uses an active border which is represented by linked lists instead of arrays. This results in a significant reduction in the space requirements, thereby making it feasible to process three- and higher-dimensional images. Analysis of the execution time of the algorithm shows almost linear behavior with respect to the number of leaf nodes in the image, and empirical tests are in agreement. The algorithm can be modified easily to compute a (d-1)-dimensional boundary measure (e.g. perimeter in two dimensions and surface area in three dimensions) with linear performance.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
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
Self-citationLinear-time connected-component labeling based on sequential local operations
Suzuki, K., Horiba, I., & Sugie, N. (2003) · Computer Vision and Image Understanding · doi:10.1016/s1077-3142(02)00030-9 · Cited by 414
SVM-Based Classification of Segmented Airborne LiDAR Point Clouds in Urban Areas
Zhang, J., Lin, X., & Ning, X. (2013) · Remote Sensing · doi:10.3390/rs5083749 · Cited by 274
SGoLAM: Simultaneous Goal Localization and Mapping for Multi-Object Goal Navigation
Kim, J., Lee, E. S., Lee, M., Zhang, D., & Kim, Y. M. (2021) · arXiv · doi:10.48550/arxiv.2110.07171 · Cited by 5
Metadata
- Authors
- Samet, H., & Tamminen, M.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1988-07
- Volume
- 10
- Issue
- 4
- Pages
- 579-586
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2120617193
- Cited by
- 350
- References
- 0
- FWCI
- 3.53
- Type
- journal article
- 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: Efficient component labeling of images of arbitrary dimension represented by linear bintrees. https://app.cochat.ai/papers/10.1109/34.3918
- The paper
- Samet, H., & Tamminen, M. (1988). Efficient component labeling of images of arbitrary dimension represented by linear bintrees. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/34.3918
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.
