{"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/dynamic-structured-semantic-propagation","title":"Dynamic-structured Semantic Propagation Network","arxiv_id":"1803.06067","date":"2018-03-16","proceeding":"CVPR 2018 6","authors":["Xiaodan Liang","Hongfei Zhou","Eric Xing"],"abstract":"Semantic concept hierarchy is still under-explored for semantic segmentation\ndue to the inefficiency and complicated optimization of incorporating\nstructural inference into dense prediction. This lack of modeling semantic\ncorrelations also makes prior works must tune highly-specified models for each\ntask due to the label discrepancy across datasets. It severely limits the\ngeneralization capability of segmentation models for open set concept\nvocabulary and annotation utilization. In this paper, we propose a\nDynamic-Structured Semantic Propagation Network (DSSPN) that builds a semantic\nneuron graph by explicitly incorporating the semantic concept hierarchy into\nnetwork construction. Each neuron represents the instantiated module for\nrecognizing a specific type of entity such as a super-class (e.g. food) or a\nspecific concept (e.g. pizza). During training, DSSPN performs the\ndynamic-structured neuron computation graph by only activating a sub-graph of\nneurons for each image in a principled way. A dense semantic-enhanced neural\nblock is proposed to propagate the learned knowledge of all ancestor neurons\ninto each fine-grained child neuron for feature evolving. Another merit of such\nsemantic explainable structure is the ability of learning a unified model\nconcurrently on diverse datasets by selectively activating different neuron\nsub-graphs for each annotation at each step. Extensive experiments on four\npublic semantic segmentation datasets (i.e. ADE20K, COCO-Stuff, Cityscape and\nMapillary) demonstrate the superiority of our DSSPN over state-of-the-art\nsegmentation models. Moreoever, we demonstrate a universal segmentation model\nthat is jointly trained on diverse datasets can surpass the performance of the\ncommon fine-tuning scheme for exploiting multiple domain knowledge.","url_abs":"http://arxiv.org/abs/1803.06067v1","url_pdf":"http://arxiv.org/pdf/1803.06067v1.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":[],"tasks":[{"task_slug":"segmentation","task_name":"Segmentation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"},{"task_slug":"universal-segmentation","task_name":"Universal Segmentation"}],"methods":[{"method_slug":"1x1-convolution","method_name":"1x1 Convolution"},{"method_slug":"average-pooling","method_name":"Average Pooling"},{"method_slug":"batch-normalization","method_name":"Batch Normalization"},{"method_slug":"bottleneck-residual-block","method_name":"Bottleneck Residual Block"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"global-average-pooling","method_name":"Global Average Pooling"},{"method_slug":"kaiming-initialization","method_name":"Kaiming Initialization"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"residual-block","method_name":"Residual Block"},{"method_slug":"residual-connection","method_name":"Residual Connection"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/semantic-segmentation-on-ade20k","task":"Semantic Segmentation","dataset":"ADE20K","model":"DSSPN (ResNet-101)","rank_in_archive_order":207,"of":235,"metrics":{"Validation mIoU":"43.68"},"uses_additional_data":false},{"leaderboard":"/sota/semantic-segmentation-on-ade20k-val","task":"Semantic Segmentation","dataset":"ADE20K val","model":"DSSPN (ResNet-101)","rank_in_archive_order":89,"of":95,"metrics":{"mIoU":"43.68"},"uses_additional_data":false},{"leaderboard":"/sota/semantic-segmentation-on-cityscapes","task":"Semantic Segmentation","dataset":"Cityscapes test","model":"DSSPN (ResNet-101)","rank_in_archive_order":62,"of":105,"metrics":{"Mean IoU (class)":"77.8%"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1803.06067","atlas_url":"https://app.syntology.ai/?focus=1803.06067","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_citation_path","arguments":{"paper_1":"1803.06067"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1803.06067\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1803.06067"},"call":"get_concepts_for_paper(arxiv_id=\"1803.06067\")"}],"by_repo":[],"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"},"code_links_note":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"eba9663470f5f7aa81710bbd2db676b98d15d628fbf1282d5a5ca4f1af0c840d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}