{"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/squeeze-and-attention-networks-for-semantic","title":"Squeeze-and-Attention Networks for Semantic Segmentation","arxiv_id":"1909.03402","date":"2019-09-08","proceeding":"CVPR 2020 6","authors":["Zilong Zhong","Zhong Qiu Lin","Rene Bidart","Xiaodan Hu","Ibrahim Ben Daya","Zhifeng Li","Wei-Shi Zheng","Jonathan Li","Alexander Wong"],"abstract":"The recent integration of attention mechanisms into segmentation networks improves their representational capabilities through a great emphasis on more informative features. However, these attention mechanisms ignore an implicit sub-task of semantic segmentation and are constrained by the grid structure of convolution kernels. In this paper, we propose a novel squeeze-and-attention network (SANet) architecture that leverages an effective squeeze-and-attention (SA) module to account for two distinctive characteristics of segmentation: i) pixel-group attention, and ii) pixel-wise prediction. Specifically, the proposed SA modules impose pixel-group attention on conventional convolution by introducing an 'attention' convolutional channel, thus taking into account spatial-channel inter-dependencies in an efficient manner. The final segmentation results are produced by merging outputs from four hierarchical stages of a SANet to integrate multi-scale contexts for obtaining an enhanced pixel-wise prediction. Empirical experiments on two challenging public datasets validate the effectiveness of the proposed SANets, which achieves 83.2% mIoU (without COCO pre-training) on PASCAL VOC and a state-of-the-art mIoU of 54.4% on PASCAL Context.","url_abs":"https://arxiv.org/abs/1909.03402v4","url_pdf":"https://arxiv.org/pdf/1909.03402v4.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":"squeeze-and-attention-networks-for-semantic","repo_url":"https://github.com/its-mayank/SqueezeAttention-PyTorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"squeeze-and-attention-networks-for-semantic","repo_url":"https://github.com/MindCode-4/code-13/tree/main/squeeze-and-attention-networks-for-semantic","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"squeeze-and-attention-networks-for-semantic","repo_url":"https://github.com/MindCode-4/code-9/tree/main/squeeze-and-attention-networks-for-semantic","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"squeeze-and-attention-networks-for-semantic","repo_url":"https://github.com/pwc-1/Paper-9/tree/main/3/squeeze-and-attention-networks-for-semantic","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"segmentation","task_name":"Segmentation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/semantic-segmentation-on-pascal-voc-2012","task":"Semantic Segmentation","dataset":"PASCAL VOC 2012 test","model":"SANet (pretraining on COCO dataset)","rank_in_archive_order":6,"of":51,"metrics":{"Mean IoU":"86.1%"},"uses_additional_data":false},{"leaderboard":"/sota/semantic-segmentation-on-pascal-voc-2012","task":"Semantic Segmentation","dataset":"PASCAL VOC 2012 test","model":"SANet","rank_in_archive_order":19,"of":51,"metrics":{"Mean IoU":"83.2%"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1909.03402","atlas_url":"https://app.syntology.ai/?focus=1909.03402","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.03402"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1909.03402\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1909.03402"},"call":"get_concepts_for_paper(arxiv_id=\"1909.03402\")"}],"by_repo":[{"repo":"its-mayank/SqueezeAttention-PyTorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MindCode-4/code-13","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2212.08663"],"harvested_for_calls":[{"arxiv_id":"2212.08663","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2212.08663"},"call":"get_harvested_code_for_paper(arxiv_id=\"2212.08663\")"}]},{"repo":"MindCode-4/code-9","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2210.09609"],"harvested_for_calls":[{"arxiv_id":"2210.09609","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2210.09609"},"call":"get_harvested_code_for_paper(arxiv_id=\"2210.09609\")"}]},{"repo":"pwc-1/Paper-9","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1909.13719"],"harvested_for_calls":[{"arxiv_id":"1909.13719","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1909.13719"},"call":"get_harvested_code_for_paper(arxiv_id=\"1909.13719\")"}]}],"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":"c14bf3d368208053a71f1c91a162ab9b57ee90c7565311366760d5643ec5e1a5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}