Hybrid index-based image search from the web Online publication date: Thu, 26-Feb-2015
by Rahul Gupta, S.K. Ghosh, Shamik Sural, Sakti Pramanik
International Journal of Data Mining, Modelling and Management (IJDMMM), Vol. 3, No. 3, 2011
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Mining, Modelling and Management (IJDMMM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook