首页> 外文会议>International conference on artificial intelligence >A Fast Quantization Tree Based Image Retrieval Method
【24h】

A Fast Quantization Tree Based Image Retrieval Method

机译:基于快速量化树的图像检索方法

获取原文

摘要

Traditional content-based image retrieval technology expresses the content of each image by feature vectors. Then image retrieval process begins by calculating the similarity between the image to search and the images in the database in terms of the corresponding feature vectors, next ranks the images in the database by a descending order of similarity, and finally outputs the desired top ones. This method shows good accuracy and high efficiency when the image databases are not very big. For modern large image databases, however, these methods will not satisfy users' requirements for retrieval time and accuracy. To meet these challenges, in this paper, a new content-based image retrieval method is proposed which is similar to the Scalable Vocabulary Tree image retrieval method but with important variations. Experimental results show our method can more efficiently deal with larger image databases while with similar retrieval accuracy.
机译:传统的基于内容的图像检索技术通过特征向量来表示每个图像的内容。然后,图像检索过程开始于根据相应的特征向量计算要搜索的图像与数据库中的图像之间的相似度,然后按相似度从高到低的顺序对数据库中的图像进行排名,最后输出所需的顶部图像。当图像数据库不是很大时,该方法显示出良好的准确性和高效率。但是,对于现代大图像数据库,这些方法将无法满足用户对检索时间和准确性的要求。为了应对这些挑战,本文提出了一种新的基于内容的图像检索方法,该方法类似于可伸缩词汇树图像检索方法,但有重要的变化。实验结果表明,我们的方法可以更有效地处理较大的图像数据库,同时具有相似的检索精度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号