{"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/suppress-and-balance-a-simple-gated-network","title":"Suppress and Balance: A Simple Gated Network for Salient Object Detection","arxiv_id":"2007.08074","date":"2020-07-16","proceeding":"ECCV 2020 8","authors":["Xiaoqi Zhao","Youwei Pang","Lihe Zhang","Huchuan Lu","Lei Zhang"],"abstract":"Most salient object detection approaches use U-Net or feature pyramid networks (FPN) as their basic structures. These methods ignore two key problems when the encoder exchanges information with the decoder: one is the lack of interference control between them, the other is without considering the disparity of the contributions of different encoder blocks. In this work, we propose a simple gated network (GateNet) to solve both issues at once. With the help of multilevel gate units, the valuable context information from the encoder can be optimally transmitted to the decoder. We design a novel gated dual branch structure to build the cooperation among different levels of features and improve the discriminability of the whole network. Through the dual branch design, more details of the saliency map can be further restored. In addition, we adopt the atrous spatial pyramid pooling based on the proposed \"Fold\" operation (Fold-ASPP) to accurately localize salient objects of various scales. Extensive experiments on five challenging datasets demonstrate that the proposed model performs favorably against most state-of-the-art methods under different evaluation metrics.","url_abs":"https://arxiv.org/abs/2007.08074v3","url_pdf":"https://arxiv.org/pdf/2007.08074v3.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":"suppress-and-balance-a-simple-gated-network","repo_url":"https://github.com/Xiaoqi-Zhao-DLUT/GateNet-RGB-Saliency","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"suppress-and-balance-a-simple-gated-network","repo_url":"https://github.com/xiaoqi-zhao-dlut/msnet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"suppress-and-balance-a-simple-gated-network","repo_url":"https://github.com/xiaoqi-zhao-dlut/multi-source-aps-zvos","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"decoder","task_name":"Decoder"},{"task_slug":"dichotomous-image-segmentation","task_name":"Dichotomous Image Segmentation"},{"task_slug":"object-detection","task_name":"Object Detection"},{"task_slug":"salient-object-detection","task_name":"RGB Salient Object Detection"},{"task_slug":"salient-object-detection-1","task_name":"Salient Object Detection"},{"task_slug":"object-detection-1","task_name":"object-detection"}],"methods":[{"method_slug":"concatenated-skip-connection","method_name":"Concatenated Skip Connection"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"spatial-pyramid-pooling","method_name":"Spatial Pyramid Pooling"},{"method_slug":"u-net","method_name":"U-Net"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/dichotomous-image-segmentation-on-dis-te1","task":"Dichotomous Image Segmentation","dataset":"DIS-TE1","model":"GateNet","rank_in_archive_order":19,"of":22,"metrics":{"E-measure":"0.766","HCE":"230","MAE":"0.099","S-Measure":"0.701","max F-Measure":"0.620","weighted F-measure":"0.517"},"uses_additional_data":false},{"leaderboard":"/sota/dichotomous-image-segmentation-on-dis-te2","task":"Dichotomous Image Segmentation","dataset":"DIS-TE2","model":"GateNet","rank_in_archive_order":18,"of":22,"metrics":{"E-measure":"0.804","HCE":"501","MAE":"0.102","S-Measure":"0.737","max F-Measure":"0.702","weighted F-measure":"0.598"},"uses_additional_data":false},{"leaderboard":"/sota/dichotomous-image-segmentation-on-dis-te3","task":"Dichotomous Image Segmentation","dataset":"DIS-TE3","model":"GateNet","rank_in_archive_order":19,"of":22,"metrics":{"E-measure":"0.815","HCE":"972","MAE":"0.103","S-Measure":"0.747","max F-Measure":"0.726","weighted F-measure":"0.620"},"uses_additional_data":false},{"leaderboard":"/sota/dichotomous-image-segmentation-on-dis-te4","task":"Dichotomous Image Segmentation","dataset":"DIS-TE4","model":"GateNet","rank_in_archive_order":16,"of":22,"metrics":{"E-measure":"0.803","HCE":"3654","MAE":"0.109","S-Measure":"0.743","max F-Measure":"0.729","weighted F-measure":"0.625"},"uses_additional_data":false},{"leaderboard":"/sota/dichotomous-image-segmentation-on-dis-vd","task":"Dichotomous Image Segmentation","dataset":"DIS-VD","model":"GateNet","rank_in_archive_order":20,"of":24,"metrics":{"E-measure":"0.783","HCE":"1493","MAE":"0.110","S-Measure":"0.723","max F-Measure":"0.678","weighted F-measure":"0.574"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2007.08074","atlas_url":"https://app.syntology.ai/?focus=2007.08074","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":"2007.08074"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2007.08074\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2007.08074"},"call":"get_concepts_for_paper(arxiv_id=\"2007.08074\")"}],"by_repo":[{"repo":"Xiaoqi-Zhao-DLUT/GateNet-RGB-Saliency","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2405.01002"],"harvested_for_calls":[{"arxiv_id":"2405.01002","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2405.01002"},"call":"get_harvested_code_for_paper(arxiv_id=\"2405.01002\")"}]},{"repo":"xiaoqi-zhao-dlut/msnet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"xiaoqi-zhao-dlut/multi-source-aps-zvos","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"5ffa41d06850d02c0a62b97ab9a632e50f4adbdc1cbd3479a3aeabe1c1a9c0e1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}