arXiv:2503.07037cs.CVcs.IR2025-03被引 1

通过局部对齐提升零样本哈希的图像检索精度

Zero-Shot Hashing Based on Reconstruction With Part Alignment

  • 按图像块聚类并匹配对应属性向量,实现局部对齐
  • 在CUB-200-2011和AWA2数据集上优于现有方法
  • 适合需要跨类别检索的视觉应用

哈希算法广泛应用于大规模图像检索,尤其针对已见类别数据。零样本哈希算法用于处理未见类别数据,其核心是将已见类别的特征学习并迁移到未见类别,即对齐已见与未见类别的特征嵌入。现有方法通常依赖两类间的共享属性完成对齐,但这些属性描述的是整张图像,而实际代表图像的特定部分,导致忽略属性与对应图像区域的精确对齐,引入噪声并降低对齐精度。为此,本文提出一种新的零样本哈希方法RAZH:首先使用聚类算法将图像块分组为图像局部区域,用于属性匹配;随后用对应属性向量替换图像局部区域,逐步将每个局部区域与其最近的属性对齐。大量实验表明,RAZH在CUB-200-2011和AWA2数据集上优于多个先进方法。

原文摘要 · Abstract (English)

Hashing algorithms have been widely used in large-scale image retrieval tasks, especially for seen class data. Zero-shot hashing algorithms have been proposed to handle unseen class data. The key technique in these algorithms involves learning features from seen classes and transferring them to unseen classes, that is, aligning the feature embeddings between the seen and unseen classes. Most existing zero-shot hashing algorithms use the shared attributes between the two classes of interest to complete alignment tasks. However, the attributes are always described for a whole image, even though they represent specific parts of the image. Hence, these methods ignore the importance of aligning attributes with the corresponding image parts, which explicitly introduces noise and reduces the accuracy achieved when aligning the features of seen and unseen classes. To address this problem, we propose a new zero-shot hashing method called RAZH. We first use a clustering algorithm to group similar patches to image parts for attribute matching and then replace the image parts with the corresponding attribute vectors, gradually aligning each part with its nearest attribute. Extensive evaluation results demonstrate the superiority of the RAZH method over several state-of-the-art methods.

零样本哈希图像检索局部对齐

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。