Learning Decorrelated Hashing Codes For Multimodal Retrieval

Abstract

In social networks, heterogeneous multimedia data correlate to each other, such as videos and their corresponding tags in YouTube and image-text pairs in Facebook. Nearest neighbor retrieval across multiple modalities on large data sets becomes a hot yet challenging problem. Hashing is expected to be an efficient solution, since it represents data as binary codes. As the bit-wise XOR operations can be fast handled, the retrieval time is greatly reduced. Few existing multimodal hashing methods consider the correlation among hashing bits. The correlation has negative impact on hashing codes. When the hashing code length becomes longer, the retrieval performance improvement becomes slower. In this paper, we propose a minimum correlation regularization (MCR) for multimodal hashing. First, the sigmoid function is used to embed the data matrices. Then, the MCR is applied on the output of sigmoid function. As the output of sigmoid function approximates a binary code matrix, the proposed MCR c

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keytian2018learning

Related papers

• Correlation Hashing Network For Efficient Cross-modal Retrieval (2016)11.67
• Transitive Hashing Network For Heterogeneous Multimedia Retrieval (2016)8.35
• Asymmetric Correlation Quantization Hashing For Cross-modal Retrieval (2020)10.74
• MOON: Multi-hash Codes Joint Learning For Cross-media Retrieval (2021)8.60
• Unsupervised Multi-modal Hashing For Cross-modal Retrieval (2019)8.35
• MTFH: A Matrix Tri-factorization Hashing Framework For Efficient Cross-modal Retrieval (2018)16.88
• Weakly-paired Cross-modal Hashing (2019)0.00
• Discriminative Supervised Hashing For Cross-modal Similarity Search (2018)7.81