Operations on Images Using Quad Trees

@article{Hunter1979OperationsOI,
  title={Operations on Images Using Quad Trees},
  author={Gregory M. Hunter and Kenneth Steiglitz},
  journal={IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year={1979},
  volume={PAMI-1},
  pages={145-153}
}
  • G. M. Hunter, K. Steiglitz
  • Published 1979
  • Computer Science, Medicine
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
A quad tree for representing a picture is a tree in which successively deeper levels represent successively finer subdivisions of picture area. An algorithm is given for superposing N quad trees in time proportional to the total number of nodes in the trees. Warnock-type algorithms are then presented for building the quad tree for the picture of the boundary of a polygon, and for coloring the interior of such a polygon. These algorithms take O(v + p + q) time, where v is the number of polygon… Expand
Linear transformation of pictures represented by quad trees
Abstract An algorithm is described for transforming a quad tree encoding for a picture into a quad tree for the same picture after application of a general linear operator. The technique relies onExpand
Parallel Processing of Linear Quadtrees on a Mesh-Connected Computer
TLDR
This paper uses a scheme which represents a quadtree by its leaf nodes; each node is represented by the coordinates of the upper left corner of its corresponding block and its color and size. Expand
Region representation: Quadtrees from binary arrays
TLDR
An algorithm is presented for constructing a quadtree from the array representation of a binary image that examines each pixel in the image once and only once, and never requires temporary nodes. Expand
Calculations of geometric properties using quadtrees
Abstract This paper describes algorithms for computing geometric properties of binary images represented as quadtrees. All the algorithms involve a simple traversal of the tree. Each algorithm,Expand
Quad-Trees, Oct-Trees, and K-Trees: A Generalized Approach to Recursive Decomposition of Euclidean Space
TLDR
The algorithm provides a method for computing the perimeter of a quad-tree encoded image or the surface area of an oct- tree encoded object in worst case time proportional to the number of nodes in the tree, improves upon the expected-case linear-time method of Samet for the perimeter problem. Expand
Computing Geometric Properties of Images Represented by Linear Quadtrees
  • H. Samet, Markku Tamminen
  • Computer Science, Medicine
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 1985
TLDR
A general algorithm to compute geometric image properties such as the perimeter, the Euler number, and the connected components of an image is developed and analyzed and implementation experience has confirmed its superiority to existing approaches to computing geometric properties for images represented by quadtrees. Expand
Detection of connectivity for regions represented by linear quadtrees
An algorithm is given for the determination of all connected components of a given region. The data structure used to represent the region (or image) is the linear quadtree, a recently introducedExpand
Neighbor finding techniques for images represented by quadtrees
  • H. Samet
  • Computer Science
  • Comput. Graph. Image Process.
  • 1982
TLDR
Algorithms are given for determining adjacencies in the horizontal, vertical, and diagonal directions and the execution times of the algorithms are analyzed using a suitably defined model. Expand
Algorithms for the conversion of quadtrees to rasters
  • H. Samet
  • Computer Science
  • Comput. Vis. Graph. Image Process.
  • 1984
TLDR
A number of algorithms for obtaining a raster representation for an image given its quadtree are presented, starting with the straightforward top-down approach that visits each run in a row in succession starting at the root of the tree. Expand
Object representation by means of nonminimal division quadtrees and octrees
TLDR
By using a new class of quadtrees, in which nodes may contain zero or one edge, storage requirements are reduced and it is possible to obtain the exact backward conversion to boundary representation. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 16 REFERENCES
Experiments on Picture Representation Using Regular Decomposition
TLDR
A regular decomposition of picture area into successively smaller quadrants is defined, which involves logarithmic search, and the resulting picture representation is shown to enable rapid access of image data without regard to position, efficient storage, and approximate structural descriptions of constituent patterns. Expand
The Use of Algorithms of Piecewise Approximations for Picture Processing Applications
TLDR
A fast scheme using a sphtand-merge procedure is described for functions of both one and two variables for piecewise constant and piecewise linear approximations without continuity constraints. Expand
Picture Segmentation by a Tree Traversal Algorithm
TLDR
This paper combines the two approaches with significant increase in processing speed while maintaining small memory requirements and the data structure is described in detail. Expand
Raster scan approaches to computer graphics
TLDR
It is concluded that future implementations of raster scan technologies ought to be primarily mass memories, rarely scan conversion techniques, and never run-length lists. Expand
Pictorial feature distortion in a pyramid
Recently, Pyramid data structures employing several levels of resolution have become popular as tools for facilitating the analysis of pictures. These pyramids are usually generated by takingExpand
Computer animation survey
TLDR
It is seen, for each technique, that there are advantages to using electronic rather than mechanical hardware, and desirable characteristics for an electronic base for animation are identified. Expand
Principles in interactive computer graphics
TLDR
The principles of interactive computer graphics are applied to computer graphics practice and show the importance of user interaction in the development of computer graphics algorithms. Expand
A pyramid model for binary picture complexity
  • Proc. IEEE Comput. Soc. Conf Pattern Recognition and Image Processing, Rensselaer Polytechnic Institute, NY, June 6-8, 1977, pp. 25-28.
  • 1977
...
1
2
...