Issue No. 04 - July (1988 vol. 10)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.3918
<p>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 to process three- and higher-dimensional images. Analysis of the execution time of the algorithm shows almost linear behavior with respect to the number of leaf nodes in the image, and empirical tests are in agreement. The algorithm can be modified easily to compute a (d-1)-dimensional boundary measure (e.g. perimeter in two dimensions and surface area in three dimensions) with linear performance.</p>
image analysis; computerised pattern recognition; computerised picture processing; component labeling; linear bintrees; quadtree data structure; pointerless representation; computerised pattern recognition; computerised picture processing; data structures; trees (mathematics)
H. Samet and M. Tamminen, "Efficient Component Labeling of Images of Arbitrary Dimension Represented by Linear Bintrees," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 10, no. , pp. 579-586, 1988.