Please use this identifier to cite or link to this item: https://doi.org/10.1007/s00778-008-0101-6
Title: Speed up interactive image retrieval
Authors: Shen, H.T.
Jiang, S.
Tan, K.-L. 
Huang, Z.
Zhou, X.
Keywords: Image retrieval
Indexing
Query processing
Relevance feedback
Issue Date: 2009
Source: Shen, H.T., Jiang, S., Tan, K.-L., Huang, Z., Zhou, X. (2009). Speed up interactive image retrieval. VLDB Journal 18 (1) : 329-343. ScholarBank@NUS Repository. https://doi.org/10.1007/s00778-008-0101-6
Abstract: In multimedia retrieval, a query is typically interactively refined towards the "optimal" answers by exploiting user feedback. However, in existing work, in each iteration, the refined query is re-evaluated. This is not only inefficient but fails to exploit the answers that may be common between iterations. Furthermore, it may also take too many iterations to get the "optimal" answers. In this paper, we introduce a new approach called OptRFS (optimizing relevance feedback search by query prediction) for iterative relevance feedback search. OptRFS aims to take users to view the "optimal" results as fast as possible. It optimizes relevance feedback search by both shortening the searching time during each iteration and reducing the number of iterations. OptRFS predicts the potential candidates for the next iteration and maintains this small set for efficient sequential scan. By doing so, repeated candidate accesses (i.e., random accesses) can be saved, hence reducing the searching time for the next iteration. In addition, efficient scan on the overlap before the next search starts also tightens the search space with smaller pruning radius. As a step forward, OptRFS also predicts the "optimal" query, which corresponds to "optimal" answers, based on the early executed iterations' queries. By doing so, some intermediate iterations can be saved, hence reducing the total number of iterations. By taking the correlations among the early executed iterations into consideration, OptRFS investigates linear regression, exponential smoothing and linear exponential smoothing to predict the next refined query so as to decide the overlap of candidates between two consecutive iterations. Considering the special features of relevance feedback, OptRFS further introduces adaptive linear exponential smoothing to self-adjust the parameters for more accurate prediction. We implemented OptRFS and our experimental study on real life data sets show that it can reduce the total cost of relevance feedback search significantly. Some interesting features of relevance feedback search are also discovered and discussed. © 2008 Springer-Verlag.
Source Title: VLDB Journal
URI: http://scholarbank.nus.edu.sg/handle/10635/38926
ISSN: 10668888
DOI: 10.1007/s00778-008-0101-6
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

9
checked on Dec 6, 2017

WEB OF SCIENCETM
Citations

5
checked on Nov 22, 2017

Page view(s)

48
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.