计算机科学
种植
分割
趋同(经济学)
培训(气象学)
人工智能
采样(信号处理)
样品(材料)
图像分割
机器学习
数据挖掘
模式识别(心理学)
计算机视觉
农业
化学
经济
物理
气象学
滤波器(信号处理)
生物
经济增长
色谱法
生态学
作者
Lianlei Shan,Zhao Guiqin,Jun Xie,Peirui Cheng,Xiaobin Li,Zhepeng Wang
标识
DOI:10.1109/lgrs.2023.3327390
摘要
Large-size images cannot be directly put into GPU for training and need to be cropped to patches due to GPU memory limitation. The commonly used cropping methods before are random cropping and sequential cropping, which are crude and fatally inefficient. Firstly, categories of datasets are often imbalanced, and just simple cropping misses an excellent opportunity to make the data distribution balanced. Secondly, the training needs to crop a large number of patches to cover all patterns, which greatly increases the training time. This problem is of great practical hazards but is often overlooked by previous works. The optimal solution is to generate valuable patches. Valuable patches refer to the value to network training, i.e., the value of this patch for the convergence of the network, and the improvement of the accuracy. To this end, we propose a data-related patch proposal strategy to sample high valuable patches. The core idea is to score each patch according to the accuracy of each category, so as to perform balanced sampling. Compared with random cropping or sequential cropping, our method can improve the segmentation accuracy and accelerate the training vastly. Moreover, our method also shows great advantages over the loss-based balanced approaches. Experiments on Deepglobe and Potsdam show the excellent effect of our method.
科研通智能强力驱动
Strongly Powered by AbleSci AI