Share Email Print

Proceedings Paper

Indexing for efficient spatial-similarity query processing in multimedia databases
Author(s): Venkat N. Gudivada
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

In multimedia databases, one major class of user queries requires retrieving those database images that are spatially similar to a query image. To rank order the database images with respect to the query, the existing spatial similarity algorithms compute the similarity of every database image with the query. For large multimedia databases, this task is computationally expensive and renders interactive query processing difficult. In this paper, we propose an indexing scheme which will eliminate non-relevant images to a query before the actual similarity computation. In other works, the indexing scheme serves as a filter and spatial similarity computation is done only on those images that pas through the filter. Some non-relevant images may pass through the filter ut the proposed indexing scheme guarantees that no relevant images are eliminated. The indexing scheme is robust in the sense that it recognizes translation, scaling, and rotation variant images of the query image as relevant to the query.

Paper Details

Date Published: 1 November 1996
PDF: 7 pages
Proc. SPIE 2916, Multimedia Storage and Archiving Systems, (1 November 1996); doi: 10.1117/12.257309
Show Author Affiliations
Venkat N. Gudivada, Univ. of Missouri/Rolla (United States)

Published in SPIE Proceedings Vol. 2916:
Multimedia Storage and Archiving Systems
C.-C. Jay Kuo, 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?