首页> 外文会议>Pacific-Rim Conference on Multimedia >Unsupervised Cross-Modal Hashing with Soft Constraint
【24h】

Unsupervised Cross-Modal Hashing with Soft Constraint

机译:无监督的跨模型散列与软限制

获取原文

摘要

The booming demands for cross-modal retrieval tasks can often bring in its wake the development of retrieval technologies, as people turn to pursuing a more effective way to improve the performance of search results in both accuracy and efficiency, for example by unsupervised cross-modal hashing. It's worth noting that most of the cross-modal hashing methods focus on utilizing merely one approach to generate hash codes. However, each approach has its own intrinsic drawback, which would inevitably diminish the quality of hash codes. In this paper, we propose a state-of-the-art model named Soft Constraint Hashing (SCH), using a special soft constraint term defined as an "information tunnel" to achieve the goal that conveys information from one approach to another. In particular, this "tunnel" can eliminate potential data noises to some extent and bridge the gap between two unsupervised discrete hashing allocation approaches to simultaneously reinforce the quality of hash codes. The empirical results on publicly available datasets illustrate that our proposed model outperforms all the existing unsupervised cross-model hashing methods.
机译:跨模型检索任务的蓬勃发展需求往往可以引起检索技术的发展,因为人们转向追求更有效的方法来提高搜索的性能,例如通过无监督的交叉模态哈希。值得注意的是,大多数跨模型散列方法都专注于利用一种方法来产生散列代码。然而,每个方法都有自己的内在缺点,这将不可避免地减少哈希代码的质量。在本文中,我们提出了名为Soft Currentraint Hashing(SCH)的最先进的模型,使用特殊的软约束项定义为“信息隧道”,以实现从一种方法传递给另一个方法的信息。特别是,这种“隧道”可以在某种程度上消除潜在的数据噪声并弥合两个无监督的离散散列分配方法之间的差距,以同时增强散列码的质量。公开数据集的经验结果表明我们所提出的模型优于所有现有无监督的跨模型散列方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号