Adaptive Asymmetric Supervised Cross-Modal Hashing with consensus matrix

Yinan Li

doi:10.1016/j.ipm.2024.104037

Adaptive Asymmetric Supervised Cross-Modal Hashing with consensus matrix

2025-05-01

0

PRE

AI

DOI：10.1016/j.ipm.2024.104037

Original

Original request for help

Save

Abstract

En 中文

Supervised hashing has garnered considerable attention in cross-modal retrieval by programming annotated diverse modality data into the unified binary representation that facilitates efficient retrieval and lightweight storage. Despite its advantages, a major challenge remains, how to get the utmost out of annotated information and derive robust common representation that accurately preserves the intrinsic relations across heterogeneous modalities. In this paper, we present an innovative A daptive A symmetric S upervised C ross-modal H ashing method with consensus matrix to tackle the problem. We begin by formulating the proposition through matrix factorization to obtain the common representation utilizing consensus matrix efficiently. To safeguard the completeness of diverse modality data, we incorporate them via adaptive weight factors along with nuclear norms. Furthermore, an asymmetric hash learning framework between the representative coefficient matrices that come from common representation and semantic labels was constructed to constitute concentrated hash codes. Additionally, a valid discrete optimization algorithm was programmed. Comprehensive experiments conducted on MIRFlirck, NUS-WIDE, and IARP-TC12 datasets validate that A2SCH outperforms leading-edge hashing methods in cross-modal retrieval tasks.

Keywords:

Cross-modal retrieval

Supervised hashing

Discrete optimization

Adaptive Asymmetric Supervised Cross-Modal Hashing with consensus matrix

Abstract

Journal

Organization