Data structures for picture processing: A survey

14Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Shapiro, L. G. (1979). Data structures for picture processing: A survey. Computer Graphics and Image Processing, 11(2), 162–184. https://doi.org/10.1016/0146-664X(79)90065-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free