Connected Component Labeling Using Quadtrees

@article{Samet1981ConnectedCL,
  title={Connected Component Labeling Using Quadtrees},
  author={Hanan Samet},
  journal={J. ACM},
  year={1981},
  volume={28},
  pages={487-501}
}
  • H. Samet
  • Published 1981
  • Computer Science
  • J. ACM
Abstract : An algorithm is presented for labeling the connected components of an image represented by a quadtree. The algorithm proceeds by exploring all possible adjacencies for each node once and only once. Once this is done, any equivalences generated by the adjacency labeling phase are propagated. Analysis of the algorithm reveals that its worst case average execution time is bounded by a quantity proportional to the product of the log of the region's diameter and the number of blocks… Expand
Algorithms for connected component labeling based on quadtrees
TLDR
An algorithm of linear time complexity to label connected components of a binary image by a quadtree that has shown the best performance in large images. Expand
- 235-CONNECTED COMPONENT LABELING USING MODIFIED LINEAR QUADTREES
Using the modified linear quadtree proposed in [1,9], this paper presents an O(n·N) algorithm for labeling connected components of a region consisting of N BLACK nodes in a 2n by 2n binary image. AsExpand
Computing Perimeters of Regions in Images Represented by Quadtrees
  • H. Samet
  • Computer Science, Medicine
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 1981
An algorithm is presented for computing the total perimeter of a region in a binary image represented by a quadtree. The algorithm explores each segment of the boundary of the region once and onlyExpand
Comments on “detection of connectivity for regions represented by linear quadtrees”
Abstract In a recent paper by Gargantini, an algorithm for evaluating the connected regions of an image represented as a linear quadtree is presented. This note observes a case where the algorithmExpand
Computing the Euler number of an image from its quadtree
Abstract An algorithm is presented which computes the Euler number, i.e., the number of components minus the number of holes, of a binary image represented by a quadtree. The local property-countingExpand
Path-Length distances for quadtrees
  • M. Shneier
  • Mathematics, Computer Science
  • Inf. Sci.
  • 1981
TLDR
An algorithm is presented that calculates the distance from the center of each black node to the border of the nearest white node, and the worst-case average execution time is shown to be proportional to the product of the logarithm of the image diameter and the number of blocks in the image. Expand
Neighbor finding techniques for images represented by quadtrees
  • H. Samet
  • Computer Science
  • Comput. Graph. Image Process.
  • 1982
TLDR
Algorithms are given for determining adjacencies in the horizontal, vertical, and diagonal directions and the execution times of the algorithms are analyzed using a suitably defined model. Expand
Efficient Component Labeling of Images of Arbitrary Dimension Represented by Linear Bintrees
TLDR
An algorithm is presented to perform connected-component labeling of images of arbitrary dimension that are represented by a linear bintree that uses an active border which is represented by linked lists instead of arrays, resulting in a significant reduction in the space requirements, thereby making it feasible to process three- and higher-dimensional images. Expand
Efficient octree conversion by connectivity labeling
TLDR
An algorithm for converting from the boundary representation of a solid to the corresponding octree model is presented, utilizing an efficient new connected components labeling technique and demonstrating that all processing can be performed directly on linear quad and octree encodings. Expand
MAINTAINING CONNECTED COMPONENTS IN QUADTREE-BASED REPRESENTATION OF IMAGES
TLDR
This paper considers the problem of maintaining connected components in quadtree representation of binary images when a small portion of the image undergoes change and proposes algorithms to update the quadtree and the connected components labeling when a homogeneous region in the Quadtree is changed. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 23 REFERENCES
Computing the Euler number of an image from its quadtree
Abstract An algorithm is presented which computes the Euler number, i.e., the number of components minus the number of holes, of a binary image represented by a quadtree. The local property-countingExpand
Region representation: quadtrees from boundary codes
An algorithm is presented for constructing a quadtree for a region given its boundary in the form of a chain code. Analysis of the algorithm reveals that its execution time is proportional to theExpand
Operations on Images Using Quad Trees
TLDR
Warnock-type algorithms are presented for building the quad tree for the picture of the boundary of apolygon, and for coloring the interior of such a polygon. Expand
Region representation: boundary codes from quadtrees
TLDR
This paper presents an algorithm for converting from quadtrees to a simple class of boundary codes and is shown to have an execution time proportional to the perimeter of the region. Expand
Linear transformation of pictures represented by quad trees
Abstract An algorithm is described for transforming a quad tree encoding for a picture into a quad tree for the same picture after application of a general linear operator. The technique relies onExpand
Picture decomposition, tree data-structures, and identifying directional symmetries as node combinations
The general problem treated in this paper is that of extracting structural information from an object in a scene. In particular, symmetries are used as another — in addition to the average intensityExpand
Picture Segmentation by a Tree Traversal Algorithm
TLDR
This paper combines the two approaches with significant increase in processing speed while maintaining small memory requirements and the data structure is described in detail. Expand
Connectivity in Digital Pictures
TLDR
It is shown that every simply-connected object in such a picture has elements which can be deleted without destroying its simple- connectedness, which makes it easy to prove that a well-known "shrinking" algorithm always works--that is, shrinks any simply- connected object down to a single element. Expand
A hierarchical data structure for picture processing
In order to speed up several picture processing operations, including edge detection, a “pyramid” (hierarchy of fine to coarse resolution versions of a picture) is produced. The low spatialExpand
Computational Techniques in the Visual Segmentation of Static Scenes.
TLDR
The complexities encountered in applying segmentation techniques to color images of natural scenes involving complex textured objects are analyzed and new ways of using the techniques to overcome some of the problems are explored. Expand
...
1
2
3
...