Graph Convolutional Network Discrete Hashing for Cross-Modal Retrieval

散列函数 计算机科学 特征哈希 卷积神经网络 理论计算机科学 人工智能 图形 模式识别(心理学) 嵌入 哈希表 机器学习 数据挖掘 双重哈希 计算机安全
作者
Cong Bai,Chao Zeng,Qing Ma,Jinglin Zhang
出处
期刊:IEEE transactions on neural networks and learning systems [Institute of Electrical and Electronics Engineers]
卷期号:35 (4): 4756-4767 被引量:57
标识
DOI:10.1109/tnnls.2022.3174970
摘要

With the rapid development of deep neural networks, cross-modal hashing has made great progress. However, the information of different types of data is asymmetrical, that is to say, if the resolution of an image is high enough, it can reproduce almost 100% of the real-world scenes. However, text usually carries personal emotion and it is not objective enough, so we generally think that the information of image will be much richer than text. Although most of the existing methods unify the semantic feature extraction and hash function learning modules for end-to-end learning, they ignore this issue and do not use information-rich modalities to support information-poor modalities, leading to suboptimal results, although they unify the semantic feature extraction and hash function learning modules for end-to-end learning. Furthermore, previous methods learn hash functions in a relaxed way that causes nontrivial quantization losses. To address these issues, we propose a new method called graph convolutional network (GCN) discrete hashing. This method uses a GCN to bridge the information gap between different types of data. The GCN can represent each label as word embedding, with the embedding regarded as a set of interdependent object classifiers. From these classifiers, we can obtain predicted labels to enhance feature representations across modalities. In addition, we use an efficient discrete optimization strategy to learn the discrete binary codes without relaxation. Extensive experiments conducted on three commonly used datasets demonstrate that our proposed method graph convolutional network-based discrete hashing (GCDH) outperforms the current state-of-the-art cross-modal hashing methods.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
Copyright应助Zhi采纳,获得10
刚刚
qfchen0716网易完成签到,获得积分10
1秒前
明理映真完成签到,获得积分20
3秒前
3秒前
VDC发布了新的文献求助200
4秒前
5秒前
嘟嘟图图发布了新的文献求助10
7秒前
踏实的飞风完成签到,获得积分10
8秒前
童童发布了新的文献求助10
9秒前
WhiteSand完成签到,获得积分10
9秒前
跳跃幼荷完成签到,获得积分10
9秒前
elle完成签到,获得积分10
9秒前
10秒前
领导范儿应助Evan采纳,获得10
10秒前
上官若男应助Tiffany采纳,获得10
10秒前
不知道完成签到 ,获得积分10
11秒前
没资源的牛马完成签到,获得积分10
11秒前
明明白白完成签到 ,获得积分10
12秒前
gy79210发布了新的文献求助10
13秒前
13秒前
15秒前
自然小土豆完成签到,获得积分10
15秒前
科目三应助明理映真采纳,获得10
15秒前
汉堡包应助童童采纳,获得10
15秒前
竹前家庆完成签到,获得积分10
16秒前
科研通AI6.4应助Zhi采纳,获得10
16秒前
肘击完成签到,获得积分10
16秒前
Aan发布了新的文献求助10
17秒前
fshadow完成签到,获得积分10
19秒前
xiaoju发布了新的文献求助10
19秒前
传奇3应助奋斗土豆采纳,获得10
20秒前
Biao关注了科研通微信公众号
20秒前
20秒前
摸鱼婧完成签到,获得积分10
22秒前
abc完成签到,获得积分10
22秒前
23秒前
科研通AI6.4应助盲点采纳,获得10
26秒前
mirutio发布了新的文献求助10
26秒前
Evan发布了新的文献求助10
27秒前
CodeCraft应助hearz采纳,获得10
27秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Organic Chemistry, 5th Edition 1000
Handbook of Social Psychology and Consumer Behavior 900
Nondestructive Testing Handbook: Vol. 4, Thermal and Infrared Testing (IR), 4th ed 800
日本現代怪異事典 副読本 700
Handbook of Social Identity Research 600
作者名:Kristopher P. Plain,悉尼大学的,目前只能查到其四篇论文,想找到其博士论文 590
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7375225
求助须知:如何正确求助?哪些是违规求助? 8982914
关于积分的说明 19099643
捐赠科研通 7015999
什么是DOI,文献DOI怎么找? 3225849
关于科研通互助平台的介绍 2389141
邀请新用户注册赠送积分活动 2206491