Welcome to the InfoSci Platform
Hybrid Query Refinement: A Strategy for a Distance Based Index Structure to Refine Multimedia Queries

Hybrid Query Refinement: A Strategy for a Distance Based Index Structure to Refine Multimedia Queries

Kasturi Chatterjee, Shu-Ching Chen
Copyright: © 2011 |Volume: 2 |Issue: 3 |Pages: 20
ISSN: 1947-8534|EISSN: 1947-8542|EISBN13: 9781613508534|DOI: 10.4018/jmdem.2011070104
Cite Article Cite Article

MLA

Chatterjee, Kasturi, and Shu-Ching Chen. "Hybrid Query Refinement: A Strategy for a Distance Based Index Structure to Refine Multimedia Queries." IJMDEM vol.2, no.3 2011: pp.52-71. http://doi.org/10.4018/jmdem.2011070104

APA

Chatterjee, K. & Chen, S. (2011). Hybrid Query Refinement: A Strategy for a Distance Based Index Structure to Refine Multimedia Queries. International Journal of Multimedia Data Engineering and Management (IJMDEM), 2(3), 52-71. http://doi.org/10.4018/jmdem.2011070104

Chicago

Chatterjee, Kasturi, and Shu-Ching Chen. "Hybrid Query Refinement: A Strategy for a Distance Based Index Structure to Refine Multimedia Queries," International Journal of Multimedia Data Engineering and Management (IJMDEM) 2, no.3: 52-71. http://doi.org/10.4018/jmdem.2011070104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This paper proposes a hybrid query refinement model for distance-based index structures supporting content-based image retrievals. The framework refines a query by considering both the low-level feature space as well as the high-level semantic interpretations separately. Thus, it successfully handles queries where the gap between the feature components and the semantics is large. It refines the low-level feature space, indexed by the distance based index structure, in multiple iterations by introducing the concept of multipoint query in a metric space. It refines the high-level semantic space by dynamically adjusting the constructs of a framework, called the Markov Model Mediator (MMM), utilized to introduce the semantic relationships in the index structure. A k-nearest neighbor (k-NN) algorithm is designed to handle similarity searches that refine a query in multiple iterations utilizing the proposed hybrid query refinement model. Extensive experiments are performed demonstrating an increased relevance of query results in subsequent iterations while incurring a low computational overhead. Further, an evaluation metric, called the Model_Score, is proposed to compare the performance of different retrieval frameworks in terms of both computation overhead and query result relevance. This metric enables the users to choose the retrieval framework appropriate for their requirements.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.