Multi-Attribute Queries: To Merge or Not to Merge?

被引:16
作者
Rastegari, Mohammad [1 ]
Diba, Ali [2 ]
Parikh, Devi [3 ]
Farhadi, Ali [4 ]
机构
[1] Univ Maryland, College Pk, MD 20742 USA
[2] Sharif Univ Technol, Tehran, Iran
[3] Virginia Tech, Blacksburg, VA USA
[4] Univ Washington, Seattle, WA 98195 USA
来源
2013 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR) | 2013年
关键词
D O I
10.1109/CVPR.2013.425
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Users often have very specific visual content in mind that they are searching for. The most natural way to communicate this content to an image search engine is to use keywords that specify various properties or attributes of the content. A naive way of dealing with such multi-attribute queries is the following: train a classifier for each attribute independently, and then combine their scores on images to judge their fit to the query. We argue that this may not be the most effective or efficient approach. Conjunctions of attribute often correspond to very characteristic appearances. It would thus be beneficial to train classifiers that detect these conjunctions as a whole. But not all conjunctions result in such tight appearance clusters. So given a multi-attribute query, which conjunctions should we model? An exhaustive evaluation of all possible conjunctions would be time consuming. Hence we propose an optimization approach that identifies beneficial conjunctions.
引用
收藏
页码:3310 / 3317
页数:8
相关论文
共 22 条
[1]  
[Anonymous], 2010, NIPS
[2]  
[Anonymous], 2011, CVPR
[3]  
[Anonymous], 2009, CVPR
[4]  
[Anonymous], 2010, CALTECH UCSD BIRDS
[5]  
[Anonymous], INT J APPROX REASONI
[6]  
[Anonymous], ECCV
[7]  
[Anonymous], 25 IEEE C COMP VIS P
[8]  
Douze M., 2011, CVPR
[9]  
Duan K., 2012, CVPR
[10]  
Farhadi A., 2009, Computer Vision and Pattern Recognition