{"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/f-brs-rethinking-backpropagating-refinement","title":"f-BRS: Rethinking Backpropagating Refinement for Interactive Segmentation","arxiv_id":"2001.10331","date":"2020-01-28","proceeding":"CVPR 2020 6","authors":["Konstantin Sofiiuk","Ilia Petrov","Olga Barinova","Anton Konushin"],"abstract":"Deep neural networks have become a mainstream approach to interactive segmentation. As we show in our experiments, while for some images a trained network provides accurate segmentation result with just a few clicks, for some unknown objects it cannot achieve satisfactory result even with a large amount of user input. Recently proposed backpropagating refinement (BRS) scheme introduces an optimization problem for interactive segmentation that results in significantly better performance for the hard cases. At the same time, BRS requires running forward and backward pass through a deep network several times that leads to significantly increased computational budget per click compared to other methods. We propose f-BRS (feature backpropagating refinement scheme) that solves an optimization problem with respect to auxiliary variables instead of the network inputs, and requires running forward and backward pass just for a small part of a network. Experiments on GrabCut, Berkeley, DAVIS and SBD datasets set new state-of-the-art at an order of magnitude lower time per click compared to original BRS. The code and trained models are available at https://github.com/saic-vul/fbrs_interactive_segmentation .","url_abs":"https://arxiv.org/abs/2001.10331v3","url_pdf":"https://arxiv.org/pdf/2001.10331v3.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":"f-brs-rethinking-backpropagating-refinement","repo_url":"https://github.com/jpconnel/fbrs-segmentation","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"f-brs-rethinking-backpropagating-refinement","repo_url":"https://github.com/PaddlePaddle/PaddleSeg","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"paddle","reach":null}],"tasks":[{"task_slug":"interactive-segmentation","task_name":"Interactive Segmentation"},{"task_slug":"segmentation","task_name":"Segmentation"}],"methods":[{"method_slug":"sbd","method_name":"Spatial Broadcast Decoder"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/interactive-segmentation-on-berkeley","task":"Interactive Segmentation","dataset":"Berkeley","model":"f-BRS-B (ResNet-50)","rank_in_archive_order":11,"of":14,"metrics":{"NoC@90":"4.34"},"uses_additional_data":false},{"leaderboard":"/sota/interactive-segmentation-on-davis","task":"Interactive Segmentation","dataset":"DAVIS","model":"f-BRS-B (ResNet-101)","rank_in_archive_order":10,"of":15,"metrics":{"NoC@85":"5.04","NoC@90":"7.41"},"uses_additional_data":false},{"leaderboard":"/sota/interactive-segmentation-on-grabcut","task":"Interactive Segmentation","dataset":"GrabCut","model":"f-BRS-B (ResNet-34)","rank_in_archive_order":10,"of":18,"metrics":{"NoC@85":"2","NoC@90":"2.46"},"uses_additional_data":false},{"leaderboard":"/sota/interactive-segmentation-on-sbd","task":"Interactive Segmentation","dataset":"SBD","model":"f-BRS-B (ResNet-101)","rank_in_archive_order":8,"of":14,"metrics":{"NoC@85":"4.81","NoC@90":"7.73"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2001.10331","atlas_url":"https://app.syntology.ai/?focus=2001.10331","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":"2001.10331"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2001.10331\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2001.10331"},"call":"get_concepts_for_paper(arxiv_id=\"2001.10331\")"}],"by_repo":[{"repo":"jpconnel/fbrs-segmentation","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"PaddlePaddle/PaddleSeg","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2109.09406"],"harvested_for_calls":[{"arxiv_id":"2109.09406","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2109.09406"},"call":"get_harvested_code_for_paper(arxiv_id=\"2109.09406\")"}]}],"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":"74aad57234114549ea7aee48cbc8e2456cdafd5e9b4fa0134ea8f4346830737c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}