FastFCN: Rethinking Dilated Convolution in the Backbone for Semantic Segmentation

28 Mar 2019  ·  Huikai Wu, Junge Zhang, Kaiqi Huang, Kongming Liang, Yizhou Yu ·

Modern approaches for semantic segmentation usually employ dilated convolutions in the backbone to extract high-resolution feature maps, which brings heavy computation complexity and memory footprint. To replace the time and memory consuming dilated convolutions, we propose a novel joint upsampling module named Joint Pyramid Upsampling (JPU) by formulating the task of extracting high-resolution feature maps into a joint upsampling problem. With the proposed JPU, our method reduces the computation complexity by more than three times without performance loss. Experiments show that JPU is superior to other upsampling modules, which can be plugged into many existing approaches to reduce computation complexity and improve performance. By replacing dilated convolutions with the proposed JPU module, our method achieves the state-of-the-art performance in Pascal Context dataset (mIoU of 53.13%) and ADE20K dataset (final score of 0.5584) while running 3 times faster.

PDF Abstract
Task Dataset Model Metric Name Metric Value Global Rank Result Benchmark
Semantic Segmentation ADE20K EncNet + JPU Validation mIoU 44.34 # 194
Test Score 55.84 # 5
Semantic Segmentation PASCAL Context Joint Pyramid Upsampling + EncNet mIoU 53.1 # 40


No methods listed for this paper. Add relevant methods here