CLCVMar 25, 2018

Scene Graph Parsing as Dependency Parsing

arXiv:1803.09189v11111 citations
Originality Incremental advance
AI Analysis

This work improves scene graph parsing for vision and language applications, though it is incremental as it builds on prior dependency parsing methods.

The paper tackles the problem of parsing scene graphs from text by reformulating it as dependency parsing, enabling end-to-end training and achieving a 49.67% F-score similarity to ground truth, which surpasses previous approaches by 5%.

In this paper, we study the problem of parsing structured knowledge graphs from textual descriptions. In particular, we consider the scene graph representation that considers objects together with their attributes and relations: this representation has been proved useful across a variety of vision and language applications. We begin by introducing an alternative but equivalent edge-centric view of scene graphs that connect to dependency parses. Together with a careful redesign of label and action space, we combine the two-stage pipeline used in prior work (generic dependency parsing followed by simple post-processing) into one, enabling end-to-end training. The scene graphs generated by our learned neural dependency parser achieve an F-score similarity of 49.67% to ground truth graphs on our evaluation set, surpassing best previous approaches by 5%. We further demonstrate the effectiveness of our learned parser on image retrieval applications.

Code Implementations2 repos
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes