This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Quadtrees for Image Segments
January 1983 (vol. 5 no. 1)
pp. 77-83
William I. Grosky, Intelligent Systems Laboratory, Department of Computer Science, Wayne State University, Detroit, MI 48202.
Ramesh Jain, Intelligent Systems Laboratory, Department of Computer Science, Wayne State University, Detroit, MI 48202; Department of Electrical and Computer Engineering, University of Michigan
Quadtrees are compact hierarchical representations of images. In this paper, we define the efficiency of quadtrees in representing image segments and derive the relationship between the size of the enclosing rectangle of an image segment and its optimal quadtree. We show that if an image segment has an enclosing rectangle having sides of lengths x and y, such that 2N-1 × max (x, y) ¿ 2N, then the optimal quadtree may be the one representing an image of size 2N × 2N or 2N+1 × 2N+1. It is shown that in some situations the quadtree corresponding to the larger image has fewer nodes. Also, some necessary conditions are derived to identify segments for which the larger image size results in a quadtree which is no more expensive than the quadtree for the smaller image size.
Citation:
William I. Grosky, Ramesh Jain, "Optimal Quadtrees for Image Segments," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 5, no. 1, pp. 77-83, Jan. 1983, doi:10.1109/TPAMI.1983.4767348
Usage of this product signifies your acceptance of the Terms of Use.