3260 papers • 126 benchmarks • 313 datasets
Unbiased Scene Graph Generation (Unbiased SGG) aims to predict more informative scene graphs composed of more "tail predicates" *(in contrast to "head predicates" in terms of class frequencies) by dealing with the skewed, long-tailed predicate class distribution. (Definition from Chiou et al. "Recovering the Unbiased Scene Graphs from the Biased Ones")
(Image credit: Papersgraph)
These leaderboards are used to track progress in unbiased-scene-graph-generation-7
Use these libraries to find unbiased-scene-graph-generation-7 models and implementations
No subtasks available.
A novel SGG framework based on causal inference but not the conventional likelihood is presented, which uses Total Direct Effect (TDE) as the proposed final predicate score for unbiased SGG and can be widely applied in the community who seeks unbiased predictions.
This work introduces a novel confidence-aware bipartite graph neural network with adaptive message propagation mechanism for unbiased scene graph generation and proposes an efficient bi-level data resampling strategy to alleviate the imbalanced data distribution problem in training the authors' graph network.
This work proposes a novel Internal and External Data Transfer (IETrans) method, which can be applied in a plug-and-play fashion and expanded to large SGG with 1,807 predicate classes, which tries to relieve the data distribution problem by automatically creating an enhanced dataset that provides more sufficient and coherent annotations for all predicates.
A novel Predicate-Correlation Perception Learning scheme to adaptively seek out appropriate loss weights by directly perceiving and utilizing the correlation among predicate classes is proposed, which significantly outperforms previous state-of-the-art methods.
This work builds a cognitive structure CogTree to organize the relationships based on the prediction of a biased SGG model, and proposes a debiasing loss specially for this cognitive structure, which supports coarse-to-fine distinction for the correct relationships.
This paper shows that, due to the missing labels, SGG can be viewed as a "Learning from Positive and Unlabeled data" (PU learning) problem, where the reporting bias can be removed by recovering the unbiased probabilities from the biased ones by utilizing label frequencies.
Resistance Training using Prior Bias (RTPB) uses a distributed-based prior bias to improve models' detecting ability on less frequent relationships during training, thus improving the model generalizability on tail categories.
A novel Stacked Hybrid-Attention network is presented, which facilitates the intra-modal refinement as well as the intermodal interaction, to serve as the encoder and an innovative Group Collaborative Learning strategy is devised to optimize the decoder.
A Dual-branch Hybrid Learning network (DHL) to take care of both head predicates and tail ones for SGG, including a Coarse-grained Learning Branch (CLB) and a Fine-grained Learning Branch (FLB).
The Skew Class-Balanced Re-Weighting (SCR) loss function is considered for the unbiased SGG models and is Leveraged by the skewness of biased predicate predictions, the SCR estimates the target predicate weight coefficient and then re-weights more to the biased predicates for better trading-off between the majority predicates and the minority ones.
Adding a benchmark result helps the community track progress.