Discrete Spatial Importance-Based Deep Weighted Hashing

Yang Shi, Xiushan Nie, Quan Zhou, Xiaoming Xi, Yilong Yin; Proceedings of the Asian Conference on Computer Vision (ACCV), 2020


Hashing is a widely used technique for large-scale approximate nearest neighbor searching in multimedia retrieval. Recent works have proved that using deep neural networks is a promising solution for learning both feature representation and hash codes. However, most existing deep hashing methods directly learn hash codes from a convolutional neural network, ignoring the spatial importance distribution of images. The loss of spatial importance negatively affects the performance of hash learning and thus reduces its accuracy. To address this issue, we propose a new deep hashing method with weighted spatial information, which generates hash codes by using discrete spatial importance distribution. In particular, to extract the discrete spatial importance information of images effectively, we propose a method to learn the spatial attention map and hash code simultaneously, which makes the spatial attention map more conductive to hash-based retrieval. The experimental results of three widely used datasets show that the proposed deep weighted hashing method is superior to the state-of-the-art hashing method.

Related Material

@InProceedings{Shi_2020_ACCV, author = {Shi, Yang and Nie, Xiushan and Zhou, Quan and Xi, Xiaoming and Yin, Yilong}, title = {Discrete Spatial Importance-Based Deep Weighted Hashing}, booktitle = {Proceedings of the Asian Conference on Computer Vision (ACCV)}, month = {November}, year = {2020} }