14 December 1998 Two-dimensional S-tree: an index structure for content-based retrieval of images
Author Affiliations +
Proceedings Volume 3654, Multimedia Computing and Networking 1999; (1998); doi: 10.1117/12.333803
Event: Electronic Imaging '99, 1999, San Jose, CA, United States
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.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Youping Niu, M. Tamer Ozsu, Xiaobo Li, "Two-dimensional S-tree: an index structure for content-based retrieval of images", Proc. SPIE 3654, Multimedia Computing and Networking 1999, (14 December 1998); doi: 10.1117/12.333803; https://doi.org/10.1117/12.333803


Image retrieval



Feature extraction

Image processing

Image segmentation


Peano key rediscovery for content-based retrieval of images
Proceedings of SPIE (October 06 1997)
Novel image retrieval technique using salient edges
Proceedings of SPIE (December 19 2001)
Content-based image retrieval
Proceedings of SPIE (February 26 2010)
FFT-based technique for image-signature generation
Proceedings of SPIE (January 15 1997)

Back to Top