Exploring the Hierarchy in Relation Labels for Scene Graph Generation
Not on the map. Why?
Abstract (arXiv)
By assigning each relationship a single label, current approaches formulate the relationship detection as a classification problem. Under this formulation, predicate categories are treated as completely different classes. However, different from the object labels where different classes have explicit boundaries, predicates usually have overlaps in their semantic meanings. For example, siton and standon have common meanings in vertical relationships but different details of how these two objects are vertically placed. In order to leverage the inherent structures of the predicate categories, we propose to first build the language hierarchy and then utilize the Hierarchy Guided Feature Learning (HGFL) strategy to learn better region features of both the coarse-grained level and the fine-grained level. Besides, we also propose the Hierarchy Guided Module (HGM) to utilize the coarse-grained level to guide the learning of fine-grained level features. Experiments show that the proposed simple yet effective method can improve several state-of-the-art baselines by a large margin (up to 33% relative gain) in terms of Recall@50 on the task of Scene Graph Generation in different datasets.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 12 Sep 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2.
2 papers.
- 2022Scene Graph Generation: A Comprehensive Surveycited by 73
- 2022Probabilistic Debiasing of Scene Graphscited by 8
- 2022Probabilistic Debiasing of Scene Graphs11 Nov 2022
- 2022Scene Graph Generation: A Comprehensive Survey3 Jan 2022