Name
Abstract | ||
|---|---|---|
Cross-modal hash retrieval has received considerable interest in the area of deep learning. Here hash codes of data of different modalities are learned where pair-wise loss functions control feature similarity in a shared embedding space. In this paper we improve on feature similarity by using Shannon's information entropy with respect to the modality information that is left in learning superior hash codes. We introduce a novel network for predicting the domain from the learned features while the protagonist network uses a loss function based on Shannon's information entropy to learn to maximize the domain uncertainty and therefore the information content. Additionally, according to the number of common labels between each similar image-text pair, we define a multi-level similarity matrix as supervisory information, which constrains all similar pairs with different weights. We show with extensive experiments that our novel approach to domain uncertainty leads to a cross-modal hash retrieval that outperforms the state-of-the-art. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/ICME.2019.00016 | 2019 IEEE International Conference on Multimedia and Expo (ICME) |
Keywords | Field | DocType |
Information entropy, cross-modal hash retrieval, domain uncertainty, multi-level similarity | Information theory,Embedding,Pattern recognition,Visualization,Computer science,Hash function,Artificial intelligence,Deep learning,Entropy (information theory),Modal,Semantics | Conference |
ISSN | ISBN | Citations |
1945-7871 | 978-1-5386-9553-1 | 0 |
PageRank | References | Authors |
0.34 | 7 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei Chen | 1 | 1711 | 246.70 |
| Nan Pu | 2 | 3 | 3.41 |
| Yu Liu | 3 | 198 | 25.45 |
| Erwin M. Bakker | 4 | 378 | 41.20 |
| Michael S. Lew | 5 | 2742 | 166.02 |