Weakly Supervised Cross-Modal Hashing

doi:10.1109/TBDATA.2019.2954516

Return

Weakly Supervised Cross-Modal Hashing

2019-01-01

PRE

DOI：10.1109/TBDATA.2019.2954516

Original

Original request for help

Save

Abstract

En 中文

Cross-modal hashing can efficiently retrieve data across different modalities and has been successfully applied in various domains. Although many supervised cross-modal hashing methods have been proposed, they generally focus on two modals only and assume that the labels of training data are sufficient and complete. This assumption is not practical in real scenarios. In this article, we propose the weakly supervised cross-modal hashing (WCHash), which takes into account the widely witnessed weakly supervised information (incomplete and insufficient labels) of training data. Specifically, WCHash first optimizes a latent central modality with respect to other modalities. Next, it uses an efficient multi-label weak-label method to enrich the labels of training data and measures the semantic similarity between data points based on the enriched labels. After that, it uses this similarity to guide the correlation maximization between the respective data modals and the central modal and thus achieves the hash functions for cross-modal retrieval. Experimental results on real-world datasets demonstrate that WCHash is more efficient and effective than related state-of-the-art cross-modal hashing methods. WCHash can significantly reduce the complexity of cross-modal hashing on three or more modalities.

Keywords:

Training data

Semantics

Correlation

Hash functions

Big Data

Binary codes

Training

Cross-modal hashing

incomplete labels

insufficient labels

correlation maximization

semantic similarity

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.