Pseudo Labels and Soft Multi-Part Corresponding Similarity for Unsupervised Deep Hashing

In recent years, unsupervised deep hashing methods have achieved great success in large-scale image retrieval. However, these approaches still suffer two major problems in real world applications. On the one hand, due to the lack of effective supervision information, hash codes of different categories are easily judged to be similar. On the other hand, binary semantic similarity matrices can not reflect ranking relationship and the internal structure information of different images. To solve these problems, we propose a novel unsupervised deep hashing method, named
P
seudo labels and
S
oft multi-part
C
orresponding similarity based
H
ashing (PSCH), to ensure the heterogeneity of the hash codes. Specifically, we propose a “pseudo labels” method that use
${k}$
-means clustering and a distance threshold to generate the pseudo labels. Further, in order to reflect the hash codes similarity between instances within the same class, we propose a novel soft multi-part corresponding similarity method to learn better hash codes. This method can divide deep feature maps into several groups and compute the attention map for multi-part similarity matrices. In addition, a novel loss function is proposed to support learning with pseudo labels and soft multi-part corresponding similarity for achieving better performance. Comprehensive experiments on CIFAR-10, NUSWIDE, and Flickr demonstrate that our method can generate high-quality hash codes and outperform state-of-the-art unsupervised hashing methods by a large margin.