{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T12:01:28Z","timestamp":1747224088536,"version":"3.40.5"},"reference-count":23,"publisher":"IGI Global","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7,1]]},"abstract":"<p>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.<\/p>","DOI":"10.4018\/jmdem.2011070104","type":"journal-article","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T16:41:45Z","timestamp":1319042505000},"page":"52-71","source":"Crossref","is-referenced-by-count":0,"title":["Hybrid Query Refinement"],"prefix":"10.4018","volume":"2","author":[{"given":"Kasturi","family":"Chatterjee","sequence":"first","affiliation":[{"name":"Florida International University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9209-390X","authenticated-orcid":true,"given":"Shu-Ching","family":"Chen","sequence":"additional","affiliation":[{"name":"Florida International University, USA"}]}],"member":"2432","reference":[{"key":"jmdem.2011070104-0","unstructured":"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)."},{"issue":"3","key":"jmdem.2011070104-1","first-page":"3","article-title":"Query refinement in similarity retrieval systems.","volume":"24","author":"K.Chakrabarti","year":"2001","journal-title":"A Quarterly Bulletin of the Computer Society of the IEEE Technical Committee on Data Engineering"},{"key":"jmdem.2011070104-2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.1269602"},{"key":"jmdem.2011070104-3","doi-asserted-by":"crossref","unstructured":"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).","DOI":"10.1109\/ISM.2006.21"},{"key":"jmdem.2011070104-4","doi-asserted-by":"publisher","DOI":"10.1142\/S1793351X07000093"},{"key":"jmdem.2011070104-5","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., & Chen, S.-C. (2008). GeM-tree: Towards a generalized multidimensional index structure supporting image and video retrieval. In Proceedings of the Fourth IEEE International Workshop on Multimedia Information Processing and Retrieval in conjunction with the IEEE International Symposium on Multimedia (pp. 631-636).","DOI":"10.1109\/ISM.2008.96"},{"key":"jmdem.2011070104-6","unstructured":"Ciaccia, P., Patella, M., & Zezula, P. (1997). M-tree: An efficient access method for similarity search in metric spaces. In Proceedings of the 23rd Very Large Data Bases International Conference (pp. 426-435)."},{"key":"jmdem.2011070104-7","doi-asserted-by":"crossref","unstructured":"Daneels, D., Campenhout, D., Niblack, W., Equitz, W., Barber, R., Bellon, E., et al. (1993). Interactive outlining: An improved approach using contours. In Proceedings of the Storage and Retrieval for Image and Video Databases (pp. 226-233).","DOI":"10.1117\/12.143652"},{"key":"jmdem.2011070104-8","doi-asserted-by":"crossref","unstructured":"Guttman, A. (1984). R-trees: A dynamic index structure for spatial searching. In Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 47-57).","DOI":"10.1145\/971697.602266"},{"key":"jmdem.2011070104-9","unstructured":"Huang, T., & Rui, Y. (1997). Image retrieval: Past, present, and future. In Proceedings of the International Symposium on Multimedia Information Processing."},{"key":"jmdem.2011070104-10","unstructured":"Ishikawa, Y., Subramanya, R., & Faloutsos, C. (1998). MindReader: Querying databases through multiple examples. In Proceedings of the 24th International Conference of Very Large Data Bases (pp. 218-227)."},{"key":"jmdem.2011070104-11","doi-asserted-by":"crossref","unstructured":"Liu, D., Hua, K., & Yu, N. (2006). Fast query point movement techniques with relevance feedback for content-based image retrieval. In Proceedings of the International Conference on Extending Data Base Technology (pp. 700-717).","DOI":"10.1007\/11687238_42"},{"key":"jmdem.2011070104-12","doi-asserted-by":"crossref","unstructured":"Lu, J., Bao, Z., Ling, T. W., & Meng, X. (2009). XML keyword query refinement. In Proceedings of the First International Workshop on Keyword Search on Structured Data (pp. 41-42).","DOI":"10.1145\/1557670.1557685"},{"key":"jmdem.2011070104-13","doi-asserted-by":"publisher","DOI":"10.1109\/69.738357"},{"key":"jmdem.2011070104-14","doi-asserted-by":"crossref","unstructured":"Porkaew, K., Chakrabarti, K., & Mehrotra, S. (1999). Query refinement for multimedia similarity retrieval in MARS. In Proceedings of the ACM Multimedia Conference (pp. 235-238).","DOI":"10.1145\/319463.319613"},{"key":"jmdem.2011070104-15","doi-asserted-by":"crossref","unstructured":"Porkaew, K., Ortega, M., & Mehrotra, S. (1999). Query reformulation for content based multimedia retrieval in MARS. In Proceedings of the IEEE International Conference on Multimedia Computing and Systems (pp. 747-751).","DOI":"10.1109\/MMCS.1999.778578"},{"key":"jmdem.2011070104-16","unstructured":"Reynolds, D., Dickinson, I., & Grosvenor, D. (2009). A query refinement model for exploratory semantic search (Tech. Rep. No. HPL-2009-167). Palo Alto, CA: HP Laboratories."},{"key":"jmdem.2011070104-17","doi-asserted-by":"crossref","unstructured":"Robinson, J. T. (1981). The K-D-B-tree: A search structure for large multidimensional dynamic indexes. In Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 10-18).","DOI":"10.1145\/582318.582321"},{"key":"jmdem.2011070104-18","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., & Vincent, F. (1995). Nearest neighbor queries. In Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 71-79).","DOI":"10.1145\/568271.223794"},{"key":"jmdem.2011070104-19","doi-asserted-by":"crossref","unstructured":"Rui, Y., Huang, T., & Mehrotra, S. (1997). Content based image retrieval with relevance feedback in mars. In Proceedings of the International Conference on Image Processing (pp. 815-818).","DOI":"10.1109\/ICIP.1997.638621"},{"key":"jmdem.2011070104-20","doi-asserted-by":"publisher","DOI":"10.1109\/76.718510"},{"key":"jmdem.2011070104-21","doi-asserted-by":"crossref","unstructured":"Shyu, M.-L., Chen, S.-C., Chen, M., Zhang, C., & Shu, C.-M. (2003). MMM: A stochastic mechanism for image database queries. In Proceedings of the IEEE Fifth International Symposium on Multimedia Software Engineering, Taichung, Taiwan (pp. 188-195).","DOI":"10.1109\/MMSE.2003.1254441"},{"key":"jmdem.2011070104-22","unstructured":"Yianilos, P. N. (1993). Data structures and algorithms for nearest neighbor search in general metric spaces. In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 311-321)."}],"container-title":["International Journal of Multimedia Data Engineering and Management"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=58051","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T14:34:34Z","timestamp":1654094074000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jmdem.2011070104"}},"subtitle":["A Strategy for a Distance Based Index Structure to Refine Multimedia Queries"],"short-title":[],"issued":{"date-parts":[[2011,7,1]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,7]]}},"URL":"https:\/\/doi.org\/10.4018\/jmdem.2011070104","relation":{},"ISSN":["1947-8534","1947-8542"],"issn-type":[{"type":"print","value":"1947-8534"},{"type":"electronic","value":"1947-8542"}],"subject":[],"published":{"date-parts":[[2011,7,1]]}}}