{"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/unsupervised-3d-end-to-end-medical-image","title":"Unsupervised 3D End-to-End Medical Image Registration with Volume Tweening Network","arxiv_id":"1902.05020","date":"2019-02-13","proceeding":null,"authors":["Shengyu Zhao","Tingfung Lau","Ji Luo","Eric I-Chao Chang","Yan Xu"],"abstract":"3D medical image registration is of great clinical importance. However, supervised learning methods require a large amount of accurately annotated corresponding control points (or morphing), which are very difficult to obtain. Unsupervised learning methods ease the burden of manual annotation by exploiting unlabeled data without supervision. In this paper, we propose a new unsupervised learning method using convolutional neural networks under an end-to-end framework, Volume Tweening Network (VTN), for 3D medical image registration. We propose three innovative technical components: (1) An end-to-end cascading scheme that resolves large displacement; (2) An efficient integration of affine registration network; and (3) An additional invertibility loss that encourages backward consistency. Experiments demonstrate that our algorithm is 880x faster (or 3.3x faster without GPU acceleration) than traditional optimization-based methods and achieves state-of-theart performance in medical image registration.","url_abs":"https://arxiv.org/abs/1902.05020v3","url_pdf":"https://arxiv.org/pdf/1902.05020v3.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":"unsupervised-3d-end-to-end-medical-image","repo_url":"https://github.com/microsoft/Recursive-Cascaded-Networks","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"unsupervised-3d-end-to-end-medical-image","repo_url":"https://github.com/GeeLaw/bio-site","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"unsupervised-3d-end-to-end-medical-image","repo_url":"https://github.com/lajipeng/Recursive-Cascaded-Networks-master","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"unsupervised-3d-end-to-end-medical-image","repo_url":"https://github.com/olddriverjinx/reimplemention-of-dual-prnet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"unsupervised-3d-end-to-end-medical-image","repo_url":"https://github.com/w19787/Recursive-Cascaded-Networks-TF2.0","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"unsupervised-3d-end-to-end-medical-image","repo_url":"https://github.com/zsyzzsoft/Recursive-Cascaded-Networks","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":null,"task_name":"GPU"},{"task_slug":"image-registration","task_name":"Image Registration"},{"task_slug":"medical-image-registration","task_name":"Medical Image Registration"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1902.05020","atlas_url":"https://app.syntology.ai/?focus=1902.05020","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":"1902.05020"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1902.05020\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1902.05020"},"call":"get_concepts_for_paper(arxiv_id=\"1902.05020\")"}],"by_repo":[{"repo":"microsoft/Recursive-Cascaded-Networks","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1907.12353"],"harvested_for_calls":[{"arxiv_id":"1907.12353","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1907.12353"},"call":"get_harvested_code_for_paper(arxiv_id=\"1907.12353\")"}]},{"repo":"GeeLaw/bio-site","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"lajipeng/Recursive-Cascaded-Networks-master","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1907.12353"],"harvested_for_calls":[{"arxiv_id":"1907.12353","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1907.12353"},"call":"get_harvested_code_for_paper(arxiv_id=\"1907.12353\")"}]},{"repo":"olddriverjinx/reimplemention-of-dual-prnet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1909.11966"],"harvested_for_calls":[{"arxiv_id":"1909.11966","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1909.11966"},"call":"get_harvested_code_for_paper(arxiv_id=\"1909.11966\")"}]},{"repo":"w19787/Recursive-Cascaded-Networks-TF2.0","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1907.12353"],"harvested_for_calls":[{"arxiv_id":"1907.12353","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1907.12353"},"call":"get_harvested_code_for_paper(arxiv_id=\"1907.12353\")"}]},{"repo":"zsyzzsoft/Recursive-Cascaded-Networks","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":"2aaaecca78692219db35a9e6d2d6cb1cee8f46179f3ac06a028167bd46d1b872","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}