4.7 Article

Unsupervised Fusion Feature Matching for Data Bias in Uncertainty Active Learning

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TNNLS.2022.3209085

关键词

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

资金

  1. National Natural Science Foundation of China [62272298, 61872241, 62077037]
  2. Shanghai Municipal Science and Technology Major Project [2021SHZDZX0102]
  3. National Key Research and Development Program of China [2019YFB1703600]
  4. Hong Kong Polytechnic University [P0030419, P0042740, P0035358]

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

This article proposes a feature-matching-based uncertainty method to alleviate the data bias issue by resampling selected uncertainty data. To meet the requirement of no additional costs, the authors specially designed an unsupervised fusion feature matching (UFFM), and redesigned classic uncertainty methods for more complex visual tasks. Experimental results demonstrate that the proposed method outperforms other similar techniques.
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.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

暂无数据
暂无数据