{"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/voxelmorph-a-learning-framework-for","title":"VoxelMorph: A Learning Framework for Deformable Medical Image Registration","arxiv_id":"1809.05231","date":"2018-09-14","proceeding":null,"authors":["Guha Balakrishnan","Amy Zhao","Mert R. Sabuncu","John Guttag","Adrian V. Dalca"],"abstract":"We present VoxelMorph, a fast learning-based framework for deformable, pairwise medical image registration. Traditional registration methods optimize an objective function for each pair of images, which can be time-consuming for large datasets or rich deformation models. In contrast to this approach, and building on recent learning-based methods, we formulate registration as a function that maps an input image pair to a deformation field that aligns these images. We parameterize the function via a convolutional neural network (CNN), and optimize the parameters of the neural network on a set of images. Given a new pair of scans, VoxelMorph rapidly computes a deformation field by directly evaluating the function. In this work, we explore two different training strategies. In the first (unsupervised) setting, we train the model to maximize standard image matching objective functions that are based on the image intensities. In the second setting, we leverage auxiliary segmentations available in the training data. We demonstrate that the unsupervised model's accuracy is comparable to state-of-the-art methods, while operating orders of magnitude faster. We also show that VoxelMorph trained with auxiliary data improves registration accuracy at test time, and evaluate the effect of training set size on registration. Our method promises to speed up medical image analysis and processing pipelines, while facilitating novel directions in learning-based registration and its applications. Our code is freely available at voxelmorph.csail.mit.edu.","url_abs":"https://arxiv.org/abs/1809.05231v3","url_pdf":"https://arxiv.org/pdf/1809.05231v3.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":"voxelmorph-a-learning-framework-for","repo_url":"https://github.com/voxelmorph/voxelmorph","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"voxelmorph-a-learning-framework-for","repo_url":"https://github.com/CIG-UCL/eddeep","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"voxelmorph-a-learning-framework-for","repo_url":"https://github.com/CIG-UCL/polaffini","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"voxelmorph-a-learning-framework-for","repo_url":"https://github.com/acasamitjana/3dhirest","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"voxelmorph-a-learning-framework-for","repo_url":"https://github.com/jw4hv/geo-sic","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"voxelmorph-a-learning-framework-for","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":"voxelmorph-a-learning-framework-for","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":"voxelmorph-a-learning-framework-for","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":"voxelmorph-a-learning-framework-for","repo_url":"https://github.com/winterpan2017/adlreg","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"deformable-medical-image-registration","task_name":"Deformable Medical Image Registration"},{"task_slug":"diffeomorphic-medical-image-registration","task_name":"Diffeomorphic Medical Image Registration"},{"task_slug":"image-registration","task_name":"Image Registration"},{"task_slug":"medical-image-analysis","task_name":"Medical Image Analysis"},{"task_slug":"medical-image-registration","task_name":"Medical Image Registration"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/diffeomorphic-medical-image-registration-on-1","task":"Diffeomorphic Medical Image Registration","dataset":"Automatic Cardiac Diagnosis Challenge (ACDC)","model":"VoxelMorph","rank_in_archive_order":3,"of":3,"metrics":{"Grad Det-Jac":"9.2"},"uses_additional_data":true},{"leaderboard":"/sota/diffeomorphic-medical-image-registration-on","task":"Diffeomorphic Medical Image Registration","dataset":"OASIS+ADIBE+ADHD200+MCIC+PPMI+HABS+HarvardGSP","model":"VoxelMorph (CC)","rank_in_archive_order":3,"of":6,"metrics":{"CPU (sec)":"57.0","Dice (Average)":"0.753","GPU sec":"0.45"},"uses_additional_data":false},{"leaderboard":"/sota/diffeomorphic-medical-image-registration-on","task":"Diffeomorphic Medical Image Registration","dataset":"OASIS+ADIBE+ADHD200+MCIC+PPMI+HABS+HarvardGSP","model":"VoxelMorph Instance","rank_in_archive_order":6,"of":6,"metrics":{"Dice":"0.79"},"uses_additional_data":false},{"leaderboard":"/sota/medical-image-registration-on-ixi","task":"Medical Image Registration","dataset":"IXI","model":"VoxelMorph","rank_in_archive_order":8,"of":8,"metrics":{"DSC":"0.714"},"uses_additional_data":false},{"leaderboard":"/sota/medical-image-registration-on-oasis","task":"Medical Image Registration","dataset":"OASIS","model":"VoxelMorph","rank_in_archive_order":6,"of":8,"metrics":{"DSC":"0.788","val dsc":"84.7"},"uses_additional_data":false},{"leaderboard":"/sota/medical-image-registration-on-oasis-adibe","task":"Medical Image Registration","dataset":"OASIS+ADIBE+ADHD200+MCIC+PPMI+HABS+HarvardGSP","model":"VoxelMorph","rank_in_archive_order":1,"of":1,"metrics":{"Dice Score":"76.3"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1809.05231","atlas_url":"https://app.syntology.ai/?focus=1809.05231","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":"1809.05231"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1809.05231\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1809.05231"},"call":"get_concepts_for_paper(arxiv_id=\"1809.05231\")"}],"by_repo":[{"repo":"voxelmorph/voxelmorph","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"CIG-UCL/eddeep","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"CIG-UCL/polaffini","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"acasamitjana/3dhirest","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"jw4hv/geo-sic","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2210.13704"],"harvested_for_calls":[{"arxiv_id":"2210.13704","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2210.13704"},"call":"get_harvested_code_for_paper(arxiv_id=\"2210.13704\")"}]},{"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":"winterpan2017/adlreg","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":"d95aff6cf48e1767c8c1d7743f2db546f3986b0297beb6da9a4817c100cfa400","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}