Advertisement

Graph Cuts in Content-Based Image Classification and Retrieval with Relevance Feedback

  • Ning Zhang
  • Ling Guan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4810)

Abstract

Content-based image retrieval (CBIR) has suffered from the lack of linkage between low-level features and high-level semantics. Although relevance feedback (RF) CBIR provides a promising solution involving human interaction, certain query images poorly represented by low-level features still have unsatisfactory retrieval results. An innovative method has been proposed to increase the percentage of relevance of target image database by using graph cuts theory with the maximum-flow/minimum-cut algorithm and relevance feedback. As a result, the database is reformed by keeping relevant images while discarding irrelevant images. The relevance is increased and thus during following RF-CBIR process, previously poorly represented relevant images have higher probability to appear for selection. Better performance and retrieval results can thus be achieved.

Keywords

Graph Cuts Relevance Feedback Content-based Image Retrieval Radial Basis Function Maximum-flow/minimum-cut 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Rui, Y., Huang, T.S., Chang, S.F.: Image retrieval: current techniques, promising directions and open issues. Journal of visual communication and image representation [1047-3203] 10(4), 39 (1999)CrossRefGoogle Scholar
  2. 2.
    Zhou, X.S., Huang, T.S.: Relevance feedback in image retrieval: A comprehensive review. Multimedia systems [0942-4962] Zhou 8(6), 536 (2003)CrossRefGoogle Scholar
  3. 3.
    Rui, Y., et al.: Relevance Feedback: A Power Tool for Interactive Content-Based Image Retrieval. IEEE Trans. Circuits and Systems for Video Technology 8(5), 644–655 (1998)CrossRefGoogle Scholar
  4. 4.
    Boykov, Y., Funka-Lea, G.: Graph Cuts and Efficient N-D Image Segmentation. International Journal of Computer Vision (IJCV) 70(2), 109–131 (2006)CrossRefGoogle Scholar
  5. 5.
    Muneesawang, P., Guan, L.: An interactive approach for CBIR using a network of radial basis functions. IEEE Trans. Multimedia 6(5), 703–716 (2004)CrossRefGoogle Scholar
  6. 6.
    Boykov, Y., Kolmogorov, V.: An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision. IEEE Trans. Pattern Analysis and Machine Intelligence (PAMI) 26(9), 1124–1137 (2004)CrossRefGoogle Scholar
  7. 7.
    Source code for graph cuts max-flow/min-cut algorithm. http://www.adastral.ucl.ac.uk/~vladkolm/software.html 2004
  8. 8.
    Corel Gallery Magic 65000 (1999), http://www.corel.com

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Ning Zhang
    • 1
  • Ling Guan
    • 1
  1. 1.Department of Electrical and Computer Enineering, Ryerson Uiversity, TorontoCanada

Personalised recommendations