Nnew:图像数据库检索中最近邻加权扩展

Huaxin You, E. Chang, Beitao Li
{"title":"Nnew:图像数据库检索中最近邻加权扩展","authors":"Huaxin You, E. Chang, Beitao Li","doi":"10.1109/ICME.2001.1237685","DOIUrl":null,"url":null,"abstract":"Various systems have been developed for supporting content-based image retrieval. Most systems make very strong assumptions in modeling users’ query concepts. However, since the information need of users can be very diverse, these assumptions may not always hold and hence can lead to poor search results. For instance, if a system assumes that the query-concept is convex but a user issues a disjunctive query, and vice versa, the search result cannot be satisfactory. In this study, we propose a method that can approximate more complex (non-convex and disjunctive) query concepts. Our method uses intelligent modeling and learning to increase query speed and accuracy. Empirical results show that our method converges consistently faster than some traditional approaches on different datasets.","PeriodicalId":405589,"journal":{"name":"IEEE International Conference on Multimedia and Expo, 2001. ICME 2001.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Nnew: nearest neighbor expansion by weighting in image database retrieval\",\"authors\":\"Huaxin You, E. Chang, Beitao Li\",\"doi\":\"10.1109/ICME.2001.1237685\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Various systems have been developed for supporting content-based image retrieval. Most systems make very strong assumptions in modeling users’ query concepts. However, since the information need of users can be very diverse, these assumptions may not always hold and hence can lead to poor search results. For instance, if a system assumes that the query-concept is convex but a user issues a disjunctive query, and vice versa, the search result cannot be satisfactory. In this study, we propose a method that can approximate more complex (non-convex and disjunctive) query concepts. Our method uses intelligent modeling and learning to increase query speed and accuracy. Empirical results show that our method converges consistently faster than some traditional approaches on different datasets.\",\"PeriodicalId\":405589,\"journal\":{\"name\":\"IEEE International Conference on Multimedia and Expo, 2001. ICME 2001.\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Conference on Multimedia and Expo, 2001. ICME 2001.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICME.2001.1237685\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on Multimedia and Expo, 2001. ICME 2001.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICME.2001.1237685","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

已经开发了各种系统来支持基于内容的图像检索。大多数系统在对用户的查询概念建模时都有很强的假设。然而,由于用户的信息需求可能非常多样化,这些假设可能并不总是成立,因此可能导致糟糕的搜索结果。例如,如果系统假设查询概念是凸的,但用户发出了析取查询,反之亦然,则搜索结果不能令人满意。在这项研究中,我们提出了一种可以近似更复杂(非凸和析取)查询概念的方法。我们的方法使用智能建模和学习来提高查询速度和准确性。实验结果表明,在不同的数据集上,我们的方法比传统的方法收敛速度更快。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Nnew: nearest neighbor expansion by weighting in image database retrieval
Various systems have been developed for supporting content-based image retrieval. Most systems make very strong assumptions in modeling users’ query concepts. However, since the information need of users can be very diverse, these assumptions may not always hold and hence can lead to poor search results. For instance, if a system assumes that the query-concept is convex but a user issues a disjunctive query, and vice versa, the search result cannot be satisfactory. In this study, we propose a method that can approximate more complex (non-convex and disjunctive) query concepts. Our method uses intelligent modeling and learning to increase query speed and accuracy. Empirical results show that our method converges consistently faster than some traditional approaches on different datasets.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信