Skip to main content

Abstract

Data and an algorithm are the two basic parts of any program, and they axe related to each other — data organization often considerably affect the simplicity of the selection and the implementation of an algorithm. The choice of data structures is therefore a fundamental question when writing a program [Wirth 76]. Information about the representation of image data, and the data which can be deduced from them, will here be introduced before explaining different image processing methods. Relations between different types of representations of image data will then be clearer.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. D H Ballard, and C M Brown: Computer Vision. Prentice-Hall, Englewood Cliffs, NJ, 1982.

    Google Scholar 

  2. P Y Burt, T H Hong, and A Rosenfeld: Segmentation and estimation of image region properties through cooperative hierarchical computation. IEEE Transactions on Systems, Man and Cybernetics, 11 (12): 802–809, 1981.

    Article  Google Scholar 

  3. D Corner: The ubiquitous B—tree. Computing Surveys, 11 (2): 121–137, 1979.

    Article  Google Scholar 

  4. S Even: Graph Algorithms. Computer Science Press, Rockville, Md, 1979.

    Google Scholar 

  5. H Freeman: On the enconding of arbitrary geometric configuration. IRE Transactions on Electronic Computers, EC-10 (2): 260–268, 1961.

    Google Scholar 

  6. T L Kunii, S Weyl, and I M Tenenbaum: A relation database schema for describing complex scenes with color and texture. In Proceedings of the 2nd International Joint Conference on Pattern Recognition, pages 310–316, Copenhagen, Denmark, 1974.

    Google Scholar 

  7. S Y Lu, and K S Fu: A syntactic approach to texture analysis. Computer Graphics and Image Processing, 7: 303–330, 1978.

    Article  Google Scholar 

  8. N J Nilsson: Principles of Artificial Intelligence. Springer Verlag, Berlin, 1982.

    Book  MATH  Google Scholar 

  9. Pavlidis 77] T Pavlidis:Structural Pattern Recognition. Springer Verlag, Berlin, 1977.

    Google Scholar 

  10. T Pavlidis: Algorithms for Graphics and Image Processing. Computer Science Press, New York, 1982.

    Google Scholar 

  11. A C Shaw: A formal picture description schema as a basis for picture processing systems. Information and Control, 14: 9–52, 1969.

    Article  MATH  Google Scholar 

  12. N Wirth: Algorithms + Data Structures = Programs. Prentice-Hall, Englewood Cliffs, NJ, 1976.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Milan Sonka, Vaclav Hlavac and Roger Boyle

About this chapter

Cite this chapter

Sonka, M., Hlavac, V., Boyle, R. (1993). Data structures for image analysis. In: Image Processing, Analysis and Machine Vision. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-3216-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-3216-7_3

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-412-45570-4

  • Online ISBN: 978-1-4899-3216-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics