Intra-Class Adaptive Augmentation With Neighbor Correction for Deep Metric Learning

被引:2
作者
Fu, Zheren [1 ]
Mao, Zhendong [2 ,3 ]
Hu, Bo [2 ]
Liu, An-An [4 ]
Zhang, Yongdong [2 ,3 ]
机构
[1] Univ Sci & Technol China, Sch Cyberspace Sci & Technol, Hefei 230027, Peoples R China
[2] Univ Sci & Technol China, Sch Informat Sci & Technol, Hefei 230022, Peoples R China
[3] Hefei Comprehens Natl Sci Ctr, Inst Artificial Intelligence, Hefei 230022, Peoples R China
[4] Tianjin Univ, Sch Elect & Informat Engn, Tianjin 300072, Peoples R China
基金
中国国家自然科学基金;
关键词
Deep metric learning; distribution estimation; sample generation; semantic augmentation;
D O I
10.1109/TMM.2022.3227414
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Deep metric learning aims to learn an embedding space, where semantically similar samples are close together and dissimilar ones are repelled against. To explore more hard and informative training signals for augmentation and generalization, recent methods focus on generating synthetic samples to boost metric learning losses. However, these methods just use the deterministic and class-independent generations (e.g., simple linear interpolation), which only can cover the limited part of distribution spaces around original samples. They have overlooked the wide characteristic changes of different classes and can not model abundant intra-class variations for generations. Therefore, generated samples not only lack rich semantics within the certain class, but also might be noisy signals to disturb training. In this paper, we propose a novel intra-class adaptive augmentation (IAA) framework for deep metric learning. We reasonably estimate intra-class variations for every class and generate adaptive synthetic samples to support hard samples mining and boostmetric learning losses. Further, for most datasets that have a few samples within the class, we propose the neighbor correction to revise the inaccurate estimations, according to our correlation discovery where similar classes generally have similar variation distributions. Extensive experiments on five benchmarks show our method significantly improves and outperforms the state-of-the-art methods on retrieval performances by 3%-6%.
引用
收藏
页码:7758 / 7771
页数:14
相关论文
共 75 条
  • [1] Akaike H., 1973, P 2 INT S INF THEOR, DOI [DOI 10.1007/978-1-4612-1694-015, 10.1007/978-1-4612-1694-0_15, 10.1007/978-1-4612-1694-015]
  • [2] [Anonymous], 2006, Theory of point estimation, DOI 10.1007/b98854
  • [3] [Anonymous], 2015, P 3 INT C LEARN REPR
  • [4] Bai Y, 2017, IEEE INT CON MULTI, P1452, DOI 10.1109/ICME.2017.8019371
  • [5] Bengio Y., 2013, INT C MACHINE LEARNI, P552
  • [6] Brock A., 2019, PROC INT C LEARN RE
  • [7] Cai Q., 2020, P ADV NEUR INF PROC
  • [8] Deep Metric Learning to Rank
    Cakir, Fatih
    He, Kun
    Xia, Xide
    Kulis, Brian
    Sclaroff, Stan
    [J]. 2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019), 2019, : 1861 - 1870
  • [9] Chen BH, 2021, AAAI CONF ARTIF INTE, V35, P982
  • [10] Interclass-Relativity-Adaptive Metric Learning for Cross-Modal Matching and Beyond
    Chen, Feiyu
    Shao, Jie
    Zhang, Yonghui
    Xu, Xing
    Shen, Heng Tao
    [J]. IEEE TRANSACTIONS ON MULTIMEDIA, 2021, 23 : 3073 - 3084