...
首页> 外文期刊>Information Sciences: An International Journal >Improving bag-of-visual-words image retrieval with predictive clustering trees
【24h】

Improving bag-of-visual-words image retrieval with predictive clustering trees

机译:预测性聚类树改善视觉词袋图像检索

获取原文
获取原文并翻译 | 示例

摘要

The recent overwhelming increase in the amount of available visual information, especially digital images, has brought up a pressing need to develop efficient and accurate systems for image retrieval. State-of-the-art systems for image retrieval use the bag-of-visual-words representation of images. However, the computational bottleneck in all such systems is the construction of the visual codebook, i.e., obtaining the visual words. This is typically performed by clustering hundreds of thousands or millions of local descriptors, where the resulting clusters correspond to visual words. Each image is then represented by a histogram of the distribution of its local descriptors across the codebook. The major issue in retrieval systems is that by increasing the sizes of the image databases, the number of local descriptors to be clustered increases rapidly: Thus, using conventional clustering techniques is infeasible. Considering this, we propose to construct the visual codebook by using predictive clustering trees (PCTs), which can be constructed and executed efficiently and have good predictive performance. Moreover, to increase the stability of the model, we propose to use random forests of predictive clustering trees. We create a random forest of PCTs that represents both the codebook and the indexing structure. We evaluate the proposed improvement of the bag-of-visual-words approach on three reference datasets and two additional datasets of 100 K images and 1 M images, compare it to two state-of-the-art methods based on approximate k-means and extremely randomized tree ensembles. The results reveal that the proposed method produces a visual codebook with superior discriminative power and thus better retrieval performance while maintaining excellent computational efficiency. (C) 2015 Elsevier Inc. All rights reserved.
机译:最近可用视觉信息,尤其是数字图像的大量增加,迫切需要开发有效和准确的图像检索系统。最新的图像检索系统使用图像的视觉词袋表示。但是,所有这些系统中的计算瓶颈是视觉码本的构造,即获得视觉单词。这通常是通过群集成千上万或数百万的本地描述符来执行的,其中生成的群集对应于视觉单词。然后,每个图像由其本地描述符在代码簿中分布的直方图表示。检索系统中的主要问题是,通过增加图像数据库的大小,要聚类的本地描述符的数量迅速增加:因此,使用常规聚类技术是不可行的。考虑到这一点,我们建议使用预测聚类树(PCT)构造可视码本,该聚类树可以有效地构建和执行,并具有良好的预测性能。此外,为了提高模型的稳定性,我们建议使用预测性聚类树的随机森林。我们创建一个代表代码簿和索引结构的PCT随机森林。我们对三个参考数据集和两个额外的100 K图像和1 M图像数据集评估了视觉袋方法的改进建议,并将其与基于近似k均值的两种最新方法进行了比较以及非常随机的树乐团。结果表明,所提出的方法产生了具有较高判别能力的可视码本,因此在保持出色的计算效率的同时具有更好的检索性能。 (C)2015 Elsevier Inc.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号