Graph Regularized Deep Discrete Hashing for Multi-Label Image Retrieval

Abstract

Multi-label hashing is a new research topic in image retrieval. As images are usually associated with multiple semantic labels, there is multi-level semantic similarity such as very similar, normally similar and dissimilar among multi-label images. In order to obtain the multi-level semantic similarity, this letter constructs a hypergraph in label space by creating a hyperedge for each semantic label and including all images annotated with a common label into one hyperedge. In this way, the number of common hyperedges shared by the vertices in hypergraph can be used to encode the high-order semantic relations among multiple images. Considering the useful similarity information hidden in the instance space, a kNN graph in instance space is further constructed. By learning from both the hypergraph and kNN graph with spectral learning strategy, a graph regularized deep discrete hashing is developed which updates graph regularized binary codes and deep neural network based robust features iteratively in a discrete optimization framework. The results in comparison with nine state-of-the-art hashing methods on two multi-label image datasets such as MIRFLICKR-25 K and NUS-WISE demonstrate its effectiveness.