Asymmetric Correlation Quantization Hashing For Cross-modal Retrieval

Abstract

Due to the superiority in similarity computation and database storage for large-scale multiple modalities data, cross-modal hashing methods have attracted extensive attention in similarity retrieval across the heterogeneous modalities. However, there are still some limitations to be further taken into account: (1) most current CMH methods transform real-valued data points into discrete compact binary codes under the binary constraints, limiting the capability of representation for original data on account of abundant loss of information and producing suboptimal hash codes; (2) the discrete binary constraint learning model is hard to solve, where the retrieval performance may greatly reduce by relaxing the binary constraints for large quantization error; (3) handling the learning problem of CMH in a symmetric framework, leading to difficult and complex optimization objective. To address above challenges, in this paper, a novel Asymmetric Correlation Quantization Hashing (ACQH) method is

Stats

• citations26
• S2 citations—
• github stars0
• HF likes0
• heat score10.74
• arxiv keywang2020asymmetric

Related papers

• Correlation Hashing Network For Efficient Cross-modal Retrieval (2016)11.67
• Weakly-paired Cross-modal Hashing (2019)0.00
• Learning Decorrelated Hashing Codes For Multimodal Retrieval (2018)0.00
• Cluster-wise Unsupervised Hashing For Cross-modal Similarity Search (2019)11.39
• Transitive Hashing Network For Heterogeneous Multimedia Retrieval (2016)8.35
• MTFH: A Matrix Tri-factorization Hashing Framework For Efficient Cross-modal Retrieval (2018)16.88
• Efficient Discrete Supervised Hashing For Large-scale Cross-modal Retrieval (2019)11.08
• Central Similarity Quantization For Efficient Image And Video Retrieval (2019)23.49