An adaptive distance computation technique for image retrieval systems

  • Authors:

  • Nualsawat Hiransakolwong;Kien A. Hua;Soontharee Koompairojn;Khanh Vu;Sheau-Dong Lang

  • Affiliations:

  • King Mongkut's Institute of Technology, Ladkrabang, Bangkok;University of Central Florida, Orlando, FL;University of Central Florida, Orlando, FL;University of Central Florida, Orlando, FL;University of Central Florida, Orlando, FL

  • Venue:
  • Proceedings of the 2005 ACM symposium on Applied computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

For more than a decade query-by-one-example (QBE) has been a popular query system for content-based image retrieval (CBIR). However, recent research has shown that a single image is not sufficient to form its semantics or concept of the intended query. Searching concept "car," for instance, one might need many examples of car images in various colors. The color feature is then understood as a non-factor in the distance metric. In our approach, users can query by using groups of query images. There are three possible groups: relevant (positive), irrelevant (negative) or neutral groups. We define the range for each feature within these groups of query images, and use them to adjust the weights of the features. As a result, some features may be cancelled out from the similarity computation. The measure then becomes a dynamic metric for image retrieval. Our approach achieves a higher degree of precision and recall and, at the same time, significantly reduces the time complexity of matching. The proposed approach is tested against the ImageGrouper method. The results show that this approach is an effective and efficient technique for QBE.