NNk Networks for Content-Based Image Retrieval

  • Daniel Heesch
  • Stefan Rüger
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2997)


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 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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adamic, L.A., Lukose, R.M., Puniyani, A.R., Huberman, B.A.: Search in power-law networks. Physical Review E 64 (2001)Google Scholar
  2. 2.
    Bollobás, B.: Random Graphs. Springer, New York (1985)MATHGoogle Scholar
  3. 3.
    Campbell, I.: The ostensive model of developing information-needs. PhD thesis, University of Glasgow (2000)Google Scholar
  4. 4.
    Chen, C., Gagaudakis, G., Rosin, P.: Similarity-based image browsing. In: Proceedings of the 16th IFIP World Computer Congress. International Conference on Intelligent Information Processing (2000)Google Scholar
  5. 5.
    Cox, K.: Information retrieval by browsing. In: Proceedings of The 5th International Conference on New Information Technology, Hong kong (1992)Google Scholar
  6. 6.
    Cox, K.: Searching through browsing. PhD thesis, University of Canberra (1995)Google Scholar
  7. 7.
    Croft, B., Parenty, T.J.: Comparison of a network structure and a database system used for document retrieval. Information Systems 10, 377–390 (1985)CrossRefGoogle Scholar
  8. 8.
    Dearholt, D.W., Schvaneveldt, R.W.: Properties of Pathfinder networks. In: Schvaneveldt, R.W. (ed.) Pathfinder associative networks: Studies in knowledge organization, Ablex, Norwood (1990)Google Scholar
  9. 9.
    Fowler, R.H., Wilson, B., Fowler, W.A.L.: Information navigator: An information system using associative networks for display and retrieval. Department of Computer Science, Technical Report NAG9-551, 92-1 (1992)Google Scholar
  10. 10.
    Heesch, D., Pickering, M., Yavlinsky, A., Rüger, S.: Video retrieval within a browsing framework using keyframe. In: Proceedings of TRECVID 2003, NIST, Gaithersburg, MD, November 2003 (2004)Google Scholar
  11. 11.
    Heesch, D.C., Rüger, S.: Performance boosting with three mouse clicks — relevance feedback for CBIR. In: Proceedings of the European Conference on IR Research 2003. LNCS, Springer, Heidelberg (2003)Google Scholar
  12. 12.
    Heesch, D.C., Yavlinsky, A., Rüger, S.: Performance comparison between different similarity models for CBIR with relevance feedback. In: Bakker, E.M., Lew, M., Huang, T.S., Sebe, N., Zhou, X.S. (eds.) CIVR 2003. LNCS, vol. 2728, Springer, Heidelberg (2003)CrossRefGoogle Scholar
  13. 13.
    Kleinberg, J.M.: Navigation in a small world. Nature, 845 (2000)Google Scholar
  14. 14.
    Manjunath, B.S., Ohm, J.-S.: Color and texture descriptors. IEEE Transactions on circuits and systems for video technology 11, 703–715 (2001)CrossRefGoogle Scholar
  15. 15.
    Müller, H., Müller, W., Squire, D.M., Marchand-Maillet, M.S., Pun, T.: Strategies for positive and negative relevance feedback in image retrieval. In: Proceedings of the 15th International Conference on Pattern Recognition (ICPR 2000), IEEE, Barcelona (2000)Google Scholar
  16. 16.
    Newman, M.E.J.: Random graphs as models of networks. In: Bornholdt, S., Schuster, H.G. (eds.) Handbook of graphs and networks - from the genome to the internet, Wiley-VCH, Chichester (2003)Google Scholar
  17. 17.
    Santini, S., Gupta, A., Jain, R.: Emergent semantics through interaction in image databases. IEEE transactions on knowledge and data engineering 13(3), 337–351 (2001)CrossRefGoogle Scholar
  18. 18.
    Santini, S., Jain, R.: Integrated browsing and querying for image databases. IEEE MultiMedia 7(3), 26–39 (2000)CrossRefGoogle Scholar
  19. 19.
    Tieu, K., Viola, P.: Boosting image retrieval. In: 5th International Conference on Spoken Language Processing (December 2000)Google Scholar
  20. 20.
    van Dongen, S.: A cluster algorithm for graphs. Technical report, National Research Institute for Mathematics and Computer Science in the Netherlands, Amsterdam (2000)Google Scholar
  21. 21.
    Watts, D.J., Strogatz, S.H.: Collective dynamics of ’small-world’ networks. Nature 393, 440–442 (1998)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Daniel Heesch
    • 1
  • Stefan Rüger
    • 1
  1. 1.Department of ComputingImperial CollegeLondonEngland

Personalised recommendations