{"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/dual-graph-convolutional-network-for-semantic","title":"Dual Graph Convolutional Network for Semantic Segmentation","arxiv_id":"1909.06121","date":"2019-09-13","proceeding":null,"authors":["Li Zhang","Xiangtai Li","Anurag Arnab","Kuiyuan Yang","Yunhai Tong","Philip H. S. Torr"],"abstract":"Exploiting long-range contextual information is key for pixel-wise prediction tasks such as semantic segmentation. In contrast to previous work that uses multi-scale feature fusion or dilated convolutions, we propose a novel graph-convolutional network (GCN) to address this problem. Our Dual Graph Convolutional Network (DGCNet) models the global context of the input feature by modelling two orthogonal graphs in a single framework. The first component models spatial relationships between pixels in the image, whilst the second models interdependencies along the channel dimensions of the network's feature map. This is done efficiently by projecting the feature into a new, lower-dimensional space where all pairwise interactions can be modelled, before reprojecting into the original space. Our simple method provides substantial benefits over a strong baseline and achieves state-of-the-art results on both Cityscapes (82.0% mean IoU) and Pascal Context (53.7% mean IoU) datasets. Code and models are made available to foster any further research (\\url{https://github.com/lxtGH/GALD-DGCNet}).","url_abs":"https://arxiv.org/abs/1909.06121v3","url_pdf":"https://arxiv.org/pdf/1909.06121v3.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":"dual-graph-convolutional-network-for-semantic","repo_url":"https://github.com/lxtGH/GALD-DGCNet","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"dual-graph-convolutional-network-for-semantic","repo_url":"https://github.com/Gojay001/toolkit-DeepLearning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"dual-graph-convolutional-network-for-semantic","repo_url":"https://github.com/lxtGH/GALD-Net","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"dual-graph-convolutional-network-for-semantic","repo_url":"https://github.com/yangyucheng000/dgcnet_res101","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"mindspore","reach":null},{"paper_slug":"dual-graph-convolutional-network-for-semantic","repo_url":"https://github.com/2023-MindSpore-4/Code3/tree/main/dgcnet_res101","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"dual-graph-convolutional-network-for-semantic","repo_url":"https://github.com/jiean001/models_m/tree/main/dgcnet_res101","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"semantic-segmentation","task_name":"Semantic 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-cityscapes","task":"Semantic Segmentation","dataset":"Cityscapes test","model":"DGCNet (ResNet-101)","rank_in_archive_order":32,"of":105,"metrics":{"Mean IoU (class)":"82%"},"uses_additional_data":false},{"leaderboard":"/sota/semantic-segmentation-on-pascal-context","task":"Semantic Segmentation","dataset":"PASCAL Context","model":"DGCNet (MS, ResNet-101)","rank_in_archive_order":40,"of":66,"metrics":{"mIoU":"53.7"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1909.06121","atlas_url":"https://app.syntology.ai/?focus=1909.06121","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":"1909.06121"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1909.06121\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1909.06121"},"call":"get_concepts_for_paper(arxiv_id=\"1909.06121\")"}],"by_repo":[{"repo":"lxtGH/GALD-DGCNet","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1909.07229","2107.13154"],"harvested_for_calls":[{"arxiv_id":"1909.07229","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1909.07229"},"call":"get_harvested_code_for_paper(arxiv_id=\"1909.07229\")"},{"arxiv_id":"2107.13154","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2107.13154"},"call":"get_harvested_code_for_paper(arxiv_id=\"2107.13154\")"}]},{"repo":"Gojay001/toolkit-DeepLearning","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1505.04597","2103.14030"],"harvested_for_calls":[{"arxiv_id":"1505.04597","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1505.04597"},"call":"get_harvested_code_for_paper(arxiv_id=\"1505.04597\")"},{"arxiv_id":"2103.14030","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2103.14030"},"call":"get_harvested_code_for_paper(arxiv_id=\"2103.14030\")"}]},{"repo":"lxtGH/GALD-Net","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1909.07229"],"harvested_for_calls":[{"arxiv_id":"1909.07229","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1909.07229"},"call":"get_harvested_code_for_paper(arxiv_id=\"1909.07229\")"}]},{"repo":"yangyucheng000/dgcnet_res101","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"2023-MindSpore-4/Code3","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"jiean001/models_m","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2010.16143"],"harvested_for_calls":[{"arxiv_id":"2010.16143","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.16143"},"call":"get_harvested_code_for_paper(arxiv_id=\"2010.16143\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"2936c1066578e85a139fa39c824305074d137104a31a233d71c82f1e1a7f0d5d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}