Efficient Semantic Indexing for Image Retrieval

Semantic analysis of a document collection can be viewed as an unsupervised clustering of the constituent words and documents around hidden or latent concepts. This has shown to improve the performance of visual bag of words in image retrieval. However, the enhancement in performance depends heavily on the right choice of number of semantic concepts. Most of the semantic indexing schemes are also computationally costly. In this paper, we propose a bipartite graph model (BGM) for image retrieval. BGM is a scalable datastructure that aids semantic indexing in an efficient manner. It can also be incrementally updated. BGM uses tf-idf values for building a semantic bipartite graph. We also introduce a graph partitioning algorithm that works on the BGM to retrieve semantically relevant images from a database. We demonstrate the properties as well as performance of our semantic indexing scheme through a series of experiments.

• Type: Conference
• Year: 2010
• Where: ICPR
• Authors: Chandrika Pulla, Suman Karthik, C. V. Jawahar
• Keywords: Computer Vision, ICPR 2010, Semantic, Semantic Indexing, Semantic Indexing Scheme