An Optimized Interaction Strategy for Bayesian Relevance Feedback

  • Authors:
  • I. J. Cox;M. L. Miller;T. P. Minka;P. N. Yianilos

  • Affiliations:
  • -;-;-;-

  • Venue:
  • CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
  • Year:
  • 1998

Quantified Score

Hi-index 0.01

Visualization

Abstract

A new algorithm and systematic evaluation is presented for searching a database via relevance feedback. It represents a new image display strategy for the PicHunter system [2, 1]. The algorithm takes feedback in the form of relative judgments ("item A is more relevant than item B") as opposed to the stronger assumption of categorical relevance judgments ("item A is relevant but item B is not"). It also exploits a learned probabilistic model of human behavior to make better use of the feedback it obtains. The algorithm can be viewed as an extension of indexing schemes like the k-d tree to a stochastic setting, hence the name "stochastic-comparison search." In simulations, the amount of feedback required for the new algorithm scales like log2 |D|, where |D| is the size of the database, while a simple query-by-example approach scales like |D|a, where a