PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
April 27, 2019IEEE Transactions on Knowledge and Data Engineering78 citations

Fast Discrete Collaborative Multi-Modal Hashing for Large-Scale Multimedia Retrieval

View Full Paper
CZC. ZhengLZLei ZhuXLXu Lu

Key Points

  • The research aims to address the challenge of learning efficient discrete hash codes for multimedia retrieval with heterogeneous features.
  • Proposed the Fast Discrete Collaborative Multi-modal Hashing method to map multi-modal features efficiently.
  • Developed an asymmetric hashing learning module to relate hash codes with low-level and high-level data semantics.
  • Compared the proposed method with state-of-the-art hashing techniques using multiple public datasets.
  • Demonstrated superior model learning efficiency compared to existing hashing techniques.
  • Achieved improved retrieval accuracy across various multimedia retrieval datasets.

Abstract

Many achievements have been made on learning to hash for uni-modal and cross-modal retrieval. However, it is still an unsolved problem that how to directly and efficiently learn discriminative discrete hash codes for the multimedia retrieval, where both query and database samples are represented with heterogeneous multi-modal features. With this motivation, we propose a Fast Discrete Collaborative Multi-modal Hashing (FDCMH) method in this paper. We first propose an efficient collaborative multi-modal mapping that first transforms heterogeneous multi-modal features into the unified factors to exploit the complementarity of multi-modal features and preserve the semantic correlations in multiple modalities with linear computation and space complexity. Such shared factors also bridge the heterogeneous modality gap and remove the inter-modality redundancy. Further, we develop an asymmetric hashing learning module to simultaneously correlate the learned hash codes with low-level data distribution and high-level semantics. In particular, this design could avoid the challenging symmetric semantic matrix factorization and O(n2) memory cost (n is the number of training samples). It can support both computation and memory efficient discrete hash optimization. Experiments on several public multimedia retrieval datasets demonstrate the superiority of the proposed approach compared with state-of-the-art hashing techniques, in terms of both model learning efficiency and retrieval accuracy.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Zheng et al. (2019) studied this question.

synapsesocial.com/papers/6a231af3dc114893fe1cf033https://doi.org/10.1109/tkde.2019.2913388
Ask AI
Helpful
Bookmark
Share
View Full Paper