Hybrid index-based image search from the web
Rahul Gupta,
S.K. Ghosh,
Shamik Sural and
Sakti Pramanik
International Journal of Data Mining, Modelling and Management, 2011, vol. 3, issue 3, 252-276
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. (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:
Downloads: (external link)
http://www.inderscience.com/link.php?id=41809 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:ids:ijdmmm:v:3:y:2011:i:3:p:252-276
Access Statistics for this article
More articles in International Journal of Data Mining, Modelling and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().