24 August 1999 Efficient access methods for content-based image retrieval with inverted files
Author Affiliations +
Proceedings Volume 3846, Multimedia Storage and Archiving Systems IV; (1999) https://doi.org/10.1117/12.360450
Event: Photonics East '99, 1999, Boston, MA, United States
Abstract
As human factor studies over the last thirty years have shown, response time is a very important factor for the usability of an interactive system, especially on the world wide web. In particular, response times of under one second are often specified as a usability requirement. This paper compares several methods for improving the evaluation time in a content-based image retrieval system which uses inverted file technology. The use of the inverted file technology facilitates search pruning in a variety of ways, as is shown in this paper. For large databases and a high number o possible features, efficient and fast access is necessary to allow interactive querying and browsing. Parallel access to the inverted file can reduce the response time. This parallel access is very easy to implement with little communication overhead, and thus scales well. Other search pruning methods, similar to methods used in information retrieval, can also reduce the response time significantly without reducing the performance of the system. The performance of the system is evaluated using precision vs. recall graphs, which are an established evaluation method in information retrieval. A user survey was carried out in order to obtain relevance judgments for the queries reported in this work.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Henning Mueller, David McG. Squire, Wolfgang Mueller, Thierry Pun, "Efficient access methods for content-based image retrieval with inverted files", Proc. SPIE 3846, Multimedia Storage and Archiving Systems IV, (24 August 1999); doi: 10.1117/12.360450; https://doi.org/10.1117/12.360450
PROCEEDINGS
12 PAGES


SHARE
Back to Top