Share Email Print
cover

Proceedings Paper

Two-dimensional S-tree: an index structure for content-based retrieval of images
Author(s): Youping Niu; M. Tamer Ozsu; Xiaobo Li
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

An important feature to be considered in the design of multimedia DBMSs is content-based retrieval of images. Most work in this area has focused on feature-based retrieval; we focus on retrieval based on spatial relationship, which include directional and topological relationships. The most common data structure that is used for representing directional relations is the 2D string. The search process, however, is sequential and the technique does not scale up for large databases. We propose a new indexing structure, the 2-D-S-tree, to organize 2-D strings for query efficiency. The 2-D-S-tree is completely dynamic; inserts and deletes can be intermixed with searches and no periodic reorganization is required. A performance analysis is conducted, and both analytical analysis and experimental results indicate that the 2-D-S-tree is an efficient index structure for content-based retrieval of images.

Paper Details

Date Published: 14 December 1998
PDF: 12 pages
Proc. SPIE 3654, Multimedia Computing and Networking 1999, (14 December 1998); doi: 10.1117/12.333803
Show Author Affiliations
Youping Niu, Univ. of Alberta (Canada)
M. Tamer Ozsu, Univ. of Alberta (Canada)
Xiaobo Li, Univ. of Alberta (Canada)


Published in SPIE Proceedings Vol. 3654:
Multimedia Computing and Networking 1999
Dilip D. Kandlur; Kevin Jeffay; Timothy Roscoe, Editor(s)

© SPIE. Terms of Use
Back to Top