Image feature evaluation for contents-based image retrieval

  • Authors:

  • Adam Kuffner;Antonio Robles-Kelly

  • Affiliations:

  • Australian National University, Canberra, Australia;Vision Science, Technology and Applications (VISTA), NICTA, Canberra, Australia and Australian National University, Canberra, Australia

  • Venue:
  • VisHCI '06 Proceedings of the HCSNet workshop on Use of vision in human-computer interaction - Volume 56
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper is concerned with feature evaluation for content-based image retrieval. Here we concentrate our attention on the evaluation of image features amongst three alternatives, namely the Harris corners, the maximally stable extremal regions and the scale invariant feature transform. To evaluate these image features in a content-based image retrieval setting, we have used the KD-tree algorithm. We use the KD-tree algorithm to match those features corresponding to the query image with those recovered from the images in the data set under study. With the matches at hand, we use a nearest neighbour approach to threshold the Euclidean distances between pairs of corresponding features. In this way, the retrieval is such that those features whose pairwise distances are small, "vote" for a retrieval candidate in the data-set. This voting scheme allows us to arrange the images in the data set in order of relevance and permits the recovery of measures of performance for each of the three alternatives. In our experiments, we focus in the evaluation of the effects of scaling and rotation in the retrieval performance.