Share Email Print

Proceedings Paper

Fixed attribute-length linear quadtree representations for storing similar images
Author(s): Tsong-Wuu Lin
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 6 October 1997
PDF: 10 pages
Proc. SPIE 3229, Multimedia Storage and Archiving Systems II, (6 October 1997); doi: 10.1117/12.290348
Show Author Affiliations
Tsong-Wuu Lin, Soochow Univ. (Taiwan)

Published in SPIE Proceedings Vol. 3229:
Multimedia Storage and Archiving Systems II
C.-C. Jay Kuo; Shih-Fu Chang; Venkat N. Gudivada, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?