Skip to main content

Hierarchical Generation Of 2-D Data Structures

  • Conference paper
Book cover Mustererkennung 1984

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 87))

Abstract

We study linear 1-D signal-flow graph methods to devise hierarchical bottom-up and top-down transformations. It is shoun that hierarchical data structures (e.g. quadtrees) can be obtained directly from line-scanned data. Hierarchical generation of certain other transform coefficients (e.g. WHT coefficients) is another topic discussed in this paper.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Rosenfeld, “Quadtrees and pyramids: hierarchical representation of images”, in Haralick, R. (Ed.), Pictorial Data Analysis, Springer Verlag, Berlin, ISBN 3–540–1288–5, 1983.

    Google Scholar 

  2. S.L. Tanimoto and T. Pavlides, “A hierarchical data structure for picture processing”,Computer Graphics and Image Processing,vol.4, 1975, pp. 104–109.

    Article  Google Scholar 

  3. H. Samet and A. Rosenfeld, “Quadtree representation of binary images”, Proc. 5th Internat. Conf. Pattern Recognition, pp.815–818, 1980.

    Google Scholar 

  4. Ph.W. Besslich, “Quadtree construction by dyadic array transformation”,Proc. IEEE Conf. on Pattern Recognition and Image Processing, 1982, pp. 550–554.

    Google Scholar 

  5. Ph.W. Besslich, “Fast transform processing of pictorial data”,in R.M. Haralick (Ed.), Pictorial Data Analysis, Springer Verlag, Berlin, ISBN 3–540–1288–5, 1983.

    Google Scholar 

  6. Ph.W. Besslich, “A method for the generation and processing of dyadic indexed data”, IEEE Trans., C-32, pp. 487–494, 1983.

    MATH  Google Scholar 

  7. D.F. Elliott and K.R. Rao, Fast Transforms. New York: Academic Press, 1982.

    MATH  Google Scholar 

  8. R.M. Mersereau and T.C. Speake, “A unified treatment of CooleyTukey algorithms for the evaluation of the multi-dimensional DFT”, IEEE Trans. ASSP-29, 1981, pp. 1011–1018.

    MathSciNet  MATH  Google Scholar 

  9. Y. Tadokoro and T. Higuchi, “Discrete Fourier transform computationon via the Walsh transform”, IEEE Trans., ASSP-26, pp. 236–240, 1978.

    Article  MATH  Google Scholar 

  10. Ph.W. Besslich and J.O. Kurowski, “Globale and lokale Gewichtstransformationen zur Cluster-Analyse”, Berichte Elektrotechnik 1/83, Universität Bremen, Fachbereich 1, ISSN 0724–1933, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Besslich, P.W. (1984). Hierarchical Generation Of 2-D Data Structures. In: Kropatsch, W. (eds) Mustererkennung 1984. Informatik-Fachberichte, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-02390-7_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-02390-7_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13859-4

  • Online ISBN: 978-3-662-02390-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics