DDUNet: Dual Dynamic U-Net for Highly-Efficient Cloud Segmentation

Yijie Li, Hewei Wang, Jinfeng Xu, Puzhen Wu, Yunzhong Xiao +2 more
1/26/2025
cs.CVeess.IV

No official code found. Best implementation: Att100/DDUNet (5 stars, last commit 2025-08-06).

Abstract

Cloud segmentation amounts to separating cloud pixels from non-cloud pixels in an image. Current deep learning methods for cloud segmentation suffer from three issues. (a) Constrain on their receptive field due to the fixed size of the convolution kernel. (b) Lack of robustness towards different scenarios. (c) Requirement of a large number of parameters and limitations for real-time implementation. To address these issues, we propose a Dual Dynamic U-Net (DDUNet) for supervised cloud segmentation. The DDUNet adheres to a U-Net architecture and integrates two crucial modules: the dynamic multi-scale convolution (DMSC), improving merging features under different reception fields, and the dynamic weights and bias generator (DWBG) in classification layers to enhance generalization ability. More importantly, owing to the use of depth-wise convolution, the DDUNet is a lightweight network that can achieve 95.3% accuracy on the SWINySEG dataset with only 0.33M parameters, and achieve superior performance over three different configurations of the SWINySEg dataset in both accuracy and efficiency.

View on arXivView PDF

Code Implementations(1)

Att100/DDUNetCommunity100%
51Python, Jupyter NotebookDec 25, 20241 years ago

Similar Papers

Cite this paper

@article{li2025ddunet,
  title  = {DDUNet: Dual Dynamic U-Net for Highly-Efficient Cloud Segmentation},
  author = {Yijie Li and Hewei Wang and Jinfeng Xu and Puzhen Wu and Yunzhong Xiao and Shaofan Wang and Soumyabrata Dev},
  year   = {2025},
  eprint = {2501.15385},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.15385v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2501.15385.svg)](https://codeofpaper.com/paper/2501.15385)

Discussion