{"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/recurrent-image-registration-using-mutual","title":"Recursive Deformable Image Registration Network with Mutual Attention","arxiv_id":"2206.01863","date":"2022-06-04","proceeding":null,"authors":["Jian-Qing Zheng","Ziyang Wang","Baoru Huang","Ngee Han Lim","Tonia Vincent","Bartlomiej W. Papiez"],"abstract":"Deformable image registration, estimating the spatial transformation between different images, is an important task in medical imaging. Many previous studies have used learning-based methods for multi-stage registration to perform 3D image registration to improve performance. The performance of the multi-stage approach, however, is limited by the size of the receptive field where complex motion does not occur at a single spatial scale. We propose a new registration network combining recursive network architecture and mutual attention mechanism to overcome these limitations. Compared with the state-of-the-art deep learning methods, our network based on the recursive structure achieves the highest accuracy in lung Computed Tomography (CT) data set (Dice score of 92\\% and average surface distance of 3.8mm for lungs) and one of the most accurate results in abdominal CT data set with 9 organs of various sizes (Dice score of 55\\% and average surface distance of 7.8mm). We also showed that adding 3 recursive networks is sufficient to achieve the state-of-the-art results without a significant increase in the inference time.","url_abs":"https://arxiv.org/abs/2206.01863v2","url_pdf":"https://arxiv.org/pdf/2206.01863v2.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":[],"tasks":[{"task_slug":"computed-tomography-ct","task_name":"Computed Tomography (CT)"},{"task_slug":"image-registration","task_name":"Image Registration"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-registration-on-unpaired-abdomen-ct","task":"Image Registration","dataset":"Unpaired-abdomen-CT","model":"RMAn","rank_in_archive_order":6,"of":9,"metrics":{"ASD":"7.78","DSC":"0.55"},"uses_additional_data":false},{"leaderboard":"/sota/image-registration-on-unpaired-abdomen-ct","task":"Image Registration","dataset":"Unpaired-abdomen-CT","model":"Dnet","rank_in_archive_order":9,"of":9,"metrics":{"ASD":"8.72","DSC":"0.47"},"uses_additional_data":false},{"leaderboard":"/sota/image-registration-on-unpaired-lung-ct","task":"Image Registration","dataset":"Unpaired-lung-CT","model":"RMAn","rank_in_archive_order":3,"of":4,"metrics":{"ASD":"3.83","DSC":"0.92"},"uses_additional_data":false},{"leaderboard":"/sota/image-registration-on-unpaired-lung-ct","task":"Image Registration","dataset":"Unpaired-lung-CT","model":"Dnet","rank_in_archive_order":4,"of":4,"metrics":{"ASD":"5.01","DSC":"0.88"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"523f73260c1144b09c371d3188bf6e7251db93d1e24dbc6f5043c9e588bcfdab","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}