Pith. sign in

REVIEW 1 cited by

Semantic Scene Graph Generation Based on an Edge Dual Scene Graph and Message Passing Neural Network

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.01192 v1 pith:OPSOYSEA submitted 2023-11-02 cs.CV

classification cs.CV
keywords graphscenedualrelationshipsedgeobjectsgenerationproposed
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Along with generative AI, interest in scene graph generation (SGG), which comprehensively captures the relationships and interactions between objects in an image and creates a structured graph-based representation, has significantly increased in recent years. However, relying on object-centric and dichotomous relationships, existing SGG methods have a limited ability to accurately predict detailed relationships. To solve these problems, a new approach to the modeling multiobject relationships, called edge dual scene graph generation (EdgeSGG), is proposed herein. EdgeSGG is based on a edge dual scene graph and Dual Message Passing Neural Network (DualMPNN), which can capture rich contextual interactions between unconstrained objects. To facilitate the learning of edge dual scene graphs with a symmetric graph structure, the proposed DualMPNN learns both object- and relation-centric features for more accurately predicting relation-aware contexts and allows fine-grained relational updates between objects. A comparative experiment with state-of-the-art (SoTA) methods was conducted using two public datasets for SGG operations and six metrics for three subtasks. Compared with SoTA approaches, the proposed model exhibited substantial performance improvements across all SGG subtasks. Furthermore, experiment on long-tail distributions revealed that incorporating the relationships between objects effectively mitigates existing long-tail problems.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Unbiased Scene Graph Generation by Type-Aware Message Passing on Heterogeneous and Dual Graphs

    cs.CV 2024-11 conditional novelty 5.0 of 10

    TA-HDG combines heterogeneous and dual graph message passing with interactive/non-interactive relation typing to improve both head and tail class scene graph prediction.

Pith tools