Most scene graph parsers use a two-stage pipeline to detect visual
relationships: the first stage detects entities, and the second predicts the
predicate for each entity pair using a softmax distribution. We find that such
pipelines, trained with only a cross entropy loss over predicate classes,
suffer from two common errors. The first, Entity Instance Confusion, occurs
when the model confuses multiple instances of the same type of entity (e.g.
multiple cups). The second, Proximal Relationship Ambiguity, arises when
multiple subject-predicate-object triplets appear in close proximity with the
same predicate, and the model struggles to infer the correct subject-object
pairings (e.g. mis-pairing musicians and their instruments). We propose a set
of contrastive loss formulations that specifically target these types of errors
within the scene graph parsing problem, collectively termed the Graphical
Contrastive Losses. These losses explicitly force the model to disambiguate
related and unrelated instances through margin constraints specific to each
type of confusion. We further construct a relationship detector, called RelDN,
using the aforementioned pipeline to demonstrate the efficacy of our proposed
losses. Our model outperforms the winning method of the OpenImages Relationship
Detection Challenge by 4.7\% (16.5\% relative) on the test set. We also show
improved results over the best previous methods on the Visual Genome and Visual
Relationship Detection datasets.

该研究提出了一组对比损失函数用于处理场景图解析中的实体实例混淆和近距离关系歧义问题，并提出了一种称为 RelDN 的关系检测器，该模型在 OpenImages 关系检测挑战赛中相对前一个胜出方法提升了 4.7％（相对 16.5％），在 Visual Genome 和 Visual Relationship Detection 数据集上的结果也得到了改善。