Click-Boosted Graph Ranking for Image Retrieval
Computer Science and Information Systems, Tome 14 (2017) no. 3
Graph ranking is one popular and successful technique for image retrieval, but its effectiveness is often limited by the well-known semantic gap. To bridge this gap, one of the current trends is to leverage the click-through data associated with images to facilitate the graph-based image ranking. However, the sparse and noisy properties of the image click-through data make the exploration of such resource challenging. Towards this end, this paper propose a novel click-boosted graph ranking framework for image retrieval, which consists of two coupled components. Concretely, the first one is a click predictor based on matrix factorization with visual regularization, in order to alleviate the sparseness of the click-through data. The second component is a soft-label graph ranker that conducts the image ranking by using the enriched click-through data noise-tolerantly. Extensive experiments for the tasks of click predicting and image ranking validate the effectiveness of the proposed methods in comparison to several existing approaches.
Keywords:
Image Retrieval, Click-Through Data, Graph Ranking, Matrix Factorization
@article{CSIS_2017_14_3_a6,
author = {Jun Wu and Yu He and Xiaohong Qin and Na Zhao and Yingpeng Sang},
title = {Click-Boosted {Graph} {Ranking} for {Image} {Retrieval}},
journal = {Computer Science and Information Systems},
year = {2017},
volume = {14},
number = {3},
url = {http://geodesic.mathdoc.fr/item/CSIS_2017_14_3_a6/}
}
Jun Wu; Yu He; Xiaohong Qin; Na Zhao; Yingpeng Sang. Click-Boosted Graph Ranking for Image Retrieval. Computer Science and Information Systems, Tome 14 (2017) no. 3. http://geodesic.mathdoc.fr/item/CSIS_2017_14_3_a6/