Rapid and brief communication: An algorithm for semi-supervised learning in image retrieval

  • Authors:
  • Ke Lu;Jidong Zhao;Deng Cai

  • Affiliations:
  • School of Computer Science and Engineering, University of Electronic Science & Technology of China, Chengdu, Sichuan 610054, China;School of Computer Science and Engineering, University of Electronic Science & Technology of China, Chengdu, Sichuan 610054, China;University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA

  • Venue:
  • Pattern Recognition
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

Abstract

We study the problem of image retrieval based on semi-supervised learning. Semi-supervised learning has attracted a lot of attention in recent years. Different from traditional supervised learning. Semi-supervised learning makes use of both labeled and unlabeled data. In image retrieval, collecting labeled examples costs human efforts, while vast amounts of unlabeled data are often readily available and offer some additional information. In this paper, based on support vector machine (SVM), we introduce a semi-supervised learning method for image retrieval. The basic consideration of the method is that, if two data points are close to each, they should share the same label. Therefore, it is reasonable to search a projection with maximal margin and locality preserving property. We compare our method to standard SVM and transductive SVM. Experimental results show efficiency and effectiveness of our method.