Optimizing social image search with multiple criteria: Relevance, diversity, and typicality

被引:17
作者
Sun, Fuming [1 ]
Wang, Meng [2 ]
Wang, Dongxia [1 ]
Wang, Xueming [1 ]
机构
[1] Liaoning Univ Technol, Jinzhou 121001, Peoples R China
[2] Natl Univ Singapore, Singapore 117548, Singapore
关键词
Social image search; Tag; Diversity; Typicality; Relevance;
D O I
10.1016/j.neucom.2011.05.040
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The explosive growth and wide-spread accessibility of community-contributed multimedia contents on the Internet have led to a surging research activity in social image search. However, the existing tag-based search methods frequently return irrelevant or redundant results. To quickly target user's intention in the result returned by an ambiguous query, we first put forward that the top-ranked search results should meet some criteria, i.e., relevance, typicality and diversity. With the three criteria, a novel ranking scheme for social image search is proposed which incorporates both semantic similarity and visual similarity. The ranking list with relevance, typicality and diversity is returned by optimizing a measure named Average Diverse Precision. The typicality score of samples is estimated via the probability density in the space of visual features. The diversity among the top-ranked list is achieved by fusing both semantic and visual similarities of images. A comprehensive approach for calculating visual similarity is considered by fusing the similarity values according to different features. To further benefit ranking performance, a data-driven method is implemented to refine the tags of social image. Comprehensive experiments demonstrate the effectiveness of the approach proposed in this paper. (c) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:40 / 47
页数:8
相关论文
共 24 条
[1]  
[Anonymous], 2008, 2008 IEEE C COMPUTER, DOI DOI 10.1109/CVPR.2008.4587383
[2]  
[Anonymous], 2008, P 17 INT C WORLD WID, DOI DOI 10.1145/1367497.1367540
[3]  
[Anonymous], 2009, P 18 INT C WORLD WID, DOI 10.1145/1526709.1526756
[4]  
Carbonell J., 1998, Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, P335, DOI 10.1145/290941.291025
[5]  
Cui J., 2008, P ACM INT C MULT OCT
[6]   Clustering by passing messages between data points [J].
Frey, Brendan J. ;
Dueck, Delbert .
SCIENCE, 2007, 315 (5814) :972-976
[7]  
Ge Y, 2007, 2007 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO, VOLS 1-5, P827
[8]  
Hsu WinstonH., 2007, ACM MM
[9]  
Li Xirong., 2008, Proceedings of the 1st ACM International Conference on Multimedia Information Retrieval, MIR '08, P180
[10]  
Liu Dong., 2009, P 18 INT C WORLD WID, P351