Domain Adaptive Land-Cover Classification via Local Consistency and Global Diversity

被引:10
作者
Ma, Ailong [1 ]
Zheng, Chenyu [2 ]
Wang, Junjue [1 ]
Zhong, Yanfei [1 ]
机构
[1] Wuhan Univ, State Key Lab Informat Engn Surveying Mapping & Re, Wuhan 430079, Peoples R China
[2] Wuhan Univ, Sch Comp Sci, Wuhan 430079, Peoples R China
来源
IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING | 2023年 / 61卷
基金
中国国家自然科学基金;
关键词
Task analysis; Training; Entropy; Remote sensing; Diversity reception; Semantic segmentation; Semantics; Consistency and diversity; high-resolution remote sensing (HRS) images; land-cover classification; unsupervised domain adaptation (UDA);
D O I
10.1109/TGRS.2023.3265186
中图分类号
P3 [地球物理学]; P59 [地球化学];
学科分类号
0708 ; 070902 ;
摘要
Unsupervised domain adaptive land-cover classification has recently gained more and more attention. Unsupervised domain adaptation (UDA) aims to learn a model from the annotated source data and the unlabeled target data that can perform well on the target domain. The existing UDA frameworks based on adversarial training and self-training methods have boosted this field a lot. However, these methods almost all originate from the computer vision field, and they ignore the very nature of high-resolution remote sensing (HRS) images. The core insight of this article is that a good land-cover classification result always has strong local consistency and good global diversity, which makes it possible to construct a metric representing the properties of good land-cover mapping, to improve the existing UDA algorithms. First, based on this finding, we prove that local consistency and global diversity can be measured by the Frobenius norm and nuclear norm, respectively. Second, we propose a novel local consistency and global diversity metric (LCGDM), which can be easily integrated into the existing UDA frameworks. Finally, the experiments conducted on the LoveDA dataset prove the validity of the proposed metric, which can not only improve the overall land-cover mapping but also the categorywise prediction.
引用
收藏
页数:17
相关论文
共 52 条
[1]  
Boyd S., 2004, CONVEX OPTIMIZATION, DOI [DOI 10.1017/CBO9780511804441, 10.1017/CBO9780511804441]
[2]  
Chen LC, 2017, Arxiv, DOI arXiv:1706.05587
[3]   DeepLab: Semantic Image Segmentation with Deep Convolutional Nets, Atrous Convolution, and Fully Connected CRFs [J].
Chen, Liang-Chieh ;
Papandreou, George ;
Kokkinos, Iasonas ;
Murphy, Kevin ;
Yuille, Alan L. .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2018, 40 (04) :834-848
[4]  
Chen XY, 2019, PR MACH LEARN RES, V97
[5]  
Cui SH, 2021, Arxiv, DOI arXiv:2107.06154
[6]   Towards Discriminability and Diversity: Batch Nuclear-norm Maximization under Label Insufficient Situations [J].
Cui, Shuhao ;
Wang, Shuhui ;
Zhuo, Junbao ;
Li, Liang ;
Huang, Qingming ;
Tian, Qi .
2020 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2020, :3940-3949
[7]  
Deng J, 2009, PROC CVPR IEEE, P248, DOI 10.1109/CVPRW.2009.5206848
[8]  
Deng Xueqing, 2021, P IEEE WINT C APPL C, P2160
[9]  
Farahani A., 2021, ADV DAT SCI INF ENG, P877
[10]  
Fazel M., 2002, THESIS STANFORD U