Spatial data handling systems generally use either topological or grid image data structures. It makes little sense for these systems to be incompatible.

Manipulating Data Structures in Pictorial Information Systems

An investigation is presented of video data compression applied to microgravity space experiments using High Resolution High Frame Rate Video Technology (HHVT). An extensive survey of methods of video data compression, described in the open literature, was conducted. The survey examines compression methods employing digital computing. The results of the survey are presented. They include a description of each method and assessment of image degradation and video data parameters. An assessment is made of present and near term future technology for implementation of video data compression in high speed imaging system. Results of the assessment are discussed and summarized. The results of a study of a baseline HHVT video system, and approaches for implementation of video data compression, are presented. Case studies of three microgravity experiments are presented and specific compression techniques and implementations are recommended.

/pdf/data-compression-techniques-applied-to-high-resolution-high-207ri6w5pj.pdf

Data compression techniques applied to high resolution high frame rate video technology

Picture processing: 1976

During the past decade a number of multiimage picture processing software packages have been put together. However, only a few of the references to picture processing systems discuss image data structure or input/output routines. This correspondence is a first step in a direction toward getting a communication process started by suggesting some specifications for a multiimage data format and standard input/output interface routines to access the image data.

Image Access Protocol for Image Processing Software

Image Processing Software for Industrial Visual Inspection

KANDIDATS is a comprehensive digital image processing system that interacts with the user at a command string level. It includes prompting for parameter. input .and checks user input for errors. Image analyses available In KANDIDATS consist of utility functions, image transform operations, spatial clustering, and Bayesian classi~ication. The versatility and capabilities of KANDIDATS anse from a modular programming structure and file stru'cture. These attributes allow processing of images that are a few thousand rows by a few thousand columns in a minicomputer system with only 32 K words of main memory. 1.0 IMAGE PROCESSING

/pdf/kandidats-image-processing-system-1q19d2mefw.pdf

KANDIDATS Image Processing System

In the usual transform compression encoding schemes, an image is divided into regular shaped subimages or blocks, a transform is performed on each block, low energy components thrown away, remaining components encoded and transmitted, and then the received image reconstructed. This paper discusses ways in which the image pixels can be permuted before the image is blocked and a special annihilation transform technique to perform the image coding. Experimental results show the compressed images to have no blocking effects, but a more mottled appearance compared to a discrete cosine transform coding method. The annihilation method on permuted images not only gives reconstructed images better visual quality, but also gives lower RMS error.© (1976) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.

Craig A. Paul

Papers

KANDIDATS Image Processing System

An Annihilation Transform Compression Method For Permuted Images