Organization and Access of Image Data by Areas

Authors:
Allen Klinger;Michael L. Rhodes
Affiliations:
MEMBER, IEEE, Computer Science Department, University of California at Los Angeles, Los Angeles, CA 90024.;MEMBER, IEEE, Computer Science Department, University of California at Los Angeles, Los Angeles, CA 90024.
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1979

Citing 0
Cited 2

Generalized scale: Theory, algorithms, and application to image inhomogeneity correction

Computer Vision and Image Understanding
A parallel implementation of the SCAN language

Computer Languages

Quantified Score

Hi-index	0.14

Visualization

Abstract

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.