Data structures for picture processing

A variety of algorithms have been invented for use in picture processing. An important aspect of the algorithms are the data structures 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.

[1]  Robert M. Haralick,et al.  Decomposition of Two-Dimensional Shapes by Graph-Theoretic Clustering , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Theodosios Pavlidis,et al.  The editing of picture segmentations using local analysis of graphs , 1977, CACM.

[3]  Timothy E. Johnson.  Sketchpad III: a computer program for drawing in three dimensions , 1963, AFIPS '63 (Spring).

[4]  Kenneth Steiglitz,et al.  The Automatic Counting of Asbestos Fibers in Air Samples , 1978, IEEE Transactions on Computers.

[5]  Robert F. Sproull,et al.  Principles in interactive computer graphics , 1973 .

[6]  King-Sun Fu,et al.  Data Structures, Computer Graphics, and Pattern Recognition , 1977 .

[7]  Theodosios Pavlidis,et al.  Segmentation of pictures and maps through functional approximation , 1972, Comput. Graph. Image Process..

[8]  Herbert Freeman.  Analysis of Line Drawings , 1977 .

[9]  Charles R. Dyer,et al.  Experiments on Picture Representation Using Regular Decomposition , 1976 .

[10]  Herbert Freeman,et al.  Computer Processing of Line-Drawing Images , 1974, CSUR.

[11]  Theodosios Pavlidis,et al.  A Minimum Storage Boundary Tracing Algorithm and Its Application to Automatic Inspection , 1978 .

[12]  Michael A. Arbib,et al.  Computational Techniques in Visual Systems. Part I. The Overall Design. , 1976 .

[13]  Nils J. Nilsson,et al.  APPLICATION OF INTELLIGENT AUTOMATA TO RECONNAISSANCE. , 1967 .

[14]  Theodosios Pavlidis,et al.  Picture Segmentation by a Tree Traversal Algorithm , 1976, JACM.

[15]  T. L. Saaty,et al.  Finite graphs and networks : an introduction with applications , 1967 .

[16]  J. C. Gray,et al.  Compound data structure for computer aided design; a survey , 1967, ACM National Conference.

[17]  Allen Klinger,et al.  Data Structures and Pattern Recognition , 1978 .

[18]  John Edward Warnock,et al.  A hidden surface algorithm for computer generated halftone pictures , 1969 .

[19]  Charles T. Zahn,et al.  DATA STRUCTURES FOR PATTERN RECOGNITION AIXORITRMS: A Case Study , 1975 .

[20]  Larry S. Davis,et al.  A Corner-Finding Algorithm for Chain-Coded Curves , 1977, IEEE Transactions on Computers.

[21]  Theodosios Pavlidis,et al.  A hierarchical data structure for picture processing , 1975 .

[22]  Robin Williams,et al.  A Survey of Data Structures for Computer Graphics Systems , 1971, CSUR.

[23]  Linda G. Shapiro,et al.  ESP3: A Language for Pattern Description and a System for Pattern Recognition , 1977, IEEE Transactions on Software Engineering.

[24]  Martin A. Fischler,et al.  The Representation and Matching of Pictorial Structures , 1973, IEEE Transactions on Computers.

[25]  Larry S. Davis,et al.  Understanding Shape: Angles and Sides , 1977, IEEE Transactions on Computers.

[26]  H. Feng,et al.  The generation of polygonal outlines of objects from gray level pictures , 1975 .

[27]  Linda G. Shapiro,et al.  ESP3: a high-level graphics language , 1975, SIGGRAPH '75.

[28]  Larry S. Davis,et al.  Shape Matching Using Relaxation Techniques , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.