<p>In content-based image retrieval (CBIR), aligning user queries with database images is challenging, especially when the queries are ‘impossible queries’ i.e. queries that seek items that are non-existent in the database. These gaps in retrieval systems result in user dissatisfaction. This paper introduces a novel task, query refinement for non-existent items (QRNE), an approach that reformulates impossible queries to better match available content, while preserving the user’s original intent. We have found limitations in current encoding systems, particularly the limitations of CLIP embeddings. Due to CLIP’s contrastive learning-based training mechanism, it may struggle to identify similarities. To address this challenge, this paper proposes a embedding remapping network for the CLIP encoder and a QRNE baseline algorithm leveraging the remapping network. Experiments show that the remapped embeddings are able to overcome the limitations of CLIP embeddings.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Settle for the next best option: improving similarity identification of CLIP for impossible text-image retrieval

  • Yidan Zhang,
  • Naoto Naka,
  • Shin’ichi Satoh

摘要

In content-based image retrieval (CBIR), aligning user queries with database images is challenging, especially when the queries are ‘impossible queries’ i.e. queries that seek items that are non-existent in the database. These gaps in retrieval systems result in user dissatisfaction. This paper introduces a novel task, query refinement for non-existent items (QRNE), an approach that reformulates impossible queries to better match available content, while preserving the user’s original intent. We have found limitations in current encoding systems, particularly the limitations of CLIP embeddings. Due to CLIP’s contrastive learning-based training mechanism, it may struggle to identify similarities. To address this challenge, this paper proposes a embedding remapping network for the CLIP encoder and a QRNE baseline algorithm leveraging the remapping network. Experiments show that the remapped embeddings are able to overcome the limitations of CLIP embeddings.