Image retrieval algorithm based on enhanced relational graph

  • Authors:
  • Guang-Nan He;Yu-Bin Yang;Ning Li;Yao Zhang

  • Affiliations:
  • State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China;State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China;State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China;Jinlin College, Nanjing University, Nanjing, China

  • Venue:
  • IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part I
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The "semantic gap" problem is one of the main difficulties in image retrieval task. Semi-supervised learning is an effective methodology proposed to narrow down the gap, which is also often integrated with relevance feedback techniques. However, in semi-supervised learning, the amount of unlabeled data is usually much greater than that of labeled data. Therefore, the performance of a semi-supervised learning algorithm relies heavily on how effective it uses the relationship between the labeled and unlabeled data. A novel algorithm is proposed in this paper to enhance the relational graph built on the entire data set, expected to increase the intra-class weights of data while decreasing the inter-class weights and linking the potential intra-class data. The enhanced relational matrix can be directly used in any semi-supervised learning algorithm. The experimental results in feedback-based image retrieval tasks show that the proposed algorithm performs much better compared with other algorithms in the same semi-supervised learning framework.