MTFH: A Matrix Tri-factorization Hashing Framework For Efficient Cross-modal Retrieval
2018 · Xin Liu, Zhikai Hu, Haibin Ling, et al.
Abstract
Hashing has recently sparked a great revolution in cross-modal retrieval because of its low storage cost and high query speed. Recent cross-modal hashing methods often learn unified or equal-length hash codes to represent the multi-modal data and make them intuitively comparable. However, such unified or equal-length hash representations could inherently sacrifice their representation scalability because the data from different modalities may not have one-to-one correspondence and could be encoded more efficiently by different hash codes of unequal lengths. To mitigate these problems, this paper exploits a related and relatively unexplored problem: encode the heterogeneous data with varying hash lengths and generalize the cross-modal retrieval in various challenging scenarios. To this end, a generalized and flexible cross-modal hashing framework, termed Matrix Tri-Factorization Hashing (MTFH), is proposed to work seamlessly in various settings including paired or unpaired multi-modal d
Authors
(none)
Tags
Stats
Related papers
- Efficient Discrete Supervised Hashing For Large-scale Cross-modal Retrieval (2019)11.08
- Transitive Hashing Network For Heterogeneous Multimedia Retrieval (2016)8.35
- Unsupervised Multi-modal Hashing For Cross-modal Retrieval (2019)8.35
- Weakly-paired Cross-modal Hashing (2019)0.00
- 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
- Asymmetric Correlation Quantization Hashing For Cross-modal Retrieval (2020)10.74
- Fusion-supervised Deep Cross-modal Hashing (2019)8.60