arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1705.08280cs.CV
收藏

能有多难呢?估计图像中视觉搜索的难度

How hard can it be? Estimating the difficulty of visual search in an image

Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy(罗马尼亚科学院数学统计与应用数学研究所);Institute of Mathematics of the Romanian Academy(罗马尼亚科学院数学研究所);University of Bucharest(布加勒斯特大学);University of Edinburgh(爱丁堡大学)

Radu Tudor Ionescu, Bogdan Alexe, Marius Leordeanu, Marius Popescu, Dim P. Papadopoulos, Vittorio Ferrari

摘要:

我们解决的问题,估计图像难度定义为人类的响应时间解决视觉搜索任务。我们通过众包平台收集PASCAL VOC 2012数据集的图像难度的人类注释。然后,我们分析了人类可解释的图像属性可以对视觉搜索难度产生影响,以及这些属性对预测难度的准确性。接下来,我们基于使用最先进的卷积神经网络学习的深度特征构建回归模型,并显示出更好的结果来预测人类注释器产生的地面实况视觉搜索难度分数。我们的模型能够正确地排名约75%的图像对,根据他们的难度得分。我们还表明,我们的难度预测推广以及在训练过程中没有看到新的类。最后,我们证明了我们预测的难度分数对于弱监督对象定位(提高8%)和半监督对象分类(提高1%)是有用的。

英文摘要:

We address the problem of estimating image difficulty defined as the human response time for solving a visual search task. We collect human annotations of image difficulty for the PASCAL VOC 2012 data set through a crowd-sourcing platform. We then analyze what human interpretable image properties can have an impact on visual search difficulty, and how accurate are those properties for predicting difficulty. Next, we build a regression model based on deep features learned with state of the art convolutional neural networks and show better results for predicting the ground-truth visual search difficulty scores produced by human annotators. Our model is able to correctly rank about 75% image pairs according to their difficulty score. We also show that our difficulty predictor generalizes well to new classes not seen during training. Finally, we demonstrate that our predicted difficulty scores are useful for weakly supervised object localization (8% improvement) and semi-supervised object classification (1% improvement).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑