Cited by 103Advanced Image and Video Retrieval TechniquesImage Retrieval and Classification TechniquesMultimodal Machine Learning Applications

Multi-pathway generative adversarial hashing for unsupervised cross-modal retrieval

Zhang, Jian, Peng, Yuxin·2020·IEEE Transactions on Multimedia

Abstract

Cross-modal hashing aims to map heterogeneous cross-modal data into a common Hamming space, which can realize fast and flexible retrieval across different modalities. Unsupervised cross-modal hashing is more flexible and applicable than supervised methods, since no intensive labeling work is involved. However, existing unsupervised methods learn the hashing functions by preserving inter- and intra-correlations while ignoring the underlying manifold structure across different modalities, which is extremely helpful in capturing the meaningful nearest neighbors of different modalities for cross-modal retrieval. Furthermore, existing works mainly focus on pairwise relation modeling while ignoring the correlations within multiple modalities. To address the above-mentioned problems, in this paper, we propose a multi-pathwaygenerativeadversarialhashing approach for unsupervised cross-modal retrieval, which makes full use of a generative adversarial network's ability for unsupervised representation learning to exploit the underlying manifold structure of cross-modal data. The main contributions can be summarized as follows: First, we propose a multi-pathwaygenerativeadversarialnetwork to model cross-modal hashing in an unsupervised fashion. In the proposed network, given the data of one modality, the generative model tries to fit the distribution over the manifold structure and selects informative data of other modalities to challenge the discriminative model. The discriminative model learns to distinguish the generated data and the true positive data sampled from the correlation graph to achieve better retrieval accuracy. These two models are trained in an adversarial way to improve each other and promote hashing function learning. Second, we propose a correlation graph-based approach to capture the underlying manifold structure across different modalities so that data of different modalities but within the same manifold can have a smaller Hamming distance to promote retrieval accuracy. Extensive experiments compared with state-of-the-art methods on three widely used datasets verify the effectiveness of our proposed approach.

Integrity signals

Registry

Crossref · 10.1109/tmm.2019.2922128

Cites

60 of 60 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Reformer employed locality-sensitive hashing attention to reduce memory requirements for attention computation.

    “Reformer [195] employed locality-sensitive hashing (LSH Attention) to reduce memory requirements for attention computation, while Longformer [196] and Linformer [197] utilized sparse attention and low-rank projections, respectively, to decrease computational complexity, making Transformer more efficient for handling long-text sequences.”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Zhang, J., & Peng, Y.
Affiliations
Peking University (CN)
Venue
IEEE Transactions on Multimedia
Published
2020-01
Volume
22
Issue
1
Pages
174-187
ISSN
  • 1520-9210 (ISSN-L)
  • 1941-0077
OpenAlex
W2953037339
Cited by
103
References
60
Citations by year
2026: 4 · 2025: 15 · 2024: 13 · 2023: 14 · 2022: 24 · 2021: 17 · 2020: 15 · 2019: 1
FWCI
6.38
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Multimedia (publishedVersion)
Funders
National Natural Science Foundation of China (61771025)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Image and Video Retrieval Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Image Retrieval and Classification Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Multimodal Machine Learning Applications
Keywords
cross-modal hashing, unsupervised hashing, cross-modal retrieval, correlation graph, manifold structure, Hamming space, adversarial learning

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