Click-boosting random walk for image search reranking

  • Authors:

  • Xiaopeng Yang;Yongdong Zhang;Ting Yao;Zheng-Jun Zha;Chong-Wah Ngo

  • Affiliations:

  • Chinese Academy of Sciences, Beijing, China;Chinese Academy of Sciences, Beijing, China;City University of Hong Kong, Kowloon, Hong Kong;Chinese Academy of Sciences, Beijing, China;City University of Hong Kong, Kowloon, Hong Kong

  • Venue:
  • Proceedings of the Fifth International Conference on Internet Multimedia Computing and Service
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Image reranking is an effective way for improving the retrieval performance of keyword-based image search engines. A fundamental issue underlying the success of existing image reranking approaches is the ability in identifying potentially useful recurrent patterns or relevant training examples from the initial search results. Ideally, these patterns and examples can be leveraged to upgrade the ranks of visually similar images, which are also likely to be relevant. The challenge, nevertheless, originates from the fact that keyword-based queries are used to be ambiguous, resulting in difficulty in predicting the search intention. Mining useful patterns and examples without understanding query is risky, and may lead to incorrect judgment in reranking. This paper explores the use of click-through data, which can be viewed as the footprints of user searching behavior, as an effective means of understanding query, for providing the basis on identifying the recurrent patterns that are potentially helpful for reranking. A new algorithm, named click-boosting random walk, is proposed. The algorithm utilizes clicked images to locate similar images that are not clicked, and reranks them by random walk. This simple idea is shown to outperform several existing approaches on a real-world image dataset collected from a commercial search engine with click-through data.