Deep Cross-modal Hashing Via Margin-dynamic-softmax Loss
2020 Β· Rong-Cheng Tu, Xian-Ling Mao, Rongxin Tu, et al.
Abstract
Due to their high retrieval efficiency and low storage cost for cross-modal search task, cross-modal hashing methods have attracted considerable attention. For the supervised cross-modal hashing methods, how to make the learned hash codes preserve semantic information sufficiently contained in the label of datapoints is the key to further enhance the retrieval performance. Hence, almost all supervised cross-modal hashing methods usually depends on defining a similarity between datapoints with the label information to guide the hashing model learning fully or partly. However, the defined similarity between datapoints can only capture the label information of datapoints partially and misses abundant semantic information, then hinders the further improvement of retrieval performance. Thus, in this paper, different from previous works, we propose a novel cross-modal hashing method without defining the similarity between datapoints, called Deep Cross-modal Hashing via \textit\{Margin-dynami
Authors
(none)
Tags
Stats
Related papers
- Deep Class-guided Hashing For Multi-label Cross-modal Retrieval (2024)6.20
- Self-supervised Asymmetric Deep Hashing With Margin-scalable Constraint (2020)0.00
- Fusion-supervised Deep Cross-modal Hashing (2019)8.60
- Ranking-based Deep Cross-modal Hashing (2019)13.34
- Discriminative Supervised Hashing For Cross-modal Similarity Search (2018)7.81
- Efficient Discrete Supervised Hashing For Large-scale Cross-modal Retrieval (2019)11.08
- Unsupervised Multi-modal Hashing For Cross-modal Retrieval (2019)8.35
- Deep Class-wise Hashing: Semantics-preserving Hashing Via Class-wise Loss (2018)11.19