Relevance maximizing, iteration minimizing, relevance-feedback, content-based image retrieval (CBIR)

• US 7,111,002 B2
• Filed: 04/26/2004
• Issued: 09/19/2006
• Est. Priority Date: 03/30/2001
• Status: Expired due to Fees

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Su, Zhong, Zhang, Hong-Jiang, Zhu, Xingquan
• Primary Examiner(s): Al-Hashemi, Sana
• Application Number:
  US10/832,501
• Publication Number:
  US 20040243541A1
• Time in Patent Office: 876 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06F 16/5838 using colour
• CPC Class Codes: G06F 18/2178 based on feedback of a supervisor
• CPC Class Codes: G06F 18/22 Matching criteria, e.g. proximity measures
• CPC Class Codes: G06F 18/24155 Bayesian classification
• CPC Class Codes: G06F 18/40 Software arrangements specially adapted for pattern recognition, e.g. user interfaces or toolboxes therefor
• CPC Class Codes: G06V 10/761 Proximity, similarity or dissimilarity measures
• CPC Class Codes: G06V 10/7784 based on feedback from supervisors
• CPC Class Codes: G06V 10/945 User interactive design; Environments; Toolboxes
• CPC Class Codes: Y10S 707/99931 Database or file accessing
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access
• CPC Class Codes: Y10S 707/99936 Pattern matching access
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing
• CPC Class Codes: Y10S 707/99948 Application of database or data structure, e.g. distributed, multimedia, or image

Abstract

An implementation of a technology, described herein, for relevance-feedback, content-based facilitating accurate and efficient image retrieval minimizes the number of iterations for user feedback regarding the semantic relevance of exemplary images while maximizing the resulting relevance of each iteration. One technique for accomplishing this is to use a Bayesian classifier to treat positive and negative feedback examples with different strategies. In addition, query refinement techniques are applied to pinpoint the users'"'"' intended queries with respect to their feedbacks. These techniques further enhance the accuracy and usability of relevance feedback. This abstract itself is not intended to limit the scope of this patent. The scope of the present invention is pointed out in the appending claims.

Claims

1. A method for improving iterative results of Content-Based Image Retrieval (CBIR) using relevance feedback, the method comprising:

obtaining a set of positive feedback images and a set of negative feedback images via relevance feedback, the set of positive feedback images are those images deemed semantically relevant and the set of negative feedback images are those deemed semantically less relevant;

within a feature space, moving a positive candidate images towards the positive feedback images, the positive candidate images having similar low-level features as those of the set of positive feedback images, wherein the moving further comprises;

normalizing features of an image within a feature space;

initializaing σ

_ki to be null and let ε

_ki={right arrow over (x)}_ki, n_k=1;

updating parameters so that

$\begin{array}{c}{\mathrm{\sigma <br><br>}}_{k<br><br><br><br>i}^2=n_k<br><br>{\mathrm{\sigma <br><br>}}_{k<br><br><br><br>i}^2+\frac{n_k<br><br>q<br><br><br><br>{\mathrm{\varepsilon <br><br>}}_{k_i}^2<br><br>2<br><br>n_k<br><br>{\mathrm{\varepsilon <br><br>}}_{k_i}<br><br>\mathrm{\Sigma <br><br>}<br><br><br><br>P_{\mathrm{Pi}}}{n_k+q}+\mathrm{\Sigma <br><br>}<br><br><br><br>P_{\mathrm{Pi}}^2-\frac{{\left(\mathrm{\Sigma <br><br>}<br><br><br><br>P_{\mathrm{Pi}}\right)}^2}{n_k+q},\\ {\mathrm{\varepsilon <br><br>}}_{k<br><br><br><br>i}=\frac{n_k\times <br><br>{\mathrm{\varepsilon <br><br>}}_{k<br><br><br><br>i}+\mathrm{sum}<br><br>\left(C_P\right)}{n_k+q},\\ n_k=n_k+q;<br><br>\end{array}$

within a feature space, distancing negative candidate images from the set of positive feedback images, the negative candidate images having similar low-level features as those of the set of negative feedback images;

calculating distances based upon a Bayesian decision boundary function;

sorting images based upon calculated distances, wherein the sort is performed as if no negative feedback images exist.