【24h】

Effective and efficient indexing in cross-modal hashing-based datasets

机译:基于跨模型散列的数据集有效和高效的索引

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

摘要

To overcome the barrier of storage and computation, the hashing technique has been widely used for nearest neighbor search in multimedia retrieval applications recently. Particularly, cross-modal retrieval that searches across different modalities becomes an active but challenging problem. Although numerous of cross-modal hashing algorithms are proposed to yield compact binary codes, exhaustive search is impractical for large-scale datasets, and Hamming distance computation suffers inaccurate results. In this paper, we propose a novel search method that utilizes a probability-based index scheme over binary hash codes in cross-modal retrieval. The proposed indexing scheme employs a few binary bits from the hash code as the index code. We construct an inverted index table based on the index codes, and train a neural network for ranking and indexing to improve the retrieval accuracy. Experiments are performed on two benchmark datasets for retrieval across image and text modalities, where hash codes are generated and compared with several state-of-the-art cross-modal hashing methods. Results show the proposed method effectively boosts the performance on search accuracy, computation cost, and memory consumption in these datasets and hashing methods. The source code is available on https://github.com/msarawut/HCI.
机译:为了克服存储和计算的屏障,最近已经广泛用于多媒体检索应用中的最近邻居搜索的散列技术。特别地,跨越不同方式搜索的跨模型检索成为一个有效但具有挑战性的问题。尽管提出了许多跨模型散列算法来产生紧凑的二进制代码,但大规模数据集的详尽搜索是不切实际的,并且汉明距离计算遭受不准确的结果。在本文中,我们提出了一种新的搜索方法,该方法利用基于概率的索引散列码在跨模型检索中的二进制哈希代码。所提出的索引方案从哈希码中使用一些二进制位作为索引代码。我们构建基于索引代码的反向索引表,并培训一个神经网络进行排序和索引以提高检索精度。在两个基准数据集上执行实验,用于跨图像和文本方式检索,其中生成哈希代码并与若干先前的跨模型散列方法进行比较。结果显示,所提出的方法有效地提高了这些数据集和散列方法中的搜索精度,计算成本和内存消耗的性能。源代码在https://github.com/msarawut/hci上提供。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号