亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

Deep Hierarchy-Aware Proxy Hashing With Self-Paced Learning for Cross-Modal Retrieval

计算机科学 散列函数 情态动词 人工智能 等级制度 情报检索 理论计算机科学 数据挖掘 市场经济 计算机安全 经济 化学 高分子化学
作者
Yadong Huo,Qibing Qin,Wenfeng Zhang,Lei Huang,Jie Nie
出处
期刊:IEEE Transactions on Knowledge and Data Engineering [IEEE Computer Society]
卷期号:36 (11): 5926-5939 被引量:42
标识
DOI:10.1109/tkde.2024.3401050
摘要

Due to its low storage cost and high retrieval efficiency, hashing technology is popularly applied in both academia and industry, which provides an interesting solution for cross-modal similarity retrieval. However, most existing supervised cross-modal hashing methods typically view the fixed-level semantic affinity defined by manual labels as supervised signals to guide hash learning, which only represents a small subset of complex semantic relations between multi-modal samples, thus impeding the hash function learning and degrading the obtained hash codes. In the paper, by learning shared hierarchy proxies, a novel deep cross-modal hashing framework, called Deep Hierarchy-aware Proxy Hashing (DHaPH), is proposed to construct the semantic hierarchy in a data-driven manner, thereby capturing the accurate fine-grained semantic relationships and achieving small intra-class scatter and big inter-class scatter. Specifically, by regarding the hierarchical proxies as learnable ancestors, a novel hierarchy-aware proxy loss is designed to model the latent semantic hierarchical structures from different modalities without prior hierarchy knowledge, in which similar samples share the same Lowest Common Ancestor (LCA) and dissimilar points have different LCA. Meanwhile, to adequately capture valuable semantic information from hard pairs, a multi-modal self-paced loss is introduced into cross-modal hashing to reweight multi-modal pairs dynamically, which enables the model to gradually focus on hard pairs while simultaneously learning universal patterns from multi-modal pairs. Extensive experiments on three available benchmark databases demonstrate that our proposed DHaPH framework outperforms the compared baselines with different evaluation metrics. The corresponding code is available at https://github.com/QinLab-WFU/DHaPH .
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
橘子发布了新的文献求助10
刚刚
任雨净完成签到 ,获得积分10
7秒前
12秒前
十亩间发布了新的文献求助10
18秒前
坚强的钻石完成签到,获得积分10
18秒前
慕青应助十亩间采纳,获得10
23秒前
30秒前
41秒前
细腻友安发布了新的文献求助10
47秒前
closer完成签到 ,获得积分10
51秒前
53秒前
矩阵新解完成签到 ,获得积分10
53秒前
newplexx完成签到,获得积分10
1分钟前
三心草完成签到 ,获得积分10
1分钟前
1分钟前
1分钟前
1分钟前
高强发布了新的文献求助10
1分钟前
安静成仁完成签到,获得积分10
1分钟前
niufuking完成签到,获得积分10
1分钟前
CodeCraft应助高强采纳,获得10
1分钟前
1分钟前
扶摇完成签到,获得积分10
1分钟前
要减肥的莺完成签到 ,获得积分10
1分钟前
1分钟前
1分钟前
桐桐应助xxxxh采纳,获得10
1分钟前
扶摇发布了新的文献求助10
1分钟前
1分钟前
Kao应助科研通管家采纳,获得10
1分钟前
傲娇断天完成签到,获得积分10
1分钟前
1分钟前
小叶曲发布了新的文献求助10
1分钟前
仁爱糖豆完成签到 ,获得积分10
2分钟前
2分钟前
艾米发布了新的文献求助10
2分钟前
2分钟前
2分钟前
淋雨不好发布了新的文献求助10
2分钟前
2分钟前
高分求助中
Markov Chain Monte Carlo 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Common Foundations of American and East Asian Modernisation: From Alexander Hamilton to Junichero Koizumi 5000
Pediatric Dermoscopy Trichoscopy & Onychoscopy 1000
悉尼大学博士学位论文,题目:Modelling and testing of one-sided stitched laminated composites. 作者:Kristopher P. Plain 700
Matrix Methods in Data Mining and Pattern Recognition Second Edition 610
International Security Studies and Technology :Approaches, Assessments, and Frontiers 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7571662
求助须知:如何正确求助?哪些是违规求助? 9151179
关于积分的说明 19572838
捐赠科研通 7156621
什么是DOI,文献DOI怎么找? 3264050
关于科研通互助平台的介绍 2429392
邀请新用户注册赠送积分活动 2254231