27 March 1989 Space And Time Requirements For Two Image Data Structures
Author Affiliations +
Proceedings Volume 1002, Intelligent Robots and Computer Vision VII; (1989) https://doi.org/10.1117/12.960313
Event: 1988 Cambridge Symposium on Advances in Intelligent Robotics Systems, 1988, Boston, MA, United States
Abstract
We present research on tree structures using hexagonally and quarternarily organized imagery. The purpose is to determine and compare benefits from applying these pyramidal representations. Our motive is to develop new approaches to image computing. We compare space and time requirements of two hierarchical data structures. The basic image representation is by the septree and the quadtree data pyramids. A septree is a seven-descendant tree; values stored are found by decomposing a roughly-hexagonal planar region into its central hexagon and its six uniformly-adjacent neighbors. A quadtree is a four-descendant tree; its values are similarly obtained using the more common rectangular decomposition of a planar image. Today's technology (i.e., CCD arrays; VLSI chips) enables both the hexagonal and quartering tesselations to co-exist; likewise, lower-cost hardware trends encourage innovative computer systems for image analysis. Both image data structures presented here for static two-dimensional scenes can be extended to three-dimensional analogies. These can be used in computer vision models and in time-sequences of images for robots.
© (1989) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
G. A. Baraghimian, G. A. Baraghimian, A. Klinger, A. Klinger, } "Space And Time Requirements For Two Image Data Structures", Proc. SPIE 1002, Intelligent Robots and Computer Vision VII, (27 March 1989); doi: 10.1117/12.960313; https://doi.org/10.1117/12.960313
PROCEEDINGS
10 PAGES


SHARE
Back to Top