{"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/intention-aware-feature-propagation-network","title":"Cascaded Sparse Feature Propagation Network for Interactive Segmentation","arxiv_id":"2203.05145","date":"2022-03-10","proceeding":null,"authors":["Chuyu Zhang","Chuanyang Hu","Hui Ren","Yongfei Liu","Xuming He"],"abstract":"We aim to tackle the problem of point-based interactive segmentation, in which the key challenge is to propagate the user-provided annotations to unlabeled regions efficiently. Existing methods tackle this challenge by utilizing computationally expensive fully connected graphs or transformer architectures that sacrifice important fine-grained information required for accurate segmentation. To overcome these limitations, we propose a cascade sparse feature propagation network that learns a click-augmented feature representation for propagating user-provided information to unlabeled regions. The sparse design of our network enables efficient information propagation on high-resolution features, resulting in more detailed object segmentation. We validate the effectiveness of our method through comprehensive experiments on various benchmarks, and the results demonstrate the superior performance of our approach. Code is available at \\href{https://github.com/kleinzcy/CSFPN}{https://github.com/kleinzcy/CSFPN}.","url_abs":"https://arxiv.org/abs/2203.05145v3","url_pdf":"https://arxiv.org/pdf/2203.05145v3.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":"intention-aware-feature-propagation-network","repo_url":"https://github.com/kleinzcy/csfpn","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"foreground-segmentation","task_name":"Foreground Segmentation"},{"task_slug":"interactive-segmentation","task_name":"Interactive Segmentation"},{"task_slug":"segmentation","task_name":"Segmentation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/interactive-segmentation-on-berkeley","task":"Interactive Segmentation","dataset":"Berkeley","model":"IA-FP-Net(HRNet, C+L)","rank_in_archive_order":6,"of":14,"metrics":{"NoC@90":"2.12"},"uses_additional_data":false},{"leaderboard":"/sota/interactive-segmentation-on-davis","task":"Interactive Segmentation","dataset":"DAVIS","model":"IA-FP-Net","rank_in_archive_order":5,"of":15,"metrics":{"NoC@85":"4.03","NoC@90":"5.22"},"uses_additional_data":false},{"leaderboard":"/sota/interactive-segmentation-on-grabcut","task":"Interactive Segmentation","dataset":"GrabCut","model":"IA-FP-Net","rank_in_archive_order":7,"of":18,"metrics":{"NoC@90":"1.68"},"uses_additional_data":false},{"leaderboard":"/sota/interactive-segmentation-on-sbd","task":"Interactive Segmentation","dataset":"SBD","model":"IA-FP-Net(HRNet,SBD)","rank_in_archive_order":4,"of":14,"metrics":{"NoC@85":"3.33","NoC@90":"5.25"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2203.05145","atlas_url":"https://app.syntology.ai/?focus=2203.05145","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":"2203.05145"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2203.05145\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2203.05145"},"call":"get_concepts_for_paper(arxiv_id=\"2203.05145\")"}],"by_repo":[{"repo":"kleinzcy/csfpn","kind":"official","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":"e0eb1246427e51bd5e90de81697556d5ccda4f1598874c8d58bf72731114739d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}