Difficulty guided image retrieval using linear multiview embedding

Authors:
Yangxi Li;Bo Geng;Zheng-Jun Zha;Dacheng Tao;Linjun Yang;Chao Xu
Affiliations:
Peking University, Beijing, China;Peking University, Beijing, China;National University of Singapore, Singapore, Singapore;University of Technology, Sydney, Sydney, Australia;Microsoft Research Asia, Beijing, China;Peking University, Beijing, China
Venue:
MM '11 Proceedings of the 19th ACM international conference on Multimedia
Year:
2011

Citing 8
Cited 2

Video Google: A Text Retrieval Approach to Object Matching in Videos

ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Learning to estimate query difficulty: including applications to missing content detection and distributed information retrieval

Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Query performance prediction in web search environments

SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Optimizing multi-graph learning: towards a unified video annotation scheme

Proceedings of the 15th international conference on Multimedia
Ranking model adaptation for domain-specific search

Proceedings of the 18th ACM conference on Information and knowledge management
Multimedia search with pseudo-relevance feedback

CIVR'03 Proceedings of the 2nd international conference on Image and video retrieval
Biologically inspired feature manifold for scene classification

IEEE Transactions on Image Processing
Multiview spectral embedding

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Exploiting visual word co-occurrence for image retrieval

Proceedings of the 20th ACM international conference on Multimedia
A comprehensive study on learning to rank for content-based image retrieval

Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Existing image retrieval systems suffer from a radical performance variance for different queries. The bad initial search results for "difficult" queries may greatly degrade the performance of their subsequent refinements, especially the refinement that utilizes the information mined from the search results, e.g., pseudo relevance feedback based reranking. In this paper, we tackle this problem by proposing a query difficulty guided image retrieval system, which selectively performs reranking according to the estimated query difficulty. To improve the performance of both reranking and difficulty estimation, we apply multiview embedding (ME) to images represented by multiple different features for integrating a joint subspace by preserving the neighborhood information in each feature space. However, existing ME approaches suffer from both "out of sample" and huge computational cost problems, and cannot be applied to online reranking or offline large-scale data processing for practical image retrieval systems. Therefore, we propose a linear multiview embedding algorithm which learns a linear transformation from a small set of data and can effectively infer the subspace features of new data. Empirical evaluations on both Oxford and 500K ImageNet datasets suggest the effectiveness of the proposed difficulty guided retrieval system with LME.