arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2102.07753cs.CV
收藏

深度度量学习的批内连接学习

Learning Intra-Batch Connections for Deep Metric Learning

Technical University of Munich(慕尼黑工业大学)

Jenny Seidenschwarz, Ismail Elezi, Laura Leal-Taixé

摘要:

度量学习的目标是学习一个函数,该函数将样本映射到一个低维空间,在这个空间中,相似的样本比不相似的样本更接近。特别地,深度度量学习利用神经网络来学习这样的映射。大多数方法依赖于仅考虑样本对或三个样本之间的关系的损失,这些样本属于同一类或两个不同类。然而,这些方法没有探索整个嵌入空间。为此,我们提出了一种基于消息传递网络的方法,该方法考虑到小批量中的所有关系。我们通过在给定批次中的所有样本之间交换消息来细化嵌入向量,从而使训练过程能够了解其整体结构。由于并非所有样本对于预测决策边界都同样重要,因此我们在消息传递期间使用注意力机制来允许样本相应地权衡每个邻居的重要性。我们在CUB-200-2011,Cars 196,Stanford Online Products和In-Shop Clothes数据集上实现了最先进的聚类和图像检索结果。为了方便进一步的研究,我们在https://github.com/dvl-tum/intra_batch_connections上提供了代码和模型。

英文摘要:

The goal of metric learning is to learn a function that maps samples to a lower-dimensional space where similar samples lie closer than dissimilar ones. Particularly, deep metric learning utilizes neural networks to learn such a mapping. Most approaches rely on losses that only take the relations between pairs or triplets of samples into account, which either belong to the same class or two different classes. However, these methods do not explore the embedding space in its entirety. To this end, we propose an approach based on message passing networks that takes all the relations in a mini-batch into account. We refine embedding vectors by exchanging messages among all samples in a given batch allowing the training process to be aware of its overall structure. Since not all samples are equally important to predict a decision boundary, we use an attention mechanism during message passing to allow samples to weigh the importance of each neighbor accordingly. We achieve state-of-the-art results on clustering and image retrieval on the CUB-200-2011, Cars196, Stanford Online Products, and In-Shop Clothes datasets. To facilitate further research, we make available the code and the models at https://github.com/dvl-tum/intra_batch_connections.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑