2003
DOI: 10.1016/s1077-3142(02)00030-9
|View full text |Cite
|
Sign up to set email alerts
|

Linear-time connected-component labeling based on sequential local operations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
196
0
2

Year Published

2009
2009
2019
2019

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 382 publications
(206 citation statements)
references
References 27 publications
0
196
0
2
Order By: Relevance
“…To this end, we employ connected component analysis [21], well known from image processing, to extract all connected regions in the binarized tactile image and choose the largest one as the considered contact region R -neglecting all smaller regions as originating from noise or spurious contacts.…”
Section: Feature Extraction From Tactile Imagesmentioning
confidence: 99%
“…To this end, we employ connected component analysis [21], well known from image processing, to extract all connected regions in the binarized tactile image and choose the largest one as the considered contact region R -neglecting all smaller regions as originating from noise or spurious contacts.…”
Section: Feature Extraction From Tactile Imagesmentioning
confidence: 99%
“…Recent publications by Suzuki et al [5] and Wu et al [11] give a nice description of the label equivalence procedure for the labeling of connected components in a binary image in the sequential case.…”
Section: Hoshen-kopelman or Label Equivalencementioning
confidence: 99%
“…Since the early 70s, numerous approaches for connected component labeling have been introduced [2,3,4,5]. Most of these approaches are suitable for sequential processing, but also some parallel algorithms have been developed [6,7].…”
Section: Introductionmentioning
confidence: 99%
“…It usually used a connected components labeling (CCL) algorithm. In papers by Suzuki, Wu et al [6][7][8], approaches and algorithms for CCL are categorized into a number of groups. Two pass algorithms show very high performance, but require large memory to store label equivalence.…”
Section: Introduction 1)mentioning
confidence: 99%