We will do all we can to make sure that the relationship that you have with The Open University is a positive one.
We will do all we can to treat you as an individual, whether you are contacting to give us some good news or to raise a problem. Please also be assured that we will not share, sell or give your details to anyone.
This system demonstrates a novel interation technique to support content-based image search in large image collections. Each image is represented by a vertex in a directed graph. An arc is established between two images if there are one or more features for which the images are nearest neighbours. The arcs are weigted by the proportion of the features for which the nearest neighbour relationship holds. The resultant network exposes the sematic richness of the image collection and allows the user to browse through this.