Browse State-of-the-Art › Scene Graph Classification
Scene Graph Classification
7 papers with code · 0 benchmarks · 3 datasets archive 2025-07-28
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
3 datasets whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Most implemented papers archive 2025-07-28
7 shown of 7 papers with code (11 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
22 Mar 2022 2 repositories listedScene graph generation (SGG) is designed to extract (subject, predicate, object) triplets in images.
-
21 Nov 2023 1 repository listedThis work introduces an enhanced approach to generating scene graphs by incorporating both a relationship hierarchy and commonsense knowledge.
-
3 May 2022 1 repository listed Syntology ran 5 of 9 samples · 4 unverifiedDespite their effectiveness, however, current SGG methods only assume scene graph homophily while ignoring heterophily.
-
5 Jul 2021 1 repository listedGiven input images, scene graph generation (SGG) aims to produce comprehensive, graphical representations describing visual relationships among salient objects.
-
16 Jun 2021 1 repository listedTo quantify how much LOGIN is aware of relational direction, a new diagnostic task called Bidirectional Relationship Classification (BRC) is also proposed.
-
3 Mar 2021 1 repository listedThe proposed formulation allows for efficiently incorporating the structure of scene graphs in the output space.
-
15 Feb 2018 1 repository listedMachine understanding of complex images is a key goal of artificial intelligence.
Syntology lines on 1 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections