Advertisement

Quadtrees and Pyramids: Hierarchical Representation of Images

  • A. Rosenfeld
Part of the NATO ASI Series book series (volume 4)

Abstract

This paper reviews methods of variable-resolution representation or approximation of digital images based on the use of trees of degree 4 (“quadtrees”). It also discusses the multi-resolution representation of an image by an exponentially tapering “pyramid” of arrays, each half the size of the preceding. Basic properties of these representations, and their uses in image segmentation and property measurement, are summarized.

Keywords

Image Segmentation Gray Level Computer Vision System Homogeneous Block Average Gray Level 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    T. Pavlidis, Structural Pattern Recognition, Springer, New York, 1977.MATHGoogle Scholar
  2. 2.
    A. Klinger, Data structures and pattern recognition, Proc. 1st Intl. Joint Conf. on Pattern Recognition, 1973, 497–498.Google Scholar
  3. 3.
    A Klinger and C. R. Dyer, Experiments in picture representation using regular decomposition, Computer Graphics Image Processing 5, 1976, 68–105.CrossRefGoogle Scholar
  4. 4.
    C. R. Dyer, Space efficiency of region representation by quadtrees, Tech. Rept. KSL 46, University of Illinois, Chicago, IL, 1980.Google Scholar
  5. 5.
    L. Jones and S. S. Iyengar, Representation of a region as a forest of quad trees, Proc. IEEE Conf. Pattern Recognition Image Processing, 1981, 57–59.Google Scholar
  6. 6.
    M. Li, W. I. Grosky, and R. Jain, Normalized quadtrees with respect to translations, Proc. IEEE Conf. Pattern Recognition Image Processing, 1981, 60–62.Google Scholar
  7. 7.
    H. Samet, Region representation: quadtrees from binary arrays, Computer Graphics Image Processing 13, 1980, 88–93.CrossRefGoogle Scholar
  8. 8.
    J. Burt, Hierarchically derived piecewise polynomial approximations to waveforms and images, Tech. Rept. 838, University of Maryland, College Park, MD, 1979.Google Scholar
  9. 9.
    H. Samet, An algorithm for converting rasters to quadtrees, IEEE Trans. Pattern Analysis Machine Intelligence 3, 1981, 93–95.CrossRefGoogle Scholar
  10. 10.
    H. Samet, Algorithms for the conversion of quadtrees to rasters, Tech. Rept. 979, University of Maryland, College Park, MD, 1980.Google Scholar
  11. 11.
    H. Samet, Region representation: quadtrees from boundary codes, Comm. ACM 23, 1980, 163–170.CrossRefMATHGoogle Scholar
  12. 12.
    C. R. Dyer, A. Rosenfeld, and E. Samet, Region representation: boundary codes from quadtrees, Comm. ACM 23, 1980, 171–179.CrossRefMATHGoogle Scholar
  13. 13.
    H. Samet, A distance transform for images represented by quadtrees, IEEE Trans. Pattern Analysis Machine Intelligence 4, 1982, 298–303.CrossRefGoogle Scholar
  14. 14.
    M. Shneier, Path-length distances for quadtrees, Information Sci ences 23, 1981, 49–67.CrossRefMATHMathSciNetGoogle Scholar
  15. 15.
    K. Samet, A quadtree medial axis transformation, Comm. ACM, to appear.Google Scholar
  16. 16.
    M. Shneier, Calculations of geometric properties using quadtrees, Computer Graphics Image Processing 16, 1981, 296–302.CrossRefGoogle Scholar
  17. 17.
    H. Samet, Computing perimeters of images represented by quadtrees, IEEE Trans. Pattern Analysis Machine Intelligence 3, 1981, 683–687.CrossRefGoogle Scholar
  18. 18.
    K. Samet, Connected component labelling using quadtrees, J. ACM 28, 1981, 487–501.CrossRefMATHMathSciNetGoogle Scholar
  19. 19.
    C. R. Dyer, Computing the Euler number of an image from its quadtree, Computer Graphics Image Processing 13, 1980, 270–276.CrossRefGoogle Scholar
  20. 20.
    N. Alexandridis and A. Klinger, Picture decomposition, tree datastructures, and identifying directional symmetries as node combinations, Computer Graphics Image Processing 8, 1978, 43–77.CrossRefGoogle Scholar
  21. 21.
    H. Samet, Neighbor finding techniques for images represented by quadtrees, Computer Graphics Image Processing 18, 1982, 37–57.CrossRefMATHGoogle Scholar
  22. 22.
    G. M. Hunter and K. Steiglitz, Operations on images using quad trees, IEEE Trans. Pattern Analysis Machine Intelligence 1, 1979, 145–153.CrossRefGoogle Scholar
  23. 23.
    G. M. Hunter and K. Steiglitz, Linear transformation of pictures represented by quad trees, Computer Graphics Image Processing 10, 1979, 289–296.CrossRefGoogle Scholar
  24. 24.
    N. Ahuja, Approaches to recursive image decomposition, Proc. IEEE Conf. Pattern Recognition Image Processing, 1981, 75–80.Google Scholar
  25. 25.
    P. J. Burt, Tree and pyramid structures for coding hexagonally sampled binary images, Computer Graphics Image Processing 14, 1980, 271–280.CrossRefGoogle Scholar
  26. 26.
    D. R. Reddy and S. M. Rubin, Representation of three-dimensional objects, Tech. Rept. CS-78-113, Carnegie-Mellon University, Pittsburgh, PA, 1978.Google Scholar
  27. 27.
    C. L. Jackins and S. L. Tanimoto, Oct-trees and their use in representing three-dimensional objects, Computer Graphics Image Pro cessing 14, 1980, 249–270.CrossRefGoogle Scholar
  28. 28.
    D. J. R. Meagher, Octree encoding, a new technique for the representation, manipulation, and display of arbitrary 3-d objects by computer, Tech. Rept. 80-111, Rensselaer Polytechnic Institute, Troy, NY, 1980.Google Scholar
  29. 29.
    L. J. Doctor and J. G. Torborg, Display techniques for octreeencoded objects, Computer Graphics Applications 1(3), 1981, 29–33.CrossRefGoogle Scholar
  30. 30.
    M. M. Yau and S. N. Srihari, Recursive generation of hierarchical data structures for multidimensional digital images, Proc. IEEE Conf. Pattern Recognition Image Processing, 1981, 42–44.Google Scholar
  31. 31.
    K. R. Sloan Jr., Dynamically quantized pyramids, Proc. 7th Intl. Conf. Artificial Intelligence, 1981, 714–736.Google Scholar
  32. 32.
    J. O.Rourke, Dynamically quantized spaces for focusing the Hough transform, Proc. 7th Intl. Joint Conf. Artificial Intelligence, 1981, 737–739.Google Scholar
  33. 33.
    P. J. Burt, Fast hierarchical correlations with Gaussian-like kernels, Proc. 5th Intl. Conf. Pattern Recognition, 1980, 828–830.Google Scholar
  34. 34.
    E. H. Adelson and P. J. Burt, Image data compression with the Laplacian pyramid, Proc. IEEE Conf. Pattern Recognition Image Processing, 1981, 218–223.Google Scholar
  35. 35.
    L. Uhr, Layered “recognition cone” networks that preprocess, classify, and describe, IEEE Trans. Computers 21, 1972, 758–768.CrossRefMATHGoogle Scholar
  36. 36.
    M. D. Kelly, Edge detection in pictures by computer using planning, Machine Intelligence 6, 1971, 397–409.Google Scholar
  37. 37.
    S. Tanimoto and T. Pavlidis, A hierarchical data structure for picture processing, Computer Graphics Image Processing 4, 1975, 104–119.CrossRefGoogle Scholar
  38. 38.
    S. Tanimoto, Pictorial feature distortion in a pyramid, Computer Graphics Image Processing 5, 1976, 333–352.CrossRefGoogle Scholar
  39. 39.
    A. R. Hanson and E. M. Riseman, Segmentation of natural scenes, in A. R. Hanson and E. M. Riseman, eds., Computer Vision Systems, Academic Press, NY, 1978, 129–163.Google Scholar
  40. 40.
    S. L. Tanimoto, Regular hierarchical image and processing structures. in machine vision, in A. R. Hanson and E. M. Riseman, eds., Computer Vision Systems, Academic Press, NY, 1978, 165–174.Google Scholar
  41. 41.
    M. D. Levine, A knowledge-based computer vision system, in A. R. Hanson and E. M. Riseman, eds., Computer Vision Systems, Academic Press, NY, 1978, 335–352.Google Scholar
  42. 42.
    S. Tanimoto and A. Klinger, eds., Structured Computer Vision, Academic Press, New York, 1980. See especially the papers by L. Uhr, Psychological motivation and underlying concepts, 1-30; S. L. Tanimoto, Image data structures, 31-55; M. D. Levine, Region analysis using a pyramid data structure, 57-1*00; A. R. Hanson and E. M. Riseman, Processing cones: a computational structure for image analysis, 102-131; R. Bajcsy and D. A. Rosenthal, Visual and conceptual focus of attention, 133-149.Google Scholar
  43. 43.
    A. Rosenfeld and M. Thurston, Edge and curve detection for visual scene analysis, IEEE Trans. Computers 20, 1971, 562–569.CrossRefGoogle Scholar
  44. 44.
    D. Marr and E. Hildreth, Theory of edge detection, Proc. Royal Soc. B207, 1930, 137–217.Google Scholar
  45. 45.
    M. Shneier, Using pyramids to define local thresholds for blob detection, TR-303, University of Maryland, College Park, MD, 1979.Google Scholar
  46. 46.
    M. Shneier, Extracting linear features from images using pyramids, TR-855, University of Maryland, College Park, MD, 1980.Google Scholar
  47. 47.
    S. Kasif and A. Rosenfeld, Pyramid linking is a special case of ISODATA, TR-1096, University of Maryland, College Park, MD, 1981.Google Scholar
  48. 48.
    P. Burt, T. K. Kong, and A. Rosenfeld, Segmentation and estimation of image region properties through cooperative hierarchical computation, IEEE Trans. Systems, Man, Cybernetics 11, 1931, 802–809.CrossRefGoogle Scholar
  49. 49.
    T. H. Kong, K. A. Narayanan, S. Peleg, A. Rosenfeld, and T. Silberberg,, Image smoothing and segmentation by multiresolution pixel linking: further experiments and extensions, IEEE Trans. Systems, Man, Cybernetics 12, 1982, in press.Google Scholar
  50. 50.
    K. J. Antonisse, Image segmentation in pyramids, Computer Graphics Image Processing 19, 1982, in press.Google Scholar
  51. 51.
    T. H. Eong and A. Rosenfeld, Unforced image partitioning by weighted pyramid linking, TR-1137, University of Maryland, College Park, MD, 1982.Google Scholar
  52. 52.
    M. Pietikainen, A. Rosenfeld, and I. Walter, Split-and-link algorithms for image segmentation, Pattern Recognition 15, 1982, in press.Google Scholar
  53. 53.
    M. Shneier, Two hierarchical linear feature representations: edge pyramids and edge quadtrees, Computer Graphics Image Processing17, 1981, 211–224.CrossRefGoogle Scholar
  54. 54.
    T. H. Hong, M. Shneier, and A. Rosenfeld, Border extraction using linked edge pyramids, IEEE Trans. Systems, Man, Cybernetics 12, 1982, in press.Google Scholar
  55. 55.
    T. K. Hong and M. Shneier, Extracting compact objects using linked pyramids, TR-1123, University of Maryland, College Park, MD, 1931.Google Scholar
  56. 56.
    T. H. Hong and M. Shneier, in preparations.Google Scholar
  57. 57.
    D. Ballard, Strip trees: a hierarchical representation for curves, Comm. ACM 24, 1981, 310–321.CrossRefGoogle Scholar
  58. 58.
    K. A. Narayanan, D. P. O.Leary, and A. Rosenfeld, Multiresolution relaxation, Pattern Recognition 15, 1982, in press.Google Scholar
  59. 59.
    P. C. Chen and T. Pavlidis, Segmentation by texture using a cooccurrence matrix and a split-and-merge algorithm, Computer Gra phics Image Processing 10, 1979, 172–182.CrossRefGoogle Scholar
  60. 60.
    M. Pietikainen and A. Rosenfeld, Image segmentation by texture using pyramid node linking, IEEE Trans. Systems, Man, Cybernetics11, 1981, 822–825.CrossRefGoogle Scholar
  61. 61.
    M. Pietikainen and A. Rosenfeld, Gray level pyramid linking as an aid in texture analysis, IEEE Trans. Systems, Man, Cybernetics 12, 1982, in press.Google Scholar
  62. 62.
    D. D. Garber, Computational models for texture analysis and texture synthesis, IPI-TR 1000, University of Southern California, Los Angeles, CA, 1981.Google Scholar
  63. 63.
    K. A. Narayanan and A. Rosenfeld, Approximation of waveforms and contours by one-dimensional pyramid linking, Pattern Recognition 15, 1982, in press.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • A. Rosenfeld
    • 1
  1. 1.Computer Vision Laboratory, Computer Science CenterUniversity of MarylandCollege ParkUSA

Personalised recommendations