{"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/comma-propagating-complementary-multi-level","title":"COMMA: Propagating Complementary Multi-Level Aggregation Network for Polyp Segmentation","arxiv_id":null,"date":"2022-02-17","proceeding":"Applied Sciences 2022 2","authors":["WooSeok Shin","Min Seok Lee","Sung Won Han"],"abstract":"Colonoscopy is an effective method for detecting polyps to prevent colon cancer. Existing studies have achieved satisfactory polyp detection performance by aggregating low-level boundary and high-level region information in convolutional neural networks (CNNs) for precise polyp segmentation in colonoscopy images. However, multi-level aggregation provides limited polyp segmentation owing to the distribution discrepancy that occurs when integrating different layer representations. To address this problem, previous studies have employed complementary low- and high-level representations. In contrast to existing methods, we focus on propagating complementary information such that the complementary low-level explicit boundary with abstracted high-level representations diminishes the discrepancy. This study proposes COMMA, which propagates complementary multi-level aggregation to reduce distribution discrepancies. COMMA comprises a complementary masking module (CMM) and a boundary propagation module (BPM) as a multi-decoder. The CMM masks the low-level boundary noises through the abstracted high-level representation and leverages the masked information at both levels. Similarly, the BPM incorporates the lowest- and highest-level representations to obtain explicit boundary information and propagates the boundary to the CMMs to improve polyp detection. CMMs can discriminate polyps more elaborately than prior CMMs based on boundary and complementary representations. Moreover, we propose a hybrid loss function to mitigate class imbalance and noisy annotations in polyp segmentation. To evaluate the COMMA performance, we conducted experiments on five benchmark datasets using five metrics. The results proved that the proposed network outperforms state-of-the-art methods in terms of all datasets. Specifically, COMMA improved mIoU performance by 0.043 on average for all datasets compared to the existing state-of-the-art methods.","url_abs":"https://www.mdpi.com/2076-3417/12/4/2114","url_pdf":"https://www.mdpi.com/2076-3417/12/4/2114","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":"medical-image-segmentation","task_name":"Medical Image Segmentation"},{"task_slug":"segmentation","task_name":"Segmentation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/medical-image-segmentation-on-cvc-clinicdb","task":"Medical Image Segmentation","dataset":"CVC-ClinicDB","model":"COMMA (Res2Net-50)","rank_in_archive_order":28,"of":48,"metrics":{"Average MAE":"0.007","S-Measure":"0.956","mIoU":"0.891","max E-Measure":"0.985","mean Dice":"0.933"},"uses_additional_data":false},{"leaderboard":"/sota/medical-image-segmentation-on-cvc-clinicdb","task":"Medical Image Segmentation","dataset":"CVC-ClinicDB","model":"COMMA (ResNet-50)","rank_in_archive_order":38,"of":48,"metrics":{"Average MAE":"0.008","S-Measure":"0.947","mIoU":"0.871","max E-Measure":"0.979","mean Dice":"0.916"},"uses_additional_data":false},{"leaderboard":"/sota/medical-image-segmentation-on-cvc-colondb","task":"Medical Image Segmentation","dataset":"CVC-ColonDB","model":"COMMA (Res2Net-50)","rank_in_archive_order":21,"of":25,"metrics":{"Average MAE":"0.037","S-Measure":"0.849","mIoU":"0.689","max E-Measure":"0.897","mean Dice":"0.754"},"uses_additional_data":false},{"leaderboard":"/sota/medical-image-segmentation-on-etis","task":"Medical Image Segmentation","dataset":"ETIS-LARIBPOLYPDB","model":"COMMA (Res2Net-50)","rank_in_archive_order":20,"of":25,"metrics":{"Average MAE":"0.015","S-Measure":"0.844","mIoU":"0.648","max E-Measure":"0.887","mean Dice":"0.711"},"uses_additional_data":false},{"leaderboard":"/sota/medical-image-segmentation-on-kvasir-seg","task":"Medical Image Segmentation","dataset":"Kvasir-SEG","model":"COMMA (ResNet-50)","rank_in_archive_order":39,"of":58,"metrics":{"Average MAE":"0.024","S-Measure":"0.925","mIoU":"0.860","max E-Measure":"0.963","mean Dice":"0.904"},"uses_additional_data":false},{"leaderboard":"/sota/medical-image-segmentation-on-kvasir-seg","task":"Medical Image Segmentation","dataset":"Kvasir-SEG","model":"COMMA (Res2Net-50)","rank_in_archive_order":42,"of":58,"metrics":{"Average MAE":"0.027","S-Measure":"0.919","mIoU":"0.852","max E-Measure":"0.951","mean Dice":"0.901"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"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":"f17d9ad0ba0aeabccc8dfaf8fe221090edc37b121cdc28a494852af4a87ae116","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}