Please use this identifier to cite or link to this item: https://doi.org/10.1109/TMM.2012.2199292
Title: Difficulty guided image retrieval using linear multiple feature embedding
Authors: Li, Y.
Geng, B.
Tao, D.
Zha, Z.-J. 
Yang, L.
Xu, C.
Keywords: Content based image retrieval
query difficulty estimation
spectral embedding
Issue Date: 2012
Source: Li, Y., Geng, B., Tao, D., Zha, Z.-J., Yang, L., Xu, C. (2012). Difficulty guided image retrieval using linear multiple feature embedding. IEEE Transactions on Multimedia 14 (6) : 1618-1630. ScholarBank@NUS Repository. https://doi.org/10.1109/TMM.2012.2199292
Abstract: Existing image retrieval systems suffer from a performance variance for different queries. Severe performance variance may greatly degrade the effectiveness of the subsequent query-dependent ranking optimization algorithms, especially those that utilize the information mined from the initial search results. In this paper, we tackle this problem by proposing a query difficulty guided image retrieval system, which can predict the queries' ranking performance in terms of their difficulties and adaptively apply ranking optimization approaches. We estimate the query difficulty by comprehensively exploring the information residing in the query image, the retrieval results, and the target database. To handle the high-dimensional and multi-model image features in the large-scale image retrieval setting, we propose a linear multiple feature embedding algorithm which learns a linear transformation from a small set of data by integrating a joint subspace in which the neighborhood information is preserved. The transformation can be effectively and efficiently used to infer the subspace features of the newly observed data in the online setting. We prove the significance of query difficulty to image retrieval by applying it to guide the conduction of three retrieval refinement applications, i.e., reranking, federated search, and query suggestion. Thorough empirical studies on three datasets suggest the effectiveness and scalability of the proposed image query difficulty estimation algorithm, as well as the promising of the image difficulty guided retrieval system. © 1999-2012 IEEE.
Source Title: IEEE Transactions on Multimedia
URI: http://scholarbank.nus.edu.sg/handle/10635/39716
ISSN: 15209210
DOI: 10.1109/TMM.2012.2199292
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

20
checked on Dec 11, 2017

WEB OF SCIENCETM
Citations

16
checked on Dec 11, 2017

Page view(s)

67
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


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