Hybrid Query Refinement

Author:

Chatterjee Kasturi1,Chen Shu-Ching1

Affiliation:

1. Florida International University, USA

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.

Publisher

IGI Global

Reference23 articles.

1. Berchtold, S., & Keim, D. A. (1996). The X-tree: An index structure for high-dimensional data. In Proceedings of the 22th International Conference on Very Large Data Bases (pp. 28-39).

2. Query refinement in similarity retrieval systems.;K.Chakrabarti;A Quarterly Bulletin of the Computer Society of the IEEE Technical Committee on Data Engineering,2001

3. Evaluating refined queries in top-k retrieval systems

4. Chatterjee, K., & Chen, S.-C. (2006). Affinity hybrid tree: An indexing technique for content-based image retrieval in multimedia databases. In Proceedings of the IEEE International Symposium on Multimedia, San Diego, CA (pp. 47-54).

5. A NOVEL INDEXING AND ACCESS MECHANISM USING AFFINITY HYBRID TREE FOR CONTENT-BASED IMAGE RETRIEVAL IN MULTIMEDIA DATABASES

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3