Supervised deep hashing for hierarchical labeled data

26Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.

Abstract

Recently, hashing methods have been widely used in large-scale image retrieval. However, most existing supervised hashing methods do not consider the hierarchical relation of labels, which means that they ignored the rich semantic information stored in the hierarchy. Moreover, most of previous works treat each bit in a hash code equally, which does not meet the scenario of hierarchical labeled data. To tackle the aforementioned problems, in this paper, we propose a novel deep hashing method, called supervised hierarchical deep hashing (SHDH), to perform hash code learning for hierarchical labeled data. Specifically, we define a novel similarity formula for hierarchical labeled data by weighting each level, and design a deep neural network to obtain a hash code for each data point. Extensive experiments on two real-world public datasets show that the proposed method outperforms the state-of-the-art baselines in the image retrieval task.

Cite

CITATION STYLE

APA

Wang, D., Huang, H., Lu, C., Feng, B. S., Wen, G., Nie, L., & Mao, X. L. (2018). Supervised deep hashing for hierarchical labeled data. In 32nd AAAI Conference on Artificial Intelligence, AAAI 2018 (pp. 7388–7395). AAAI press. https://doi.org/10.1609/aaai.v32i1.12247

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free