Data structures for picture processing: A survey

  • Shapiro L
  • 1

    Readers

    Mendeley users who have this article in their library.
  • 13

    Citations

    Citations of this article.

Abstract

A variety of algorithms have been invented for use in picture processing. An important aspect of the algorithms is the data structure(s) employed. A data structure may be chosen to represent a particular structural relationship, to save space, or to allow for fast access to data. This paper surveys four major classes of data structures used in current picture processing research and gives several examples of the use of each type of structure in particular algorithms or systems. The structures surveyed are linear lists hierarchic structures, graph structures, and recursive structures. © 1979 Academic Press, Inc.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Linda G. Shapiro

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free