Predicate Classification Using Optimal Transport Loss in Scene Graph Generation
원문 초록
In scene graph generation (SGG), learning with cross-entropy loss yields biased predictions owing to the severe imbalance in the distribution of the relationship labels in the dataset. Thus, this study proposes a method to generate scene graphs using optimal transport as a measure for comparing two probability distributions. We apply learning with the optimal transport loss, which reflects the similarity between the labels in terms of transportation cost, for predicate classification in SGG. In the proposed approach, the transportation cost of the optimal transport is defined using the similarity of words obtained from the pre-trained model. The experimental evaluation of the effectiveness demonstrates that the proposed method outperforms existing methods in terms of mean Recall@50 and 100. Furthermore, it improves the recall of the relationship labels scarcely available in the dataset.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Situational Scene Graph for Structured Human-centric Situation Understanding
TD^2-Net: Toward Denoising and Debiasing for Dynamic Scene Graph Generation
Open World Scene Graph Generation using Vision Language Models
EgoExOR: An Ego-Exo-Centric Operating Room Dataset for Surgical Activity Understanding
LLM Meets Scene Graph: Can Large Language Models Understand and Generate Scene Graphs? A Benchmark and Empirical Study
SCENIR: Visual Semantic Clarity through Unsupervised Scene Graph Retrieval
토론
이 논문과 연결된 포럼 글이 아직 없습니다.