The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
1992
DOI: 10.1145/128749.128750
|View full text |Cite
|
Sign up to set email alerts
|

A general approach to connected-component labeling for arbitrary image representations

Abstract: Abstract. An improved and general approach to connected-component labeling of images is presented. The algorithm presented in this paper processes images in predeterttuned order, which means that the processing order depends only on the image representation scheme and not on specific properties of the image. The algorithm handles a wide variety of image representation schemes (rasters, run lengths, quadtrees, bintrees, etc.). How to adapt the standard UNION-FIND algorithm to permit reuse of tempora~labels is s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
209
0
1

Year Published

1999
1999
2022
2022

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 434 publications
(210 citation statements)
references
References 8 publications
0
209
0
1
Order By: Relevance
“…The isolated components which are included in upper and lower zones are segmented using connected component (CC) analysis [36] and next they are recognized and labelled as text characters. After resizing the images to 150x150, here also PHOG feature of vector length 168 is extracted from the components of upper and lower zone modifiers.…”
Section: B Upper/lower Zone Modifier Modeling Using Svmmentioning
confidence: 99%
“…The isolated components which are included in upper and lower zones are segmented using connected component (CC) analysis [36] and next they are recognized and labelled as text characters. After resizing the images to 150x150, here also PHOG feature of vector length 168 is extracted from the components of upper and lower zone modifiers.…”
Section: B Upper/lower Zone Modifier Modeling Using Svmmentioning
confidence: 99%
“…Connected component labelling [16], with 8-connected neighbourhoods, is performed on the contour map and a connected component is obtained for each continuous contour. The Moore-Neighbour tracing algorithm with Jacob's stopping criteria [28] is applied to each component to provide sequences of points.…”
Section: B Producing the Segment Maps 1) Traversing A Contourmentioning
confidence: 99%
“…The core of the non-iterative SIAM software pipeline is a one-pass prior knowledge-based decision tree (expert system) for MS reflectance space hyperpolyhedralization (quantization, partitioning) into static (non-adaptive-to-data) color names, see Figure 2 and refer to Chapter 2 and Chapter 3 in the Part 1. Presented in the RS literature where enough information was provided for the implementation to be reproduced (Baraldi et al, 2006), the SIAM expert system for MS color naming is followed by a well-posed two-pass superpixel detector in the multi-level color map-domain (Dillencourt, Samet, & Tamminen, 1992; Sonka, Hlavac, & Boyle, 1994) and a per-pixel VQ error assessment for VQ quality assurance, in agreement with the GEO-CEOS QA4EO Val guidelines, refer to Figure 4 in the Part 1 of this paper.
10.1080/23312041.2018.1467254-F0002Figure 2.(same as Figure 5 in the Part 1 of this paper, duplicated for the sake of readability of the present Part 2). Examples of land cover (LC) class-specific families of spectral signatures in top-of-atmosphere reflectance (TOARF) values that include surface reflectance (SURF) values as a special case in clear sky and flat terrain conditions.
…”
Section: Introductionmentioning
confidence: 99%