The Open UniversitySkip to content
 

Image browsing: semantic analysis of NN k networks

Heesch, Daniel and Rüger, Stefan (2005). Image browsing: semantic analysis of NN k networks. In: 4th International Conference on Image and Video Retrieval (CIVR 2005), 20-22 July 2005, Singapore, pp. 609–618.

DOI (Digital Object Identifier) Link: http://dx.doi.org/10.1007/11526346_64
Google Scholar: Look up in Google Scholar

Abstract

Given a collection of images and a set of image features, we can build what we have previously termed NNk networks by representing images as vertices of the network and by establishing arcs between any two images if and only if one is most similar to the other for some weighted combination of features. An earlier analysis of its structural properties revealed that the networks exhibit small-world properties, that is a small distance between any two vertices and a high degree of local structure. This paper extends our analysis. In order to provide a theoretical explanation of its remarkable properties, we investigate explicitly how images belonging to the same semantic class are distributed across the network. Images of the same class correspond to subgraphs of the network. We propose and motivate three topological properties which we expect these subgraphs to possess and which can be thought of as measures of their compactness. Measurements of these properties on two collections indicate that these subgraphs tend indeed to be highly compact.

Item Type: Conference Item
ISSN: 0302-9743
Academic Unit/Department: Knowledge Media Institute
Item ID: 11978
Depositing User: Users 8580 not found.
Date Deposited: 08 Oct 2008 14:15
Last Modified: 27 Sep 2011 08:13
URI: http://oro.open.ac.uk/id/eprint/11978
Share this page:

Actions (login may be required)

View Item
Report issue / request change

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340   general-enquiries@open.ac.uk