{"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/shallow-attention-network-for-polyp","title":"Shallow Attention Network for Polyp Segmentation","arxiv_id":"2108.00882","date":"2021-08-02","proceeding":null,"authors":["Jun Wei","Yiwen Hu","Ruimao Zhang","Zhen Li","S. Kevin Zhou","Shuguang Cui"],"abstract":"Accurate polyp segmentation is of great importance for colorectal cancer diagnosis. However, even with a powerful deep neural network, there still exists three big challenges that impede the development of polyp segmentation. (i) Samples collected under different conditions show inconsistent colors, causing the feature distribution gap and overfitting issue; (ii) Due to repeated feature downsampling, small polyps are easily degraded; (iii) Foreground and background pixels are imbalanced, leading to a biased training. To address the above issues, we propose the Shallow Attention Network (SANet) for polyp segmentation. Specifically, to eliminate the effects of color, we design the color exchange operation to decouple the image contents and colors, and force the model to focus more on the target shape and structure. Furthermore, to enhance the segmentation quality of small polyps, we propose the shallow attention module to filter out the background noise of shallow features. Thanks to the high resolution of shallow features, small polyps can be preserved correctly. In addition, to ease the severe pixel imbalance for small polyps, we propose a probability correction strategy (PCS) during the inference phase. Note that even though PCS is not involved in the training phase, it can still work well on a biased model and consistently improve the segmentation performance. Quantitative and qualitative experimental results on five challenging benchmarks confirm that our proposed SANet outperforms previous state-of-the-art methods by a large margin and achieves a speed about 72FPS.","url_abs":"https://arxiv.org/abs/2108.00882v1","url_pdf":"https://arxiv.org/pdf/2108.00882v1.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":"shallow-attention-network-for-polyp","repo_url":"https://github.com/weijun88/sanet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"segmentation","task_name":"Segmentation"},{"task_slug":"video-polyp-segmentation","task_name":"Video Polyp Segmentation"}],"methods":[{"method_slug":"sanet","method_name":"SANet"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/video-polyp-segmentation-on-sun-seg-easy","task":"Video Polyp Segmentation","dataset":"SUN-SEG-Easy (Unseen)","model":"SANet","rank_in_archive_order":11,"of":18,"metrics":{"Dice":"0.649","S measure":"0.720","Sensitivity":"0.521","mean E-measure":"0.745","mean F-measure":"0.634","weighted F-measure":"0.566"},"uses_additional_data":false},{"leaderboard":"/sota/video-polyp-segmentation-on-sun-seg-hard","task":"Video Polyp Segmentation","dataset":"SUN-SEG-Hard (Unseen)","model":"SANet","rank_in_archive_order":13,"of":18,"metrics":{"Dice":"0.598","S-Measure":"0.706","Sensitivity":"0.505","mean E-measure":"0.743","mean F-measure":"0.580","weighted F-measure":"0.526"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2108.00882","atlas_url":"https://app.syntology.ai/?focus=2108.00882","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":"2108.00882"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2108.00882\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2108.00882"},"call":"get_concepts_for_paper(arxiv_id=\"2108.00882\")"}],"by_repo":[{"repo":"weijun88/sanet","kind":"listed","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"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"770b5ea27f7e3bfbb7d03724fb578accb024d65c38dd17cd98a990ecd271be81","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}