Deep Highly Interrelated Hashing for Fast Image Retrieval

In recent years, with the explosive growth of the amount of image data, the combination of hashing and deep learning shows excellent performance in the field of large-scale image retrieval. Most of the mainstream deep-supervised hashing methods use a “paired” strategy to generate a similarity matrix constrained Hash encoding. The instance-pairwise similarity matrix is a n×n matrix, where n is the number of training samples. The computational cost of such methods is large, and such methods are not suitable for large-scale image retrieval. Therefore, this paper proposes a deep highly interrelated hashing method, which is a deep-supervised hashing method that enables fast and accurate large-scale image retrieval. It can be widely used in a variety of deep convolutional neural networks. Particularly, in order to make the Hash code more discriminating, this paper proposes a highly interrelated loss function constrained Hash encoding. The highly interrelated loss function adjusts the distance between features by changing the sensitivity of the model to the weight matrix. It maximizes the distance between classes and reduces the distance within the class. Many experiments in CIFAR-10, NUS-WIDE and SVHN datasets are done. The experimental results show that the image retrieval performance of deep highly interrelated hashing is better than the current mainstream methods.