Global-local fusion based on adversarial sample generation for image-text matching

匹配(统计) 相似性(几何) 计算机科学 人工智能 对抗制 图像(数学) 样品(材料) 鉴定(生物学) 模式识别(心理学) 认知 相似性度量 机器学习 数学 统计 心理学 化学 植物 色谱法 神经科学 生物
作者
Shichen Huang,Weina Fu,Zhaoyue Zhang,Shuai Liu
出处
期刊:Information Fusion [Elsevier]
卷期号:103: 102084-102084 被引量:3
标识
DOI:10.1016/j.inffus.2023.102084
摘要

In the increasingly popular era of adversarial machine learning (AML), developing more robust and generalized algorithms has become a key research topic. Image-text matching as the foundation of tasks such as video Q&A and text-image generation also faces various attacks in AML. Current image-text matching based on the similarity of matching fragments only focuses on the local matching results, which does not establish a comprehensive cognition of content in text and image. Therefore, mismatching in the abstract scene appears when facing complex attacks. At the same time, existing methods are not sensitive enough to identify the internal relationship between objects in different local areas, which also confuse matching. Therefore, aiming at the above problems, a global similarity matching module is proposed. Based on global cognition, a global similarity matching is established, which is dynamically fused with local similarity to measure the matching results flexibly and improve the understanding of abstract scenes. At the same time, a global-local cognition fusion training mechanism based on relationship adversarial sample generation is proposed. Enhance understanding of internal relationships between objects in different local area through adversarial sample generation. Global loss was introduced to train the overall model, and adjusting the proportion of global-local in the training process through loss adjustment to better identified the relationships between objects in different local areas and avoided confusion and matching caused by the similarity of matching objects. The experimental results show that our method on the Flickr30K dataset is 7.4% (rSum) better than the current best method, and on the MS-COCO dataset is 4.0% (rSum using the 1K test set) better than the current best method. The proposed global-local fusion (GLF) based on adversarial sample generation for image-text matching algorithm improves the accuracy and robustness of image-text matching performs well in facing some security challenges. At the same time, promotes the development of visual and linguistic modal fusion.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
无花果应助澜冰采纳,获得10
1秒前
跳跃的访琴完成签到 ,获得积分10
1秒前
小刘完成签到,获得积分10
1秒前
bin8完成签到,获得积分10
2秒前
5秒前
搜集达人应助十六月亮采纳,获得10
7秒前
dfgh完成签到,获得积分10
8秒前
heureux完成签到,获得积分20
11秒前
12秒前
亦萧完成签到,获得积分10
12秒前
忧郁安荷发布了新的文献求助10
12秒前
13秒前
酷波er应助阿修罗采纳,获得10
13秒前
蜗牛完成签到,获得积分10
14秒前
14秒前
16秒前
fuje发布了新的文献求助10
17秒前
17秒前
我们发布了新的文献求助30
18秒前
19秒前
星辰大海应助性静H情逸采纳,获得10
19秒前
luyaowang发布了新的文献求助10
20秒前
鸣蜩阿六发布了新的文献求助10
20秒前
小二郎应助无心的初兰采纳,获得10
21秒前
天下先完成签到,获得积分10
21秒前
科研通AI2S应助白枫采纳,获得10
22秒前
李健应助heureux采纳,获得10
23秒前
呱呱太发布了新的文献求助10
23秒前
23秒前
秋雪瑶应助能干的邹采纳,获得10
23秒前
曲初雪发布了新的文献求助30
24秒前
脑洞疼应助开朗尔冬采纳,获得10
25秒前
安详天川完成签到 ,获得积分10
25秒前
彩虹绵绵冰应助一切都好采纳,获得10
26秒前
轨迹应助一切都好采纳,获得10
26秒前
27秒前
852应助结实的寒梦采纳,获得10
27秒前
阿修罗发布了新的文献求助10
27秒前
Anthony发布了新的文献求助10
28秒前
SOLOMON应助Qiiiiii采纳,获得20
28秒前
高分求助中
【本贴是提醒信息,请勿应助】请在求助之前详细阅读求助说明!!!! 20000
One Man Talking: Selected Essays of Shao Xunmei, 1929–1939 1000
The Three Stars Each: The Astrolabes and Related Texts 900
Yuwu Song, Biographical Dictionary of the People's Republic of China 800
Multifunctional Agriculture, A New Paradigm for European Agriculture and Rural Development 600
Challenges, Strategies, and Resiliency in Disaster and Risk Management 500
Bernd Ziesemer - Maos deutscher Topagent: Wie China die Bundesrepublik eroberte 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2482441
求助须知:如何正确求助?哪些是违规求助? 2144847
关于积分的说明 5471502
捐赠科研通 1867208
什么是DOI,文献DOI怎么找? 928115
版权声明 563073
科研通“疑难数据库(出版商)”最低求助积分说明 496555