Graph Cuts in Content-Based Image Classification and Retrieval with Relevance Feedback
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.
KeywordsGraph Cuts Relevance Feedback Content-based Image Retrieval Radial Basis Function Maximum-flow/minimum-cut
Unable to display preview. Download preview PDF.
- 7.Source code for graph cuts max-flow/min-cut algorithm. http://www.adastral.ucl.ac.uk/~vladkolm/software.html 2004
- 8.Corel Gallery Magic 65000 (1999), http://www.corel.com