Yoo Weon Kyung, Chung Eul Yun

The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 2, No. 6, pp. 903-917, Nov. 1995
10.3745/KIPSTE.1995.2.6.903,   PDF Download:

Abstract

In most database systems, images have been indexed indirectly using related texts such as captions, annotations and image attributes. But there has been an increasing requirement for the image database system supporting the storage and retrieval of images directly by content using the information contained in the images. There has been a few indexing methods based on contents. Among them, Petrakis proposed an image indexing method considering spatial relationships and properties of objects forming the images. This is the expansion of the other studies based on ''2-D string''. But this method needs too much storage space and lacks flexibility. In this pager, we propose a more flexible index structure based on kd-tree using paging techniques. We show an example of extracting keys using normalization from the raw image. Simulation results show that our method improves in flexibility and needs much less storage space.

Statistics
Cite this article