Papers › Dual Attention Network for Scene Segmentation

Dual Attention Network for Scene Segmentation

9 Sep 2018CVPR 2019 6arXiv:1809.02983archive 2025-07-28

Jun Fu, Jing Liu, Haijie Tian, Yong Li, Yongjun Bao, Zhiwei Fang, Hanqing Lu

In this paper, we address the scene segmentation task by capturing rich contextual dependencies based on the selfattention mechanism. Unlike previous works that capture contexts by multi-scale features fusion, we propose a Dual Attention Networks (DANet) to adaptively integrate local features with their global dependencies. Specifically, we append two types of attention modules on top of traditional dilated FCN, which model the semantic interdependencies in spatial and channel dimensions respectively. The position attention module selectively aggregates the features at each position by a weighted sum of the features at all positions. Similar features would be related to each other regardless of their distances. Meanwhile, the channel attention module selectively emphasizes interdependent channel maps by integrating associated features among all channel maps. We sum the outputs of the two attention modules to further improve feature representation which contributes to more precise segmentation results. We achieve new state-of-the-art segmentation performance on three challenging scene segmentation datasets, i.e., Cityscapes, PASCAL Context and COCO Stuff dataset. In particular, a Mean IoU score of 81.5% on Cityscapes test set is achieved without using coarse data. We make the code and trained model publicly available at https://github.com/junfu1115/DANet

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1809.02983")

Code

Syntology Ran 0 of 7 code samples harvested from 1 repository linked to this paper; 7 have no recorded run.

By repository: official repository: 7 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

junfu1115/DANet officialmentioned in papermentioned on GitHubpytorchMIT report
hbzhang/AwesomeSelfDriving mentioned on GitHub report
niecongchong/danet-keras mentioned on GitHubtf report
osmr/imgclsmob mentioned on GitHubmxnetMIT report
yiskw713/DualAttention_for_Segmentation mentioned on GitHubpytorch report
yougoforward/hlzhu_DANet_git mentioned on GitHubpytorchNOASSERTION report
zhenxingsh/Pytorch_DANet mentioned on GitHubpytorchNOASSERTION report
open-mmlab/mmsegmentation pytorchApache-2.0 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.

Code Syntology ran Syntology

7 samples harvested; 0 ran; 0 honoured the contract we drafted; 7 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

7unverified

Licence: 5 of the 7 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from junfu1115/DANet. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

get_city_pairs junfu1115/DANet/encoding/datasets/cityscapes_v0.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · ccb24f9418500942 · report
get_city_pairs junfu1115/DANet/encoding/datasets/cityscapes.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · ba3e7aabcdfce646 · report
get_deepten junfu1115/DANet/encoding/models/deepten.py official repository unverified MIT (permissive) · d8fa6abe733ae073 · report
get_deepten_resnet50_minc junfu1115/DANet/encoding/models/deepten.py official repository unverified MIT (permissive) · a67af4c02a68b8dd · report
rename_weight_for_head junfu1115/DANet/experiments/segmentation/model_mapping.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · eb69f67b45ca28a7 · report
short_hash junfu1115/DANet/encoding/models/model_store.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · e8e7fc06d9a54bbc · report
test_batchify_fn junfu1115/DANet/encoding/datasets/base.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · f8b881dae14f02c3 · report

Tasks

Scene SegmentationSegmentationSemantic SegmentationThermal Image Segmentation

1 archive task tag without a task page not shown.

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Semantic Segmentation BDD100K val DANet mIoU 62.8 #5 of 24 Archive leaderboard report
Semantic Segmentation COCO-Stuff test DANet (ResNet-101) mIoU 39.7% #14 of 21 Archive leaderboard report
Semantic Segmentation Cityscapes test DANet (ResNet-101) Mean IoU (class) 81.5% #40 of 105 Archive leaderboard report
Semantic Segmentation DADA-seg DANet mIoU 22.24 #17 of 28 Archive leaderboard report
Semantic Segmentation DensePASS DANet (ResNet-101) mIoU 28.5% #30 of 36 Archive leaderboard report
Semantic Segmentation PASCAL Context DANet (ResNet-101) mIoU 52.6 #47 of 66 Archive leaderboard report
Semantic Segmentation PASCAL VOC 2012 test DANet (ResNet-101) Mean IoU 82.6% #25 of 51 Archive leaderboard report
Semantic Segmentation Trans10K DANet GFLOPs 198.00 #6 of 15 Archive leaderboard report
Semantic Segmentation Trans10K DANet mIoU 68.81% #6 of 15 Archive leaderboard report
Thermal Image Segmentation MFN Dataset DANet mIOU 41.3 #53 of 55 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

Introduced by this paper: DANet

1x1 ConvolutionAverage PoolingBatch NormalizationBottleneck Residual BlockConvolutionDANetFCNGlobal 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