ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Threaded Linear Hierarchical Quadtrees for Computation of Geometric Properties of Binary Images

Unnikrishnan, A and Shankar, Priti and Venkatesh, YV (1988) Threaded Linear Hierarchical Quadtrees for Computation of Geometric Properties of Binary Images. In: IEEE Transactions on Software Engineering, 14 (5). pp. 659-665.


Download (730kB)


A modification of the linear quadtree [3], the threaded linear hierarchical quadtree (TLHQT), is proposed for the computation of geometric properties of binary images. Since most of the algorithms used in connection with computation of geometric properties require frequent exploration of adjacencies, a structure which keeps permanently in memory some adjacency links is introduced. In this paper, we present some results obtained by using the TLHQT for labeling connected components, evaluating perimeter and Euler's number in a quadtree environment. The algorithms for computing perimeter and Euler number and the first phase of the labeling algorithm are shown to have time complexity O(B), where B is the number of black nodes of the quadtree. The authors determine the adjacency links at the very beginning-namely, when the binary image is mapped from raster scan to the quadtree. Pixel adjacency is, in fact, available during row scanning, and node's adjacency is easy to evaluate locally when performing condensation of nodes into larger quadrants and also while merging partial quadtrees. Although the structure requires space nearly four times as much as the linear quadtfee, the requirement is roughly half that for the pointer-based quadtree. Also it appears that for computing geometric properties, the TLHQT offers execution timings better than those obtained by both the linear and pointer-based quadtrees and the graph structure reported in [16].

Item Type: Journal Article
Publication: IEEE Transactions on Software Engineering
Publisher: IEEE
Additional Information: ©1988 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Keywords: binary images;geometric properties;hierarchical quadtree;linear quadtree;quadtree
Department/Centre: Division of Electrical Sciences > Electrical Engineering
Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 04 Oct 2005
Last Modified: 19 Sep 2010 04:20
URI: http://eprints.iisc.ac.in/id/eprint/3759

Actions (login required)

View Item View Item