Name
Abstract | ||
|---|---|---|
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 are 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 are is weighted by the proportion of feature combinations for which the nearest neighour 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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-24752-4_19 | ADVANCES IN INFORMATION RETRIEVAL, PROCEEDINGS |
Keywords | Field | DocType |
directed graph,interaction technique,image features | Data mining,Automatic image annotation,Relevance feedback,Pattern recognition,Feature detection (computer vision),Feature (computer vision),Computer science,Image retrieval,Semantic network,Artificial intelligence,Content-based image retrieval,Visual Word | Conference |
Volume | ISSN | Citations |
2997 | 0302-9743 | 11 |
PageRank | References | Authors |
0.93 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Heesch | 1 | 144 | 14.87 |
| Stefan M. Rüger | 2 | 499 | 51.53 |