Unsupervised Fusion Feature Matching for Data Bias in Uncertainty Active Learning

被引:4
作者
Huang, Wei [1 ]
Sun, Shuzhou [2 ]
Lin, Xiao [2 ,3 ]
Li, Ping [4 ,5 ]
Zhu, Lei [6 ,7 ]
Wang, Jihong [8 ]
Chen, C. L. Philip [9 ,10 ]
Sheng, Bin [11 ]
机构
[1] Univ Shanghai Sci & Technol, Sch Opt Elect & Comp Engn, Shanghai 200093, Peoples R China
[2] Shanghai Normal Univ, Coll Informat Mech & Elect Engn, Shanghai 200234, Peoples R China
[3] Shanghai Engn Res Ctr Intelligent Educ & Bigdata, Shanghai 200240, Peoples R China
[4] Hong Kong Polytech Univ, Dept Comp, Hong Kong, Peoples R China
[5] Hong Kong Polytech Univ, Sch Design, Hong Kong, Peoples R China
[6] Hong Kong Univ Sci & Technol Guangzhou, ROAS Thrust, Guangzhou 511400, Peoples R China
[7] Hong Kong Univ Sci & Technol, Dept Elect & Comp Engn, Hong Kong, Peoples R China
[8] Shanghai Univ Sport, Sch Phys Educ, Shanghai 200438, Peoples R China
[9] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou 510006, Peoples R China
[10] Pazhou Lab, Guangzhou 510335, Peoples R China
[11] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai 200240, Peoples R China
基金
中国国家自然科学基金;
关键词
Uncertainty; Data models; Training; Task analysis; Costs; Training data; Supervised learning; Active learning (AL); data bias; deep learning; feature fusion; feature matching; neural network; uncertainty;
D O I
10.1109/TNNLS.2022.3209085
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Active learning (AL) aims to sample the most valuable data for model improvement from the unlabeled pool. Traditional works, especially uncertainty-based methods, are prone to suffer from a data bias issue, which means that selected data cannot cover the entire unlabeled pool well. Although there have been lots of literature works focusing on this issue recently, they mainly benefit from the huge additional training costs and the artificially designed complex loss. The latter causes these methods to be redesigned when facing new models or tasks, which is very time-consuming and laborious. This article proposes a feature-matching-based uncertainty that resamples selected uncertainty data by feature matching, thus removing similar data to alleviate the data bias issue. To ensure that our proposed method does not introduce a lot of additional costs, we specially design a unsupervised fusion feature matching (UFFM), which does not require any training in our novel AL framework. Besides, we also redesign several classic uncertainty methods to be applied to more complex visual tasks. We conduct rigorous experiments on lots of standard benchmark datasets to validate our work. The experimental results show that our UFFM is better than the similar unsupervised feature matching technologies, and our proposed uncertainty calculation method outperforms random sampling, classic uncertainty approaches, and recent state-of-the-art (SOTA) uncertainty approaches.
引用
收藏
页码:5749 / 5763
页数:15
相关论文
共 45 条
  • [1] Active Learning for Deep Detection Neural Networks
    Aghdam, Hamed H.
    Gonzalez-Garcia, Abel
    van de Weijer, Joost
    Lopez, Antonio M.
    [J]. 2019 IEEE/CVF INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV 2019), 2019, : 3671 - 3679
  • [2] [Anonymous], 2014, ITE Trans.Media Technol. Appl.
  • [3] Arandjelovic R, 2018, IEEE T PATTERN ANAL, V40, P1437, DOI [10.1109/CVPR.2016.572, 10.1109/TPAMI.2017.2711011]
  • [4] Aggregating Deep Convolutional Features for Image Retrieval
    Babenko, Artem
    Lempitsky, Victor
    [J]. 2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2015, : 1269 - 1277
  • [5] The power of ensembles for active learning in image classification
    Beluch, William H.
    Genewein, Tim
    Nuernberger, Andreas
    Koehler, Jan M.
    [J]. 2018 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2018, : 9368 - 9377
  • [6] HashGAN: Deep Learning to Hash with Pair Conditional Wasserstein GAN
    Cao, Yue
    Liu, Bin
    Long, Mingsheng
    Wang, Jianmin
    [J]. 2018 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2018, : 1287 - 1296
  • [7] Active Batch Selection via Convex Relaxations with Guaranteed Solution Bounds
    Chakraborty, Shayok
    Balasubramanian, Vineeth
    Sun, Qian
    Panchanathan, Sethuraman
    Ye, Jieping
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2015, 37 (10) : 1945 - 1958
  • [8] Deng J, 2009, PROC CVPR IEEE, P248, DOI 10.1109/CVPRW.2009.5206848
  • [9] Deep Spherical Quantization for Image Search
    Eghbali, Sepehr
    Tahvildari, Ladan
    [J]. 2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019), 2019, : 11682 - 11691
  • [10] A Convex Optimization Framework for Active Learning
    Elhamifar, Ehsan
    Sapiro, Guillermo
    Yang, Allen
    Sastry, S. Shankar
    [J]. 2013 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2013, : 209 - 216