Dynamic Gated Graph Neural Networks for Scene Graph Generation

被引:1
作者
Khademi, Mahmoud [1 ]
Schulte, Oliver [1 ]
机构
[1] Simon Fraser Univ, Burnaby, BC, Canada
来源
COMPUTER VISION - ACCV 2018, PT VI | 2019年 / 11366卷
关键词
Gated Graph Neural Networks; Scene graph generation;
D O I
10.1007/978-3-030-20876-9_42
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We describe a new deep generative architecture, called Dynamic Gated Graph Neural Networks (D-GGNN), for extracting a scene graph for an image, given a set of bounding-box proposals. A scene graph is a visually-grounded digraph for an image, where the nodes represent the objects and the edges show the relationships between them. Unlike the recently proposed Gated Graph Neural Networks (GGNN), the D-GGNN can be applied to an input image when only partial relationship information, or none at all, is known. In each training episode, the D-GGNN sequentially builds a candidate scene graph for a given training input image and labels additional nodes and edges of the graph. The scene graph is built using a deep reinforcement learning framework: states are partial graphs, encoded using a GGNN, actions choose labels for node and edges, and rewards measure the match between the ground-truth annotations in the data and the labels assigned at a point in the search. Our experimental results outperform the state-of-the-art results for scene graph generation task on the Visual Genome dataset.
引用
收藏
页码:669 / 685
页数:17
相关论文
共 36 条
[1]  
Allamanis M., 2018, Learning to represent programs with graphs
[2]  
[Anonymous], P 3 INT C LEARNING R
[3]  
[Anonymous], 2017, ADV NEURAL INFORM PR
[4]  
[Anonymous], 2015, ARXIV, DOI DOI 10.48550/ARXIV.1504.08083
[5]  
[Anonymous], ABS160905600 CORR
[6]  
[Anonymous], ABS160303925 CORR
[7]  
[Anonymous], 2015, PROC CVPR IEEE
[8]  
[Anonymous], ADV NEURAL INFORM PR, DOI DOI 10.1109/TPAMI.2016.2577031
[9]  
[Anonymous], ADV NEURAL INFORM PR
[10]  
[Anonymous], 2014, ABS14114555 CORR