By Topic

Organization and Access of Image Data by Areas

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Allen Klinger ; MEMBER, IEEE, Computer Science Department, University of California at Los Angeles, Los Angeles, CA 90024. ; Michael L. Rhodes

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.

Published in:

IEEE Transactions on Pattern Analysis and Machine Intelligence  (Volume:PAMI-1 ,  Issue: 1 )