{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/semi-supervised-semantic-segmentation-with-6","title":"Semi-supervised Semantic Segmentation with Prototype-based Consistency Regularization","arxiv_id":"2210.04388","date":"2022-10-10","proceeding":null,"authors":["Hai-Ming Xu","Lingqiao Liu","Qiuchen Bian","Zhen Yang"],"abstract":"Semi-supervised semantic segmentation requires the model to effectively propagate the label information from limited annotated images to unlabeled ones. A challenge for such a per-pixel prediction task is the large intra-class variation, i.e., regions belonging to the same class may exhibit a very different appearance even in the same picture. This diversity will make the label propagation hard from pixels to pixels. To address this problem, we propose a novel approach to regularize the distribution of within-class features to ease label propagation difficulty. Specifically, our approach encourages the consistency between the prediction from a linear predictor and the output from a prototype-based predictor, which implicitly encourages features from the same pseudo-class to be close to at least one within-class prototype while staying far from the other between-class prototypes. By further incorporating CutMix operations and a carefully-designed prototype maintenance strategy, we create a semi-supervised semantic segmentation algorithm that demonstrates superior performance over the state-of-the-art methods from extensive experimental evaluation on both Pascal VOC and Cityscapes benchmarks.","url_abs":"https://arxiv.org/abs/2210.04388v1","url_pdf":"https://arxiv.org/pdf/2210.04388v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"semi-supervised-semantic-segmentation-with-6","repo_url":"https://github.com/heimingx/semi_seg_proto","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"mindspore","reach":{"status":"ok"}}],"tasks":[{"task_slug":"diversity","task_name":"Diversity"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"},{"task_slug":"semi-supervised-semantic-segmentation","task_name":"Semi-Supervised Semantic Segmentation"}],"methods":[{"method_slug":"cutmix","method_name":"CutMix"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/semi-supervised-semantic-segmentation-on-2","task":"Semi-Supervised Semantic Segmentation","dataset":"Cityscapes 12.5% labeled","model":"PCR (DeepLab v3+ with ResNet-101 pretraind on ImageNet-1K)","rank_in_archive_order":17,"of":33,"metrics":{"Validation mIoU":"76.31%"},"uses_additional_data":false},{"leaderboard":"/sota/semi-supervised-semantic-segmentation-on-1","task":"Semi-Supervised Semantic Segmentation","dataset":"Cityscapes 25% labeled","model":"PCR (DeepLab v3+ with ResNet-101 pretraind on ImageNet-1K)","rank_in_archive_order":15,"of":30,"metrics":{"Validation mIoU":"78.4%"},"uses_additional_data":false},{"leaderboard":"/sota/semi-supervised-semantic-segmentation-on-8","task":"Semi-Supervised Semantic Segmentation","dataset":"Cityscapes 50% labeled","model":"PCR (DeepLab v3+ with ResNet-101 pretraind on ImageNet-1K)","rank_in_archive_order":15,"of":23,"metrics":{"Validation mIoU":"79.11%"},"uses_additional_data":false},{"leaderboard":"/sota/semi-supervised-semantic-segmentation-on-22","task":"Semi-Supervised Semantic Segmentation","dataset":"Cityscapes 6.25% labeled","model":"PCR (DeepLab v3+ with ResNet-101 pretraind on ImageNet-1K)","rank_in_archive_order":14,"of":18,"metrics":{"Validation mIoU":"73.41%"},"uses_additional_data":false},{"leaderboard":"/sota/semi-supervised-semantic-segmentation-on-9","task":"Semi-Supervised Semantic Segmentation","dataset":"PASCAL VOC 2012 25% labeled","model":"PCR (DeepLab v3+ with ResNet-101 pretraind on ImageNet-1K)","rank_in_archive_order":7,"of":27,"metrics":{"Validation mIoU":"80.78"},"uses_additional_data":false},{"leaderboard":"/sota/semi-supervised-semantic-segmentation-on-15","task":"Semi-Supervised Semantic Segmentation","dataset":"PASCAL VOC 2012 50%","model":"PCR (DeepLab v3+ with ResNet-101 pretraind on ImageNet-1K)","rank_in_archive_order":2,"of":14,"metrics":{"Validation mIoU":"80.91%"},"uses_additional_data":false},{"leaderboard":"/sota/semi-supervised-semantic-segmentation-on-4","task":"Semi-Supervised Semantic Segmentation","dataset":"Pascal VOC 2012 12.5% labeled","model":"PCR (DeepLab v3+ with ResNet-101 pretraind on ImageNet-1K)","rank_in_archive_order":8,"of":38,"metrics":{"Validation mIoU":"80.71%"},"uses_additional_data":false},{"leaderboard":"/sota/semi-supervised-semantic-segmentation-on-21","task":"Semi-Supervised Semantic Segmentation","dataset":"Pascal VOC 2012 6.25% labeled","model":"PCR (DeepLab v3+ with ResNet-101 pretraind on ImageNet-1K)","rank_in_archive_order":9,"of":19,"metrics":{"Validation mIoU":"78.6"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2210.04388","atlas_url":"https://app.syntology.ai/?focus=2210.04388","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_reference_implementation","arguments":{"name":"Prototype-based Consistency Regularization"},"call":"get_reference_implementation(name='Prototype-based Consistency Regularization')","min_level":{"quoted_from_server_card":["It REFUSES rather than serving below min_level, and the refusal names the highest level that exists","so lowering min_level is a deliberate, informed choice, not a guess."],"default_on_card":2,"server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","this_implementation_level":2}},{"tool":"get_citation_path","arguments":{"paper_1":"2210.04388"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2210.04388\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2210.04388"},"call":"get_concepts_for_paper(arxiv_id=\"2210.04388\")"}],"reference_implementation":[{"method_name":"Prototype-based Consistency Regularization","assembly_sha256":"de60d60eaa07dfda","source":"generated from the paper text (not the authors' code)","level":2,"level_is_quoted_from_server_card":[{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]}],"server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","no_rung":"No rung compares this code against the authors' implementation","no_rung_quoted_from_server_card":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results.","retrieve_with":"get_reference_implementation(name='Prototype-based Consistency Regularization')","have_check":{"url":"https://syntology.ai/api/graph/have?x=2210.04388","call":"have('2210.04388')","in_build_sample":false}}],"reference_implementation_is":"Syntology's reference implementation of this paper's method: code Syntology generated from the paper text (not the authors' code), at the level its own end-to-end run recorded (the assembly's own level, never averaged); the level's meaning is quoted from Syntology's server card, and nothing here says the code is correct or reproduces the paper's results","by_repo":[{"repo":"heimingx/semi_seg_proto","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","assemblies":[{"assembly_sha256":"de60d60eaa07dfda","source_kind":"generated","method_name":"Prototype-based Consistency Regularization","realizes_method":"Prototype-based Consistency Regularization","graph_method":"Prototype-based Consistency Regularization","realizes_severed":false,"claim":"Update class prototypes using exponential moving average from Eq. (11). Input 'prototypes' is a (C, D) array where C is number of classes and D is feature dimension, representing current prototype vectors. Input 'features' is an (N, D) array of N feature vectors with dimension D. Input 'labels' is a","centrality":"contribution","entry":"update_prototypes_ema","entry_sha256":"e5c88f51fd471dab3c7775ceda41299f69399fdfb1b12384d49e7173357d7d3c","n_bricks":1,"bricks":[{"entry":"update_prototypes_ema","code_sha256":"e5c88f51fd471dab3c7775ceda41299f69399fdfb1b12384d49e7173357d7d3c","role":"entry","order":0,"level":2,"status":"ran"}],"ran_individually":1,"ran_individually_constructed":null,"ran_individually_by_status":{"ran":1},"end_to_end":{"ran":true,"level":2,"against_independent_peer":true,"n_peers":1,"v3_tests_passed_both_sides":0,"means":"this assembly is a single routine, so the entry brick's verification IS the assembly's: it executed and two family-independent implementations agreed"},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"construction","claim_match_judges":["construction:spec_drafted_for_this_method"],"label_verdict":"matches","label_verdict_judged":false,"suggested_method":null,"batch_at":"2026-09-07T20:44:12+00:00","sibling_group":"fb1b0c361c13","n_siblings":0,"retention":"keep","provenance":"assembly:generated_reference_impl_v1","attached_at":"2026-09-07T20:44:12+00:00","attached_provenance":"assembly:generated_reference_impl_v1"}],"assembly_sibling_groups":[{"group":"fb1b0c361c13","realizes_method":"Prototype-based Consistency Regularization","source_kind":"generated","batch_at":"2026-09-07T20:44:12+00:00","members":["de60d60eaa07dfda"]}],"assemblies_is":{"about":"What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results.","harvested":"assembled from code harvested from a repository linked to the paper","generated":"generated from the paper text, not the repository's code","end_to_end":"for a harvested assembly, the assembly has not been run end-to-end; for a generated one, end_to_end.level is the assembly's own level and against_independent_peer says whether it ran against a peer: an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists","bricks_level":"each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level","ran_individually":"a COUNT of bricks that ran on their own on a fixture (split by status in ran_individually_by_status), not a level; instrument statuses are failures of Syntology's instrument, not of the code","siblings":"assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another","judged":"Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as \"by construction\" or \"not judged by a model\"","level_lowered":"a generated assembly whose level Syntology's graph lowered, with the level it had, the recorded reason and when","retention":"Syntology's spending triage for further verification, not a verdict","claim_match":"the claim_match vote: IMPLEMENTS, COMPONENT or UNCLEAR. Where claim_match_basis is \"judge:<model>\", it is one model's judgement of the assembly's label against the paper's claim (claim_match_rule single_judge, the model in claim_match_judges): not a verification and not a run. Where it is \"construction\", the value was set when the code was generated for this method and no model judged it, whatever claim_match_rule says. The page prints no claim match for any assembly","label_verdict":"whether the assembly's code is the method it is labelled with: matches, cannot_tell, mislabelled (suggested_method names what it looks like instead) or not_the_method; label_verdict_judged is true only when a model read the code (claim_match_basis \"judge:<model>\")","label_verdict_judged":"where true (claim_match_basis \"judge:<model>\"), label_verdict is a single model's judgement; not calibrated; not printed on the page; where false, it was set by construction, and the page prints it unless the node is shared with another paper (node_properties_written_for)","claim":"the claim text stored on the assembly node: for a harvested assembly, what the paper claims the code implements, as the lifting model wrote it; for a generated one, the specification the code was generated from. Not verified text","centrality":"how central the lifted method is to the paper, as the lifting step recorded it: contribution, component or incidental","v3_tests_passed_both_sides":"end_to_end.v3_tests_passed_both_sides: the number of property tests derived from the paper that passed on both implementations, as the attached report lists them; a level 3 card with 0 says its report lists none","ran_individually_constructed":"ran_individually_constructed: of the bricks counted in ran_individually, how many constructed an object rather than computing a result (Syntology's RAN record's rule, read from the graph-layer sample with the brick's code_sha256); a part of ran_individually, never subtracted from it and never a failure; null where a brick that ran has no sample in the graph layer this build read, so the figure was not counted"},"assemblies_call":{"tool":"assembly","arguments":{"arxiv_id":"2210.04388"},"call":"assembly(arxiv_id=\"2210.04388\")"}},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"654d065bbcdccd32ceaee2f24ac61049659d7cebb4819178fafba9a4c26e7c7e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}