Re-ranking of web image search results using a graph algorithm
Proceedings - International Conference on Pattern Recognition
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/26768
We propose a method to improve the results of image search engines on the Internet to satisfy users who desire to see relevant images in the first few pages. The method re-ranks the results of text based systems by incorporating visual similarity of the resulting images. We observe that, together with many unrelated ones, results of text based systems include a subset of correct images, and this set is, in general, the largest one which has the most similar images compared to other possible subsets. Based on this observation, we present similarities of all images in a graph structure, and find the densest component that corresponds to the largest set of most similar subset of images. Then, to re-rank the results, we give higher priority to the images in the densest component, and rank the others based on their similarities to the images in the densest component. The experiments are carried out on 18 category of images from . © 2008 IEEE.
- Conference Paper 2294