To date, query performance prediction (QPP) in the context of content-based image retrieval remains a largely unexplored task, especially in the query-by-example scenario, where the query is an image. To boost the exploration of the QPP task in image retrieval, we propose the first benchmark for image query performance prediction (iQPP). First, we establish a set of four data sets (PASCAL VOC 2012, Caltech-101, ROxford5k and RParis6k) and estimate the ground-truth difficulty of each query as the average precision or the precision@k, using two state-of-the-art image retrieval models. Next, we propose and evaluate novel pre-retrieval and post-retrieval query performance predictors, comparing them with existing or adapted (from text to image) predictors. The empirical results show that most predictors do not generalize across evaluation scenarios. Our comprehensive experiments indicate that iQPP is a challenging benchmark, revealing an important research gap that needs to be addressed in future work. We release our code and data as open source at https://github.com/Eduard6421/iQPP, to foster future research.
翻译:迄今为止,在基于内容的图像检索方面,查询性能预测(QPP)在很大程度上仍是一项尚未探索的任务,特别是在查询为图像的逐个实例情景中,查询就是图像。为了在图像检索中推动对QPP任务的探索,我们提出了图像查询性业绩预测(iQPP)的第一个基准。首先,我们建立了一套四套数据(PASCAL VOC 2012、Caltech-101、ROxford5k和RParis6k),并估计了每项查询作为平均精确度或精确度的地面真相困难,使用两种最先进的图像检索模型。接下来,我们提出并评价新的预检索和检索后查询性能预测器,将其与现有或经修改的(从文字到图像)预测器进行比较。经验结果表明,大多数预测器没有在各种评估情景中实现普遍性。我们的全面实验表明iQPPP是一个具有挑战性的基准,揭示了需要在未来工作中解决的重要研究差距。我们在 https://githubb.com/Edu21中公布我们的代码和数据作为开放源,促进未来研究。