Heesch, Daniel and Rüger, Stefan
NNk networks for Content-Based Image Retrieval.
In: Advances in Information Retrieval, pp. 253–266.
Full text available as:
This paper describes a novel interaction technique to support content-based image search in large image collections. The idea is to represent each image as a vertex in a directed graph. Given a set of image features, an arc is established between two images if there exists at least one combination of features for which one image is retrieved as the nearest neighbour of the other. Each arc is weighted by the proportion of feature combinations for which the nearest neighbour relationship holds. By thus integrating the retrieval results over all possible feature combinations, the resulting network helps expose the semantic richness of images and thus provides an elegant solution to the problem of feature weighting in content-based image retrieval.We give details of the method used for network generation and describe the ways a user can interact with the structure. We also provide an analysis of the network’s topology and provide quantitative evidence for the usefulness of the technique.
||Published in: S. McDonald and J. Tait (Eds.): ECIR 2004, LNCS 2997, pp. 253-266, 2004
||NN^k networks; image browsing; lateral browsing; image retrieval
||Knowledge Media Institute
||25 Oct 2011 15:27
||29 Feb 2016 07:44
|Share this page:
Download history for this item
These details should be considered as only a guide to the number of downloads performed manually. Algorithmic methods have been applied in an attempt to remove automated downloads from the displayed statistics but no guarantee can be made as to the accuracy of the figures.
Actions (login may be required)