• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Liu Huan, Zheng Qinghua, Luo Minnan, Zhao Hongke, Xiao Yang, Lü Yanzhang. Cross-Domain Adversarial Learning for Zero-Shot Classification[J]. Journal of Computer Research and Development, 2019, 56(12): 2521-2535. DOI: 10.7544/issn1000-1239.2019.20190614
Citation: Liu Huan, Zheng Qinghua, Luo Minnan, Zhao Hongke, Xiao Yang, Lü Yanzhang. Cross-Domain Adversarial Learning for Zero-Shot Classification[J]. Journal of Computer Research and Development, 2019, 56(12): 2521-2535. DOI: 10.7544/issn1000-1239.2019.20190614

Cross-Domain Adversarial Learning for Zero-Shot Classification

More Information
  • Published Date: November 30, 2019
  • Zero-shot learning (ZSL) aims to recognize novel categories, which have few or even no sample for training and follow a different distribution from seen classes. With the recent advances of deep neural networks on cross-modal generation, encouraging breakthroughs have been achieved on classifying unseen categories with their synthetic samples. Extant methods synthesize unseen samples with the combination of generative adversarial nets (GANs) and variational auto-encoder (VAE) by sharing the generator and the decoder. However, due to the different data distributions produced by these two kinds of generative models, fake samples synthesized by the joint model follow the complex multi-domain distribution instead of satisfying a single model distribution. To address this issue, in this paper we propose a cross-domain adversarial generative network (CrossD-AGN) to integrate the traditional GANs and VAE into a unified framework, which is able to generate unseen samples based on the class-level semantics for zero-shot classification. We propose two symmetric cross-domain discriminators along with the cross-domain adversarial learning mechanism to learn to determine whether a synthetic sample is from the generator-domain or the decoder-domain distribution, so as to drive the generator/decoder of the joint model to improve its capacity of synthesizing fake samples. Extensive experimental results over several real-world datasets demonstrate the effectiveness and superiority of the proposed model on zero-shot visual classification.
  • Related Articles

    [1]Bai Tian, Xiao Mingyu. Computational Complexity of Feedback Set and Subset Feedback Set Problems: A Survey[J]. Journal of Computer Research and Development, 2025, 62(1): 104-118. DOI: 10.7544/issn1000-1239.202330693
    [2]Zhang Tianming, Zhao Jie, Jin Lu, Chen Lu, Cao Bin, Fan Jing. Vertex Betweenness Centrality Computation Method over Temporal Graphs[J]. Journal of Computer Research and Development, 2023, 60(10): 2383-2393. DOI: 10.7544/issn1000-1239.202220650
    [3]Zhu Xia, Luo Junzhou, Song Aibo, and Dong Fang. A Multi-Dimensional Indexing for Complex Query in Cloud Computing[J]. Journal of Computer Research and Development, 2013, 50(8): 1592-1603.
    [4]Wang Zhuxiao, Hu Hong, Chen Limin, Shi Zhongzhi. Parallel Computation Techniques for Dynamic Description Logics Reasoning[J]. Journal of Computer Research and Development, 2011, 48(12): 2317-2325.
    [5]Zhang Yu, Liu Ping, Liu Yanbing, Tan Jianlong, Guo Li. Algorithmic Complexity Attacks Against WuManber[J]. Journal of Computer Research and Development, 2011, 48(8): 1381-1389.
    [6]Lu Jiyuan, Zhang Peizhao, Duan Xiaohua, Chao Hongyang. An Optimized Motion Estimation Algorithm Based on Macroblock Priorities[J]. Journal of Computer Research and Development, 2011, 48(3): 494-500.
    [7]Lin Xin, Li Shanping, Yang Zhaohui, Xu Jian. A Reasoning-Oriented Context Replacement Algorithm in Pervasive Computing[J]. Journal of Computer Research and Development, 2009, 46(4): 549-557.
    [8]Huang Han, Hao Zhifeng, Qin Yong. Time Complexity of Evolutionary Programming[J]. Journal of Computer Research and Development, 2008, 45(11): 1850-1857.
    [9]Tian Mei, Luo Siwei, Huang Yaping, and Zhao Jiali. Extracting Bottom-Up Attention Information Based on Local Complexity and Early Visual Features[J]. Journal of Computer Research and Development, 2008, 45(10): 1739-1746.
    [10]Pan Rui, Zhu Daming, and Ma Shaohan. Research on Computational Complexity and Approximation Algorithm for General Facility Location Problem[J]. Journal of Computer Research and Development, 2007, 44(5): 790-797.

Catalog

    Article views (1421) PDF downloads (670) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return