{"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/verse-a-vertebrae-labelling-and-segmentation","title":"VerSe: A Vertebrae Labelling and Segmentation Benchmark for Multi-detector CT Images","arxiv_id":"2001.09193","date":"2020-01-24","proceeding":null,"authors":["Anjany Sekuboyina","Malek E. Husseini","Amirhossein Bayat","Maximilian Löffler","Hans Liebl","Hongwei Li","Giles Tetteh","Jan Kukačka","Christian Payer","Darko Štern","Martin Urschler","Maodong Chen","Dalong Cheng","Nikolas Lessmann","Yujin Hu","Tianfu Wang","Dong Yang","Daguang Xu","Felix Ambellan","Tamaz Amiranashvili","Moritz Ehlke","Hans Lamecker","Sebastian Lehnert","Marilia Lirio","Nicolás Pérez de Olaguer","Heiko Ramm","Manish Sahu","Alexander Tack","Stefan Zachow","Tao Jiang","Xinjun Ma","Christoph Angerman","Xin Wang","Kevin Brown","Alexandre Kirszenberg","Élodie Puybareau","Di Chen","Yiwei Bai","Brandon H. Rapazzo","Timyoas Yeah","Amber Zhang","Shangliang Xu","Feng Hou","Zhiqiang He","Chan Zeng","Zheng Xiangshang","Xu Liming","Tucker J. Netherton","Raymond P. Mumme","Laurence E. Court","Zixun Huang","Chenhang He","Li-Wen Wang","Sai Ho Ling","Lê Duy Huynh","Nicolas Boutry","Roman Jakubicek","Jiri Chmelik","Supriti Mulay","Mohanasankar Sivaprakasam","Johannes C. Paetzold","Suprosanna Shit","Ivan Ezhov","Benedikt Wiestler","Ben Glocker","Alexander Valentinitsch","Markus Rempfler","Björn H. Menze","Jan S. Kirschke"],"abstract":"Vertebral labelling and segmentation are two fundamental tasks in an automated spine processing pipeline. Reliable and accurate processing of spine images is expected to benefit clinical decision-support systems for diagnosis, surgery planning, and population-based analysis on spine and bone health. However, designing automated algorithms for spine processing is challenging predominantly due to considerable variations in anatomy and acquisition protocols and due to a severe shortage of publicly available data. Addressing these limitations, the Large Scale Vertebrae Segmentation Challenge (VerSe) was organised in conjunction with the International Conference on Medical Image Computing and Computer Assisted Intervention (MICCAI) in 2019 and 2020, with a call for algorithms towards labelling and segmentation of vertebrae. Two datasets containing a total of 374 multi-detector CT scans from 355 patients were prepared and 4505 vertebrae have individually been annotated at voxel-level by a human-machine hybrid algorithm (https://osf.io/nqjyw/, https://osf.io/t98fz/). A total of 25 algorithms were benchmarked on these datasets. In this work, we present the the results of this evaluation and further investigate the performance-variation at vertebra-level, scan-level, and at different fields-of-view. We also evaluate the generalisability of the approaches to an implicit domain shift in data by evaluating the top performing algorithms of one challenge iteration on data from the other iteration. The principal takeaway from VerSe: the performance of an algorithm in labelling and segmenting a spine scan hinges on its ability to correctly identify vertebrae in cases of rare anatomical variations. The content and code concerning VerSe can be accessed at: https://github.com/anjany/verse.","url_abs":"https://arxiv.org/abs/2001.09193v6","url_pdf":"https://arxiv.org/pdf/2001.09193v6.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":"verse-a-vertebrae-labelling-and-segmentation","repo_url":"https://github.com/anjany/verse","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"verse-a-vertebrae-labelling-and-segmentation","repo_url":"https://github.com/christianpayer/MedicalDataAugmentationTool-VerSe","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"GPL-3.0"}}],"tasks":[{"task_slug":"anatomy","task_name":"Anatomy"},{"task_slug":"segmentation","task_name":"Segmentation"}],"methods":[{"method_slug":"verse","method_name":"VERSE"}],"datasets_introduced":[{"slug":"verse-1","name":"VerSe","full_name":"Large Scale Vertebrae Segmentation Challenge"}],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2001.09193","atlas_url":"https://app.syntology.ai/?focus=2001.09193","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.09193"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2001.09193"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2001.09193"},"call":"get_harvested_code_for_paper(arxiv_id=\"2001.09193\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2001.09193"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2001.09193\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2001.09193"},"call":"get_concepts_for_paper(arxiv_id=\"2001.09193\")"}],"by_repo":[{"repo":"anjany/verse","kind":"official","samples":3,"ran":2,"instrument":1,"unverified":1},{"repo":"christianpayer/MedicalDataAugmentationTool-VerSe","kind":"listed","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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2001.09193.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2001.09193.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/christianpayer/MedicalDataAugmentationTool-VerSe","reach":{"status":"ok","spdx":"GPL-3.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/anjany/verse","reach":null}],"summary":{"ran_honours":1,"ran_draft_wrong":1,"unverified":1},"n_samples":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":3,"ran":2,"n_ran_checked":1,"n_instrument":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":2,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-22","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"f046341b1b772210","code_sha256_prefix":"f046341b1b772210","entry":"compute_dice","repo":"anjany/verse","repo_kind":"official","path":"utils/eval_utilities.py","file_url":"https://github.com/anjany/verse/blob/HEAD/utils/eval_utilities.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"signature":"im1:ndarray/2/bool, im2:ndarray/2/bool, empty_score:float/0/float","fixture_out_type":"float64","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"f046341b1b772210"},"code_page":"/code/compute-dice","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"f046341b1b772210"}},{"code_sha256":"25fd56cb846ea3fc","code_sha256_prefix":"25fd56cb846ea3fc","entry":"get_hits","repo":"anjany/verse","repo_kind":"official","path":"utils/eval_utilities.py","file_url":"https://github.com/anjany/verse/blob/HEAD/utils/eval_utilities.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature":"cent_list_gt:ndarray/2/float, cent_list_pred:ndarray/2/float, max_vert_idx:int/0/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"25fd56cb846ea3fc"},"code_page":"/code/get-hits","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"25fd56cb846ea3fc"}},{"code_sha256":"8a077b466e0d0898","code_sha256_prefix":"8a077b466e0d0898","entry":"construct_distance_matrix","repo":"anjany/verse","repo_kind":"official","path":"utils/eval_utilities.py","file_url":"https://github.com/anjany/verse/blob/HEAD/utils/eval_utilities.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"8a077b466e0d0898"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"756302b8deefd48dc5447c384e19decd7813ba720bd78387a541510a41994c3a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}