{"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/2018-robotic-scene-segmentation-challenge","title":"2018 Robotic Scene Segmentation Challenge","arxiv_id":"2001.11190","date":"2020-01-30","proceeding":null,"authors":["Max Allan","Satoshi Kondo","Sebastian Bodenstedt","Stefan Leger","Rahim Kadkhodamohammadi","Imanol Luengo","Felix Fuentes","Evangello Flouty","Ahmed Mohammed","Marius Pedersen","Avinash Kori","Varghese Alex","Ganapathy Krishnamurthi","David Rauber","Robert Mendel","Christoph Palm","Sophia Bano","Guinther Saibro","Chi-Sheng Shih","Hsun-An Chiang","Juntang Zhuang","Junlin Yang","Vladimir Iglovikov","Anton Dobrenkii","Madhu Reddiboina","Anubhav Reddy","Xingtong Liu","Cong Gao","Mathias Unberath","Myeonghyeon Kim","Chanho Kim","Chaewon Kim","Hye-Jin Kim","Gyeongmin Lee","Ihsan Ullah","Miguel Luna","Sang Hyun Park","Mahdi Azizian","Danail Stoyanov","Lena Maier-Hein","Stefanie Speidel"],"abstract":"In 2015 we began a sub-challenge at the EndoVis workshop at MICCAI in Munich using endoscope images of ex-vivo tissue with automatically generated annotations from robot forward kinematics and instrument CAD models. However, the limited background variation and simple motion rendered the dataset uninformative in learning about which techniques would be suitable for segmentation in real surgery. In 2017, at the same workshop in Quebec we introduced the robotic instrument segmentation dataset with 10 teams participating in the challenge to perform binary, articulating parts and type segmentation of da Vinci instruments. This challenge included realistic instrument motion and more complex porcine tissue as background and was widely addressed with modifications on U-Nets and other popular CNN architectures. In 2018 we added to the complexity by introducing a set of anatomical objects and medical devices to the segmented classes. To avoid over-complicating the challenge, we continued with porcine data which is dramatically simpler than human tissue due to the lack of fatty tissue occluding many organs.","url_abs":"https://arxiv.org/abs/2001.11190v3","url_pdf":"https://arxiv.org/pdf/2001.11190v3.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":"2018-robotic-scene-segmentation-challenge","repo_url":"https://github.com/ahme0307/streoscene","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"2018-robotic-scene-segmentation-challenge","repo_url":"https://github.com/lalithjets/global-reasoned-multi-task-model","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"2018-robotic-scene-segmentation-challenge","repo_url":"https://github.com/mobarakol/Surgical_SceneGraph_Generation","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"scene-segmentation","task_name":"Scene Segmentation"},{"task_slug":"segmentation","task_name":"Segmentation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2001.11190","atlas_url":"https://app.syntology.ai/?focus=2001.11190","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.11190"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2001.11190\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2001.11190"},"call":"get_concepts_for_paper(arxiv_id=\"2001.11190\")"}],"by_repo":[{"repo":"ahme0307/streoscene","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"lalithjets/global-reasoned-multi-task-model","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2007.03357"],"harvested_for_calls":[{"arxiv_id":"2007.03357","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2007.03357"},"call":"get_harvested_code_for_paper(arxiv_id=\"2007.03357\")"}]},{"repo":"mobarakol/Surgical_SceneGraph_Generation","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2007.03357"],"harvested_for_calls":[{"arxiv_id":"2007.03357","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2007.03357"},"call":"get_harvested_code_for_paper(arxiv_id=\"2007.03357\")"}]}],"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":"97be23ef7020a629ba9db4df93dba4189f59497e7a7e781065bfe59504af4cbb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}