BUILDING PAIR-WISE VISUAL WORD TREE FOR EFFICENT IMAGE RE-RANKING

被引:9
|
作者
Zhang, Shiliang [1 ]
Huang, Qingming [2 ]
Lu, Yijuan [3 ]
Gao, Wen [1 ]
Tian, Qi [4 ]
机构
[1] Chinese Acad Sci, Inst Comp Tech, Key Lab Intelli Info Proc, Beijing 100080, Peoples R China
[2] Grad Univ Chinese Acad Sci, Beijing 100049, Peoples R China
[3] Texas State Univ, Dept Comp Sci, San Marcos, TX 78666 USA
[4] Univ Texas San Antonio, Dept Comp Sci, San Antonio, TX 78249 USA
基金
中国国家自然科学基金; 北京市自然科学基金;
关键词
Image Analysis; Image Processing;
D O I
10.1109/ICASSP.2010.5494964
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
Bag-of-visual Words (BoW) image representation is getting popular in computer vision and multimedia communities. However, experiments show that the traditional BoW representation is not as effective as it is desired. One of the most important reasons for its ineffectiveness is that, the traditional BoW representation lost the spatial information in images. To overcome this problem, we propose the pairwise visual word tree, within which each visual word keeps both the appearance and spatial information between two interest points in image. Thus, the corresponding novel BoW representation preserves the spatial structure in image. Based on the pair-wise visual word tree, we propose an efficient topic word selection algorithm, which utilizes the Latent Semantic Analysis to discover the most expressive visual words for different image categories. An efficient strategy is then utilized to combine the selected topic words for image re-ranking. Massive experiments show that the novel BoW representation shows promising performance. Meanwhile, the proposed image re-ranking strategy shows the state-of-the-art precision and promising efficiency.
引用
收藏
页码:794 / 797
页数:4
相关论文
共 50 条
  • [1] Collaborative Image Relevance Learning for Visual Re-Ranking
    Ouyang, Jianbo
    Zhou, Wengang
    Wang, Min
    Tian, Qi
    Li, Houqiang
    IEEE TRANSACTIONS ON MULTIMEDIA, 2021, 23 : 3646 - 3656
  • [2] Efficient Re-ranking in Vocabulary Tree based Image Retrieval
    Wang, Xiaoyu
    Yang, Ming
    Yu, Kai
    2011 CONFERENCE RECORD OF THE FORTY-FIFTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS (ASILOMAR), 2011, : 855 - 859
  • [3] Web Image Re-Ranking by Utilizing Text and Visual Features
    Bajpai, Aruna
    2014 CONFERENCE ON IT IN BUSINESS, INDUSTRY AND GOVERNMENT (CSIBIG), 2014,
  • [4] Social Re-ranking of Image Based on Visual and Semantic Information
    Phursutkar, Prachi
    Wanjale, Kirti
    2017 8TH INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATION AND NETWORKING TECHNOLOGIES (ICCCNT), 2017,
  • [5] Representation Learning with Pair-wise Constraints for Collaborative Ranking
    Zhuang, Fuzhen
    Luo, Dan
    Yuan, Nicholas Jing
    Xie, Xing
    He, Qing
    WSDM'17: PROCEEDINGS OF THE TENTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, 2017, : 567 - 575
  • [6] Graph Attention Autoencoder for Collaborative Pair-wise Ranking
    Mu, Nan
    Zha, Daren
    He, Yuanye
    Zhao, Lin
    PROCEEDINGS OF THE 2021 IEEE 24TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN (CSCWD), 2021, : 1063 - 1068
  • [7] The fairness of ranking procedure in pair-wise preference learning
    Zhang, ZZ
    Xing, HC
    Wang, ZZ
    Ni, QJ
    Proceedings of the 2005 IEEE International Conference on Natural Language Processing and Knowledge Engineering (IEEE NLP-KE'05), 2005, : 780 - 784
  • [8] Multiple level visual semantic fusion method for image re-ranking
    Qi, Shuhan
    Wang, Fanglin
    Wang, Xuan
    Guan, Yue
    Wei, Jia
    Guan, Jian
    MULTIMEDIA SYSTEMS, 2017, 23 (01) : 155 - 167
  • [9] Multiple level visual semantic fusion method for image re-ranking
    Shuhan Qi
    Fanglin Wang
    Xuan Wang
    Yue Guan
    Jia Wei
    Jian Guan
    Multimedia Systems, 2017, 23 : 155 - 167
  • [10] Integrating Visual Saliency and Consistency for Re-Ranking Image Search Results
    Huang, Jun
    Yang, Xiaokang
    Fang, Xiangzhong
    Lin, Weiyao
    Zhang, Rui
    IEEE TRANSACTIONS ON MULTIMEDIA, 2011, 13 (04) : 653 - 661