Efficient Component Labeling of Images of Arbitrary Dimension Represented by Linear Bintrees

  title={Efficient Component Labeling of Images of Arbitrary Dimension Represented by Linear Bintrees},
  author={Hanan Samet and Markku Tamminen},
  journal={IEEE Trans. Pattern Anal. Mach. Intell.},
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… 

Figures and Tables from this paper

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

An improved and general approach to connected-component labeling of images is presented, and it is shown that when the algorithm is specialized to a pixel array scanned in raster order, the total processing time is linear in the number of pixels.

A Probabilistic Analysis of Trie-Based Sorting of Large Collections of Line Segments in Spatial Databases

The size of five trie-based methods of sorting large collections of line segments in a spatial database is investigated analytically using a random lines image model and geometric probability techniques, and the properties of the trie representations, when used to store real data, are similar to their properties when storing random lines data.

Parallel Computation of Component Trees on Distributed Memory Machines

This work proposes a new efficient hybrid algorithm for the parallel computation of two particular component trees—the max- and min-tree—in shared and distributed memory environments and a novel tuple-based merging scheme allows to merge the acquired partial images into a globally correct view.

Hierarchical representations of collections of small rectangles

A tutorial survey is presented of hierarchical data structures for representing collections of small rectangles. Rectangles are often used as an approximation of shapes for which they serve as the

Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees

A variant of the plane-sweep paradigm known as topological sweep is adapted to solve geometric problems involving two-dimensional regions when the underlying representation is a region quadtree to represent the boundaries of a map in O(M) space andO(Mα(M)) time.

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

Fast connected-component labeling

Multidimensional data structures for spatial applications

An overview is presented of a number of representations of multidimensional data that arise in spatial applications and the emphasis is on hierarchical representations based on the "divide-and-conquer" problem-solving paradigm.

A new linear octree construction by filling algorithms

  • Shin-Nine YangT. Lin
  • Computer Science
    [1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications
  • 1991
A novel linear octree construction based on filling the closed voxel-based border is proposed, which is optimal in the sense that all boundary voxels are traversed only once and all octants of the octree are also examined once.


An implementation of connection-component labeling is presented that utilizes micro-specialization in a number of procedures and is derived from a modification of the image labeling routines found in the popular scientific computing library, Scipy.



Computing Geometric Properties of Images Represented by Linear Quadtrees

A general algorithm to compute geometric image properties such as the perimeter, the Euler number, and the connected components of an image is developed and analyzed and implementation experience has confirmed its superiority to existing approaches to computing geometric properties for images represented by quadtrees.

Connected Component Labeling Using Quadtrees

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 comprising the area connected by the components.

Geometric modeling using octree encoding

Comment on Quad- and Octtrees

It is claimed that studying the case of binary division provides for a more general understanding of the underlying structures and that less attention is needed on the separate results concerning quadand octtrees.

Quad-Trees, Oct-Trees, and K-Trees: A Generalized Approach to Recursive Decomposition of Euclidean Space

The algorithm provides a method for computing the perimeter of a quad-tree encoded image or the surface area of an oct- tree encoded object in worst case time proportional to the number of nodes in the tree, improves upon the expected-case linear-time method of Samet for the perimeter problem.

A hierarchical data structure for multidimensional digital images

A tree data structure for representing multidimensional digital binary images and an algorithm for constructing the tree of a d-dimensional binary image from the trees of its (d - 1 )-dimensional cross sections are given.

Efficient octree conversion by connectivity labeling

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.

Oct-trees and their use in representing three-dimensional objects

An effective way to represent quadtrees

The sorted array of black nodes is referred to as the “linear quadtree” and it is shown that it introduces a saving of at least 66 percent of the computer storage required by regular quadtrees.