Connected-component labeling

Known as: CCA, Connected-component analysis, Connected Component Labeling 
Connected-component labeling (alternatively connected-component analysis, blob extraction, region labeling, blob discovery, or region extraction) is… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
This paper presents a new positional connected component labeling algorithm to label the connected component and to give the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
2011
Review
2011
Connected component labeling (CCL) is a task of detecting connected regions in input data, and it finds its applications in… (More)
  • figure 35.1
  • figure 35.2
  • figure 35.3
  • figure 35.5
  • figure 35.6
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Article history: Received 27 March 2008 Received in revised form 2 September 2008 Accepted 20 October 2008 
  • figure 1
  • figure 3
  • table 1
  • figure 4
  • figure 5
Is this relevant?
2009
2009
This article introduces two fast algorithms for connected component Labeling of binary images, a peculiar case of coloring. The… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We present two optimization strategies to improve connected-component labeling algorithms. Taking together, they form an… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2007
2007
Connected component labeling is very useful for separating object and background, and counting objects. The sequential processing… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 5
  • figure 4
Is this relevant?
2007
2007
This paper, presents a new component labeling algorithm which is based on scanning and labeling the objects in a single scan. The… (More)
  • figure 3
  • figure 2
  • figure 7
  • table 2
  • figure 8
Is this relevant?
Highly Cited
2005
Highly Cited
2005
This paper presents two new strategies that can be used to gre atly improve the speed of connected component labeling algorithms… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper presents a fast algorithm for labeling connected components in binary images based on sequential local operations. A… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1981
Highly Cited
1981
An algorithm is presented for labehng the connected components of an image represented by a quadtree. The algorithm proceeds by… (More)
  • figure 2
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?