Papers › Co-Occurrent Features in Semantic Segmentation

Co-Occurrent Features in Semantic Segmentation

1 Jun 2019CVPR 2019 6archive 2025-07-28

Hang Zhang, Han Zhang, Chenguang Wang, Junyuan Xie

Recent work has achieved great success in utilizing global contextual information for semantic segmentation, including increasing the receptive field and aggregating pyramid feature representations. In this paper, we go beyond global context and explore the fine-grained representation using co-occurrent features by introducing Co-occurrent Feature Model, which predicts the distribution of co-occurrent features for a given target. To leverage the semantic context in the co-occurrent features, we build an Aggregated Co-occurrent Feature (ACF) Module by aggregating the probability of the co-occurrent feature with the co-occurrent context. ACF Module learns a fine-grained spatial invariant representation to capture co-occurrent context information across the scene. Our approach significantly improves the segmentation results using FCN and achieves superior performance 54.0% mIoU on Pascal Context, 87.2% mIoU on Pascal VOC 2012 and 44.89% mIoU on ADE20K datasets. The source code and complete system will be publicly available upon publication.

PaperPDFCode

Syntology This paper has no arXiv id in the archive, and this site joins papers to Syntology's graph by arXiv id, so this page does not say whether the graph holds it.

Code

JanMarcelKezmann/TensorFlow-Advanced-Segmentation-Models tfSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Encoder-Decoder with Atrous Separable Convolution for Semantic Image Segmentation (arXiv:1802.02611; that paper's own run record: 44 ran (of which 17 constructed an object rather than computing a result; 28 with no instrument failure: 2 honoured, 0 violated, 26 with no contract checked; 16 where Syntology's instrument failed) · 28 unverified); nothing checks that they implement this paper's method. report
zhanghang1989/PyTorch-Encoding pytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Deep TEN: Texture Encoding Network (arXiv:1612.02844; that paper's own run record: 0 ran · 4 unverified) and ResNeSt: Split-Attention Networks (arXiv:2004.08955; that paper's own run record: 28 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 0 honoured, 0 violated, 21 with no contract checked; 7 where Syntology's instrument failed) · 20 unverified); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

SegmentationSemantic Segmentation

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Semantic Segmentation ADE20K CFNet(ResNet-101) Validation mIoU 44.89 #199 of 235 Archive leaderboard report
Semantic Segmentation PASCAL Context CFNet (ResNet-101) mIoU 54.0 #35 of 66 Archive leaderboard report
Semantic Segmentation PASCAL Context CFNet (ResNet-50) mIoU 51.5 #51 of 66 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

1x1 ConvolutionAverage PoolingBatch NormalizationBottleneck Residual BlockConvolutionFCNGlobal Average PoolingKaiming InitializationMax PoolingReLUResidual BlockResidual Connection

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections