Applications of Quadtree, Octree, and Binary Tree Decomposition Techniques to Shape Analysis and Pattern Recognition
- 1 November 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. PAMI-7 (6) , 652-661
- https://doi.org/10.1109/tpami.1985.4767721
Abstract
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.Keywords
This publication has 17 references indexed in Scilit:
- A quadtree medial axis transformCommunications of the ACM, 1983
- Maximum Likelihood Methods in Vowel Recognition: A Comparative StudyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Use of Quadtrees for Edge EnhancementIEEE Transactions on Systems, Man, and Cybernetics, 1981
- Oct-trees and their use in representing three-dimensional objectsComputer Graphics and Image Processing, 1980
- Progressive transmission of grey-scale and binary pictures by simple, efficient, and lossless encoding schemesProceedings of the IEEE, 1980
- Region representationCommunications of the ACM, 1980
- On a Method of Binary-Picture Representation and Its Application to Data CompressionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- Experiments on picture representation using regular decompositionComputer Graphics and Image Processing, 1976
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974