3.8 Proceedings Paper

Hierarchical Proxy-based Loss for Deep Metric Learning

出版社

IEEE COMPUTER SOC
DOI: 10.1109/WACV51458.2022.00052

关键词

-

资金

  1. US National Science Foundation [IIS-1763981]
  2. Partner University Fund
  3. SUNY2020 Infrastructure Transportation Security Center

向作者/读者索取更多资源

Proxy-based metric learning losses, by imposing hierarchical structure on the proxies, are able to capture both class-discriminative features and class-shared characteristics, thereby improving the performance of image retrieval, especially on large datasets with strong hierarchical structure.
Proxy-based metric learning losses are superior to pair-based losses due to their fast convergence and low training complexity. However, existing proxy-based losses focus on learning class-discriminative features while overlooking the commonalities shared across classes which are potentially useful in describing and matching samples. Moreover, they ignore the implicit hierarchy of categories in realworld datasets, where similar subordinate classes can be grouped together. In this paper, we present a framework that leverages this implicit hierarchy by imposing a hierarchical structure on the proxies and can be used with any existing proxy-based loss. This allows our model to capture both class-discriminative features and class-shared characteristics without breaking the implicit data hierarchy. We evaluate our method on five established image retrieval datasets such as In-Shop and SOP. Results demonstrate that our hierarchical proxy-based loss framework improves the performance of existing proxy-based losses, especially on large datasets which exhibit strong hierarchical structure.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

3.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据