Multi-Task Consistency-Preserving Adversarial Hashing for Cross-Modal Retrieval
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.
Integrity signals
Registry
Cites
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.
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
ImageNet classification with deep convolutional neural networks
Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2017) · Communications of the ACM · doi:10.1145/3065386 · Cited by 112,155
Representation Learning: A Review and New Perspectives
Bengio, Y., Courville, A., & Vincent, P. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.50 · Cited by 13,001
Unsupervised representation learning with deep convolutional generative adversarial networks
Radford, A., Metz, L., & Chintala, S. (2015) · arXiv · doi:10.48550/arxiv.1511.06434 · Cited by 12,235 · cited 1×
“With the evolution of generative adversarial networks (GANs) [36], adversarial learning has received increasing attention and achieved considerable progress in image generation [37], [38] and representation learning [39], [40].”
BackgroundConditional Generative Adversarial Nets
Mirza, M., & Osindero, S. (2014) · arXiv · doi:10.48550/arxiv.1411.1784 · Cited by 8,863
Return of the Devil in the Details: Delving Deep into Convolutional Nets
Chatfield, K., Simonyan, K., Vedaldi, A., & Zisserman, A. (2014) · Proceedings of the British Machine Vision Conference 2014 · doi:10.5244/c.28.6 · Cited by 3,335
NUS-WIDE: a real-world web image database from National University of Singapore
Chua, T.-S., Tang, J., Hong, R., Li, H., Luo, Z., & Zheng, Y. (2009) · Proceedings of the ACM International Conference on Image and Video Retrieval · doi:10.1145/1646396.1646452 · Cited by 3,025 · cited 1×
“A. Datasets and Settings 1) Datasets: We evaluate our proposed method on three popular benchmark cross-modal datasets: MIRFLICKR-25K [44], IAPRTC-12 [45] and NUS-WIDE [46]. a) MIRFLICKR-25K: This dataset consists of 25,000 images collected from Flickr website.”
MethodFeature Generating Networks for Zero-Shot Learning
Xian, Y., Lorenz, T., Schiele, B., & Akata, Z. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00581 · Cited by 1,080
Adversarial Cross-Modal Retrieval
Wang, B., Yang, Y., Xu, X., Hanjalic, A., & Shen, H. T. (2017) · Proceedings of the 25th ACM international conference on Multimedia · doi:10.1145/3123266.3123326 · Cited by 779
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
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Multi-Task Consistency-Preserving Adversarial Hashing for Cross-Modal Retrieval. https://app.cochat.ai/papers/10.1109/tip.2020.2963957
- The paper
- Xie, D., Deng, C., Li, C., Liu, X., & Tao, D. (2020). Multi-Task Consistency-Preserving Adversarial Hashing for Cross-Modal Retrieval. IEEE Transactions on Image Processing. https://doi.org/10.1109/tip.2020.2963957
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.