• Publication
  • 1985
  • Issue No. 6 - June
  • Abstract - Applications of Quadtree, Octree, and Binary Tree Decomposition Techniques to Shape Analysis and Pattern Recognition
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Applications of Quadtree, Octree, and Binary Tree Decomposition Techniques to Shape Analysis and Pattern Recognition
June 1985 (vol. 7 no. 6)
pp. 652-661
B. B. Chaudhuri, Electronics and Communication Sciences Unit, Indian Statistical Institute, Calcutta 700 035, India.
The binary tree, quadtree, and octree decomposition techniques are widely used in computer graphics and image processing problems. Here, the techniques are reexamined for pattern recognition and shape analysis applications. It has been shown that the quadtree and octree techniques can be used to find the shape hull of a set of points in space while their n-dimensional generalization can be used for divisive hierarchical clustering. Similarly, an n-dimensional binary tree decomposition of feature space can be used for efficient pattern classifier design. Illustrative examples are presented to show the usefulness and efficiency of these hierarchical decomposition techniques.
Citation:
B. B. Chaudhuri, "Applications of Quadtree, Octree, and Binary Tree Decomposition Techniques to Shape Analysis and Pattern Recognition," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 7, no. 6, pp. 652-661, June 1985, doi:10.1109/TPAMI.1985.4767721
Usage of this product signifies your acceptance of the Terms of Use.