Authors: Rahul Gupta, S.K. Ghosh, Shamik Sural, Sakti Pramanik
Addresses: School of Information Technology, Indian Institute of Technology, Kharagpur – 721 302, India. ' School of Information Technology, Indian Institute of Technology, Kharagpur – 721 302, India. ' School of Information Technology, Indian Institute of Technology, Kharagpur – 721 302, India. ' Department of Computer Science and Engineering, Michigan State University, East Lansing, MI 48824, USA
Abstract: Existing search techniques for retrieving images from the web store text-based and content-based features separately. They use structures like inverted-index, forward-index, document-term matrix, Tries, Prefix B-Tree, String B-Tree, etc. for text-based features and R-tree, SR-tree, K-B-D Tree, etc., for content-based features. We propose to use a hybrid indexing scheme which is more intuitive for hybrid image feature vectors and can be used to both store and query non-ordered discrete and continuous features simultaneously. Also, since most of the existing hybrid image search engines do not store two types of features together, they usually perform retrieval in two distinct steps, first finding results with only text-based information and later filtering results based on content-based information. In contrast, our approach of hybrid indexing supports retrieval in a single step. We introduce a k-nearest neighbour search algorithm for the hybrid indexing scheme used.
Keywords: image retrieval; indexing; automatic image annotation; hybrid search; k-nearest neighbour search; single step retrieval; image search; images.
International Journal of Data Mining, Modelling and Management, 2011 Vol.3 No.3, pp.252 - 276
Published online: 06 Aug 2011 *Full-text access for editors Access for subscribers Purchase this article Comment on this article