CoChat

Multi-Task Consistency-Preserving Adversarial Hashing for Cross-Modal Retrieval

Xie, De, Deng, Cheng, Li, Chao, Liu, Xianglong, Tao, Dacheng · 2020 · IEEE Transactions on Image Processing
Cited by 199

The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.

Abstract

Owing to the advantages of low storage cost and high query efficiency, cross-modal hashing has received increasing attention recently. As failing to bridge the inherent modality gap between modalities, most existing cross-modal hashing methods have limited capability to explore the semantic consistency information between different modality data, leading to unsatisfactory search performance. To address this problem, we propose a novel deep hashing method named Multi-Task Consistency- Preserving Adversarial Hashing (CPAH) to fully explore the semantic consistency and correlation between different modalities for efficient cross-modal retrieval. First, we design a consistency refined module (CR) to divide the representations of different modality into two irrelevant parts, i.e., modality-common and modality-private representations. Then, a multi-task adversarial learning module (MA) is presented, which can make the modality-common representation of different modalities close to each other on feature distribution and semantic consistency. Finally, the compact and powerful hash codes can be generated from modality-common representation. Comprehensive evaluations conducted on three representative cross-modal benchmark datasets illustrate our method is superior to the state-of-the-art cross-modal hashing methods.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tip.2020.2963957

Cites

8 of 8 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

  • Deep Graph-neighbor Coherence Preserving Network for Unsupervised Cross-modal Hashing

    Yu, J., Zhou, H., Zhan, Y., & Tao, D. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i5.16592 · Cited by 197

    “Nevertheless, such a connection can be inferred by their neighbor coherence that both “rose” and “wedding” have high similarities of the “bride, rose”. mon spaces, and they suffer from high computation burden for a large volume of multimedia data (Feng, Wang, and Li 2014; Wang et al. 2017; Xie et al. 2020).”
    BackgroundInfluentialSelf-citation

See all 199

Metadata

Authors
Xie, D., Deng, C., Li, C., Liu, X., & Tao, D.
Venue
IEEE Transactions on Image Processing
Published
2020
Volume
29
Pages
3626-3637
ISSN
  • 1057-7149 (ISSN-L)
  • 1941-0042
OpenAlex
W2999606372
Cited by
199
References
8
FWCI
12.17
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.