Generating counterfactual negative samples for image-text matching

IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Processing & Management Pub Date : 2024-12-05 DOI:10.1016/j.ipm.2024.103990
Xinqi Su , Dan Song , Wenhui Li , Tongwei Ren , An-An Liu
{"title":"Generating counterfactual negative samples for image-text matching","authors":"Xinqi Su ,&nbsp;Dan Song ,&nbsp;Wenhui Li ,&nbsp;Tongwei Ren ,&nbsp;An-An Liu","doi":"10.1016/j.ipm.2024.103990","DOIUrl":null,"url":null,"abstract":"<div><div>The method of image-text matching typically employs hard triplet loss as its optimization objective to learn coarse correspondences based on object co-occurrence statistics. However, due to insufficiently sampled negative instances, this coarse correspondences not only leads to the model learning biases in semantic co-occurrence but also obscures the model’s understanding of crucial semantic and significant semantic contextual dependencies. In this study, we propose the Generating Feature-level and Relation-level Counterfactual Negative Samples method (GFRN) for image-text matching. This method utilizes prior knowledge and gradients to mask key regions or words to generate feature-level counterfactual negative samples, or disrupts their important contextual dependencies through Bernoulli distributions and self-supervised learning to generate relation-level counterfactual negative samples with sufficient information. Subsequently, we employ these counterfactual samples to construct contrastive triplet losses to enhance the training of the image-text matching model. Consequently, the model’s ability to understand crucial semantic concepts and complex dependency relationships is significantly enhanced, and semantic biases are greatly reduced. Compared to state-of-the-art methods, the proposed GFRN improves rSum by 3.9% on Flickr30K, 2.0% on MSCOCO1K, and 4.8% on MSCOCO5K, with significant improvements in R@1 across all datasets.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 3","pages":"Article 103990"},"PeriodicalIF":7.4000,"publicationDate":"2024-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing & Management","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0306457324003492","RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The method of image-text matching typically employs hard triplet loss as its optimization objective to learn coarse correspondences based on object co-occurrence statistics. However, due to insufficiently sampled negative instances, this coarse correspondences not only leads to the model learning biases in semantic co-occurrence but also obscures the model’s understanding of crucial semantic and significant semantic contextual dependencies. In this study, we propose the Generating Feature-level and Relation-level Counterfactual Negative Samples method (GFRN) for image-text matching. This method utilizes prior knowledge and gradients to mask key regions or words to generate feature-level counterfactual negative samples, or disrupts their important contextual dependencies through Bernoulli distributions and self-supervised learning to generate relation-level counterfactual negative samples with sufficient information. Subsequently, we employ these counterfactual samples to construct contrastive triplet losses to enhance the training of the image-text matching model. Consequently, the model’s ability to understand crucial semantic concepts and complex dependency relationships is significantly enhanced, and semantic biases are greatly reduced. Compared to state-of-the-art methods, the proposed GFRN improves rSum by 3.9% on Flickr30K, 2.0% on MSCOCO1K, and 4.8% on MSCOCO5K, with significant improvements in R@1 across all datasets.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
Information Processing & Management
Information Processing & Management 工程技术-计算机:信息系统
CiteScore
17.00
自引率
11.60%
发文量
276
审稿时长
39 days
期刊介绍: Information Processing and Management is dedicated to publishing cutting-edge original research at the convergence of computing and information science. Our scope encompasses theory, methods, and applications across various domains, including advertising, business, health, information science, information technology marketing, and social computing. We aim to cater to the interests of both primary researchers and practitioners by offering an effective platform for the timely dissemination of advanced and topical issues in this interdisciplinary field. The journal places particular emphasis on original research articles, research survey articles, research method articles, and articles addressing critical applications of research. Join us in advancing knowledge and innovation at the intersection of computing and information science.
期刊最新文献
Effective near-duplicate image detection using perceptual hashing and deep learning Improving cross-document event coreference resolution by discourse coherence and structure Injecting new insights: How do review sentiment and rating inconsistency shape the helpfulness of airline reviews? Exploring hate speech dynamics: The emotional, linguistic, and thematic impact on social media users Leveraging LLMs for action item identification in Urdu meetings: Dataset creation and comparative analysis
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1