Efficient Discrete Supervised Hashing For Large-scale Cross-modal Retrieval

Abstract

Supervised cross-modal hashing has gained increasing research interest on large-scale retrieval task owning to its satisfactory performance and efficiency. However, it still has some challenging issues to be further studied: 1) most of them fail to well preserve the semantic correlations in hash codes because of the large heterogenous gap; 2) most of them relax the discrete constraint on hash codes, leading to large quantization error and consequent low performance; 3) most of them suffer from relatively high memory cost and computational complexity during training procedure, which makes them unscalable. In this paper, to address above issues, we propose a supervised cross-modal hashing method based on matrix factorization dubbed Efficient Discrete Supervised Hashing (EDSH). Specifically, collective matrix factorization on heterogenous features and semantic embedding with class labels are seamlessly integrated to learn hash codes. Therefore, the feature based similarities and semantic

Stats

• citations29
• S2 citations—
• github stars0
• HF likes0
• heat score11.08
• arxiv keyyao2019efficient

Related papers

• FDDH: Fast Discriminative Discrete Hashing For Large-scale Cross-modal Retrieval (2021)15.50
• Discriminative Supervised Hashing For Cross-modal Similarity Search (2018)7.81
• Unsupervised Multi-modal Hashing For Cross-modal Retrieval (2019)8.35
• Cluster-wise Unsupervised Hashing For Cross-modal Similarity Search (2019)11.39
• MTFH: A Matrix Tri-factorization Hashing Framework For Efficient Cross-modal Retrieval (2018)16.88
• Fusion-supervised Deep Cross-modal Hashing (2019)8.60
• Transitive Hashing Network For Heterogeneous Multimedia Retrieval (2016)8.35
• Deep Cross-modal Hashing Via Margin-dynamic-softmax Loss (2020)0.00