Paper
6 October 1997 Fixed attribute-length linear quadtree representations for storing similar images
Tsong-Wuu Lin
Author Affiliations +
Proceedings Volume 3229, Multimedia Storage and Archiving Systems II; (1997) https://doi.org/10.1117/12.290348
Event: Voice, Video, and Data Communications, 1997, Dallas, TX, United States
Abstract
The pictures to be processed are consecutive images in many applications such as computer graphics, image processing, and geographic information systems. These consecutive images form a gradually changing data set. A large amount of memory space is required for storing these images if the similarity relation among them is ignored. Based on the linear quadtree structures and overlapping concepts, a fixed attribute-length quadtree representation is proposed for storing a sequence of similar binary images. Unfortunately, it is inefficient when the overlapping percentages of images are high. We modify its representation to eliminate the drawback. The modified structures work well and their space reductions are greater than the overlapping percentage of these consecutive images. Experiments will be made to compare our representation with other overlapping structures. From the experiments, our representation is shown to be better than other representations.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Tsong-Wuu Lin "Fixed attribute-length linear quadtree representations for storing similar images", Proc. SPIE 3229, Multimedia Storage and Archiving Systems II, (6 October 1997); https://doi.org/10.1117/12.290348
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image processing

Geographic information systems

Computer graphics

Data storage

Computer programming

Binary data

Cartography

Back to Top