Papers › Multi-Anchor Active Domain Adaptation for Semantic Segmentation

Multi-Anchor Active Domain Adaptation for Semantic Segmentation

18 Aug 2021ICCV 2021 10arXiv:2108.08012archive 2025-07-28

Munan Ning, Donghuan Lu, Dong Wei, Cheng Bian, Chenglang Yuan, Shuang Yu, Kai Ma, Yefeng Zheng

Unsupervised domain adaption has proven to be an effective approach for alleviating the intensive workload of manual annotation by aligning the synthetic source-domain data and the real-world target-domain samples. Unfortunately, mapping the target-domain distribution to the source-domain unconditionally may distort the essential structural information of the target-domain data. To this end, we firstly propose to introduce a novel multi-anchor based active learning strategy to assist domain adaptation regarding the semantic segmentation task. By innovatively adopting multiple anchors instead of a single centroid, the source domain can be better characterized as a multimodal distribution, thus more representative and complimentary samples are selected from the target domain. With little workload to manually annotate these active samples, the distortion of the target-domain distribution can be effectively alleviated, resulting in a large performance gain. The multi-anchor strategy is additionally employed to model the target-distribution. By regularizing the latent representation of the target samples compact around multiple anchors through a novel soft alignment loss, more precise segmentation can be achieved. Extensive experiments are conducted on public datasets to demonstrate that the proposed approach outperforms state-of-the-art methods significantly, along with thorough ablation study to verify the effectiveness of each component.

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="2108.08012")

Code

Syntology Ran 6 of 12 code samples harvested from 2 repositories linked to this paper; 6 have no recorded run. Of those that ran: 3 ran · our draft was wrong; 3 ran with no contract checked.

By repository: official repository: 7 samples from 1 repository, 4 ran; community (archive-listed): 5 samples from 1 repository, 2 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

munanning/mada officialmentioned in papermentioned on GitHubpytorchMIT report
munanning/madav2 mentioned on GitHubpytorchMIT 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

12 samples harvested; 6 ran; 0 honoured the contract we drafted; 6 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.

3ran · our draft was wrong
3ran
6unverified

Licence: 0 of the 12 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 2 repositories linked to this paper, official or community; each sample names its own and says which. “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.

Class_Features munanning/MADA/select_active_samples.py official repository ran MIT (permissive) · f3a6086bb86995ce · report
NormalisationPoolingFunction munanning/MADA/select_active_samples.py official repository ran MIT (permissive) · daf02aef604440a9 · report
get_scheduler munanning/mada/models/networks.py official repository ran · our draft was wrong MIT (permissive) · 62a8cdfdb51ec275 · report
normalisation_pooling munanning/MADA/select_active_samples.py official repository ran fingerprinted MIT (permissive) · 9032dc1e1e618038 · report
bootstrapped_cross_entropy2d munanning/mada/loss/loss.py official repository unverified MIT (permissive) · dfe03b9cbc5639c5 · report
cross_entropy2d munanning/mada/loss/loss.py official repository unverified MIT (permissive) · 57b36a6b7f29df1a · report
multi_scale_cross_entropy2d munanning/mada/loss/loss.py official repository unverified MIT (permissive) · 6ceebb622653f267 · report
get_norm_layer munanning/madav2/models/networks.py community (archive-listed) ran · our draft was wrong MIT (permissive) · 05f3653dd76468d9 · report
init_net munanning/madav2/models/networks.py community (archive-listed) ran · our draft was wrong MIT (permissive) · bf329cef80ee24c5 · report
cross_entropy2d munanning/madav2/loss/loss.py community (archive-listed) unverified MIT (permissive) · 4865609e5a035433 · report
get_criterion munanning/madav2/loss/loss.py community (archive-listed) unverified MIT (permissive) · 8a376f4180e6fb9c · report
multi_scale_cross_entropy2d munanning/madav2/loss/loss.py community (archive-listed) unverified MIT (permissive) · 02c66a386abd9218 · report

Tasks

Active LearningDomain AdaptationSemantic Segmentation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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