Relationship-Incremental Scene Graph Generation by a Divide-and-Conquer Pipeline With Feature Adapter

Xuewei Li;Guangcong Zheng;Yunlong Yu;Naye Ji;Xi Li
{"title":"Relationship-Incremental Scene Graph Generation by a Divide-and-Conquer Pipeline With Feature Adapter","authors":"Xuewei Li;Guangcong Zheng;Yunlong Yu;Naye Ji;Xi Li","doi":"10.1109/TIP.2024.3384096","DOIUrl":null,"url":null,"abstract":"As a challenging computer vision task, Scene Graph Generation (SGG) finds the latent semantic relationships among objects from a given image, which may be limited by the datasets and real-world scenarios. In this paper, we consider a novel incremental learning task called Relationship-Incremental Scene Graph Generation (RISGG) that learns the semantic relationships among objects in an incremental way. Compared with classic Class-Incremental Learning (CIL) problem, RISGG suffers from its special issues: 1) Old class shift – the relationship-labeled object pair may have different labels during different learning sessions; 2) Background shift – the relationship-unlabeled object pair may not be a real unlabeled one. In this work, we address the above issues from the following aspects. First, we present a Divide-and-Conquer (DaC) pipeline to deal with the old class shift via decoupling the recognition of relationship classes and recognizing relationships individually. In this way, label confusion and interaction among different relationships are eliminated during training. Second, we propose a Feature Adapter (FA) to bridge the feature space gap between the current session and the previous one and use our extra supervision to mine old relationship information in the current session. Our proposed network combined DaC and FA, abbreviated DaCFA-Net, for RISGG. Experimental results on the benchmark dataset demonstrate the significant performance gain of DaCFA-Net in RISGG. It gains about 20% improvement against the SGG baselines on the popular VG dataset.","PeriodicalId":94032,"journal":{"name":"IEEE transactions on image processing : a publication of the IEEE Signal Processing Society","volume":"34 ","pages":"678-688"},"PeriodicalIF":13.7000,"publicationDate":"2024-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE transactions on image processing : a publication of the IEEE Signal Processing Society","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10494694/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

As a challenging computer vision task, Scene Graph Generation (SGG) finds the latent semantic relationships among objects from a given image, which may be limited by the datasets and real-world scenarios. In this paper, we consider a novel incremental learning task called Relationship-Incremental Scene Graph Generation (RISGG) that learns the semantic relationships among objects in an incremental way. Compared with classic Class-Incremental Learning (CIL) problem, RISGG suffers from its special issues: 1) Old class shift – the relationship-labeled object pair may have different labels during different learning sessions; 2) Background shift – the relationship-unlabeled object pair may not be a real unlabeled one. In this work, we address the above issues from the following aspects. First, we present a Divide-and-Conquer (DaC) pipeline to deal with the old class shift via decoupling the recognition of relationship classes and recognizing relationships individually. In this way, label confusion and interaction among different relationships are eliminated during training. Second, we propose a Feature Adapter (FA) to bridge the feature space gap between the current session and the previous one and use our extra supervision to mine old relationship information in the current session. Our proposed network combined DaC and FA, abbreviated DaCFA-Net, for RISGG. Experimental results on the benchmark dataset demonstrate the significant performance gain of DaCFA-Net in RISGG. It gains about 20% improvement against the SGG baselines on the popular VG dataset.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过带有特征适配器的分而治之流水线生成关系递增场景图
作为一项具有挑战性的计算机视觉任务,场景图生成(Scene Graph Generation, SGG)从给定图像中发现对象之间的潜在语义关系,这可能受到数据集和现实场景的限制。在本文中,我们考虑了一种新的增量学习任务,称为关系增量场景图生成(RISGG),它以增量的方式学习对象之间的语义关系。与经典的类增量学习(class - incremental Learning, CIL)问题相比,RISGG存在以下问题:1)旧类转移——关系标记的对象对在不同的学习阶段可能具有不同的标签;2)背景移位-关系未标记的对象对可能不是真正的未标记对象对。在这项工作中,我们从以下几个方面来解决上述问题。首先,我们提出了一个分而治之(DaC)管道,通过分离关系类的识别和单独识别关系来处理旧的类转移。这样就消除了训练过程中不同关系之间的标签混淆和交互。其次,我们提出了一个特征适配器(FA)来弥合当前会话和前一个会话之间的特征空间差距,并使用我们的额外监督来挖掘当前会话中的旧关系信息。我们提出的RISGG网络结合了DaC和FA,缩写为DaCFA-Net。在基准数据集上的实验结果表明,DaCFA-Net在RISGG中获得了显著的性能提升。与流行的VG数据集上的SGG基线相比,它获得了大约20%的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Sharpness-aware Fine-Tuning for OOD Detection. Match Any Keypoints. USIGAN: Unbalanced Self-Information Feature Transport for Weakly Paired Image IHC Virtual Staining. JDPNet: A Network Based on Joint Degradation Processing for Underwater Image Enhancement Long-Tailed and Inter-Class Homogeneity Matters in Multi-Class Weakly Supervised Tissue Segmentation of Histopathology Images
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1