The coding of a reduced amount of picture information for a high speed transmission is discussed. The authors present a recursive algorithm ZETA, which scans the elements of a 2-D picture P(N,N) implementing the basis of a hierarchical pyramid. A simple average procedure is also provided, which accepts as input the N/sup 2/ pixels produced by the ZETA algorithm and constructs the exponential pyramid data structure of (4N/sup 2/-1)/3 elements for the picture P. This pyramidal scheme is used to produce the minimal picture tree by applying the regular decomposition methodology. A hierarchical orthogonal transformation is applied on the minimal picture tree realizing the reduced picture coding.>

The database structure and data manipulation capabilities of a generalized PICture Database Management System (PICDMS) are presented. They are based on a dynamic, stacked-image, logical database structure that uses gridded, rather than topological, data representation. A prototype PICDMS has been designed and implemented. A commercial version is being used as a generator of image processing programs. The system has novel capabilities for nonprogrammer users: it is able to 1) build multiple-variable databases from photographs and other two-dimensional data sources such as maps, drawings, etc., and 2) manipulate such data using simple logical commands. Physical organization and accessing strategies are outlined. A summary of the PICDMS data manipulation capabilities is presented and a subset of operations is illustrated with brief examples. A comprehensive example displays PICDMS capabilities and the programming advantages it possesses over other approaches.

This paper concerns methods for indexing areas in twodimensional array data. A method for naming subpictures from rasterscan image data is presented with notation that eases their subsequent storage access. Equations are given for converting each subpicture name into a storage-location pointer. A function ``NUMERIC'' is described that aids this task. Algorithms enabling efficient retrieval of subpicture areas from sequential and direct access files are presented. Examples are given that show that improved retrieval response is possible from using NUMERIC to sort lists of areas to be recalled. The paper includes an overview of tree data structures, the subject implemented by these techniques. An overlapping picture subareas storage scheme is discussed.

This paper deals with obtaining a data base for test and evaluation of large software systems, when at most, only a few typical pattern instances are available. Data structure variation is proposed and demonstrated for some simple images. Relationships to fundamental concepts in computer science methodology are discussed.

A technique for obtaining the digital Walsh-Hadamard transform of two-dimensional discrete pictures in real time is presented. A considerable reduction in total time for the transformation of a picture results since the process of scanning and digitizing one picture line overlaps with computations on the previous line. This is accomplished by operating on each picture line as it is generated from the scanner, instead of starting the transformation operation after the entire picture has been scanned. Two theorems are presented which decompose a picture by row or by column to facilitate real-time transformation. Based on these theorems, a hardware machine for real-time parallel Walsh-Hadamard transformation is introduced.

Experimental pattern recognition techniques for processing chromosome slides with a computer are described. The purpose of the computer program is twofold: to illuminate the basic mechanisms by which a human recognizes an object, such as a chromosome, and distinguishes it from other entities; and the employment of these mechanisms is an automatic and precise extraction of chromosome features.