论文标题

平衡场景的双重RESGCN Graphgerator

Dual ResGCN for Balanced Scene GraphGeneration

论文作者

Zhang, Jingyi, Zhang, Yong, Wu, Baoyuan, Fan, Yanbo, Shen, Fumin, Shen, Heng Tao

论文摘要

视觉场景图生成是一项具有挑战性的任务。以前的作品取得了长足的进步,但是其中大多数没有明确考虑场景图生成中的类不平衡问题。在没有考虑类不平衡的情况下学习的模型倾向于预测多数类,这会导致在微不足道的频繁谓词方面表现良好,但在内容丰富的不经常谓词方面的性能较差。但是,少数族类的谓词通常具有更多的语义和精确信息〜(\ textit {e.g。},\ emph {`on'} v.s \ emph {`parted on'})。 %导致召回良好,但得分很差。为了减轻类不平衡的影响,我们提出了一个新型模型,称为\ textit {dual resgcn},该模型由对象残留图卷积网络和关系残留图形卷积网络组成。这两个网络彼此互补。前者捕获对象级上下文信息,\ textit {i。,}对象之间的连接。我们提出了一种新颖的RESGCN,以交叉注意的方式增强对象特征。此外,我们堆叠多个上下文系数,以减轻不平衡问题并丰富预测多样性。后者经过精心设计,以明确捕获关系级上下文信息\ textit {i.e。,}关系之间的连接。我们建议将有关关系对的同时存在的先验结合到图中,以进一步帮助减轻阶级不平衡问题。对大规模数据库VG进行了三个任务的广泛评估,以证明该方法的优越性。

Visual scene graph generation is a challenging task. Previous works have achieved great progress, but most of them do not explicitly consider the class imbalance issue in scene graph generation. Models learned without considering the class imbalance tend to predict the majority classes, which leads to a good performance on trivial frequent predicates, but poor performance on informative infrequent predicates. However, predicates of minority classes often carry more semantic and precise information~(\textit{e.g.}, \emph{`on'} v.s \emph{`parked on'}). % which leads to a good score of recall, but a poor score of mean recall. To alleviate the influence of the class imbalance, we propose a novel model, dubbed \textit{dual ResGCN}, which consists of an object residual graph convolutional network and a relation residual graph convolutional network. The two networks are complementary to each other. The former captures object-level context information, \textit{i.e.,} the connections among objects. We propose a novel ResGCN that enhances object features in a cross attention manner. Besides, we stack multiple contextual coefficients to alleviate the imbalance issue and enrich the prediction diversity. The latter is carefully designed to explicitly capture relation-level context information \textit{i.e.,} the connections among relations. We propose to incorporate the prior about the co-occurrence of relation pairs into the graph to further help alleviate the class imbalance issue. Extensive evaluations of three tasks are performed on the large-scale database VG to demonstrate the superiority of the proposed method.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源