In many computer vision classification tasks, class priors at test time often differ from priors on the training set. In the case of such prior shift, classifiers must be adapted correspondingly to maintain close to optimal performance. This paper analyzes methods for adaptation of probabilistic classifiers to new priors and for estimating new priors on an unlabeled test set. We propose a novel method to address a known issue of prior estimation methods based on confusion matrices, where inconsistent estimates of decision probabilities and confusion matrices lead to negative values in the estimated priors. Experiments on fine-grained image classification datasets provide insight into the best practice of prior shift estimation and classifier adaptation and show that the proposed method achieves state-of-the-art results in prior adaptation. Applying the best practice to two tasks with naturally imbalanced priors, learning from web-crawled images and plant species classification, increased the recognition accuracy by 1.1% and 3.4% respectively.
翻译:在许多计算机愿景分类任务中,测试时的类别前科往往与培训成套方法的前科不同。在这种前科中,分类人员必须相应调整,以保持接近最佳性能。本文分析了概率分类人员适应新前科和在未贴标签的测试集中估计新前科的方法。我们提出了一个新颖的方法,以解决已知的基于混乱矩阵的先前估算方法问题,即对决定概率和混乱矩阵的不一致性估计导致前科估计数的负值。微微分图像分类数据集的实验可以深入了解前变估计和分类人员适应的最佳做法,并表明拟议方法在先前适应中取得了最新结果。将最佳做法应用于具有自然偏差的前科的两项任务,学习网络图象和植物物种分类,使识别准确率分别提高1.1%和3.4%。