{"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/fast-and-robust-symmetric-image-registration","title":"Fast and Robust Symmetric Image Registration Based on Distances Combining Intensity and Spatial Information","arxiv_id":"1807.11599","date":"2018-07-30","proceeding":null,"authors":["Johan Öfverstedt","Joakim Lindblad","Nataša Sladoje"],"abstract":"Intensity-based image registration approaches rely on similarity measures to\nguide the search for geometric correspondences with high affinity between\nimages. The properties of the used measure are vital for the robustness and\naccuracy of the registration. In this study a symmetric, intensity\ninterpolation-free, affine registration framework based on a combination of\nintensity and spatial information is proposed. The excellent performance of the\nframework is demonstrated on a combination of synthetic tests, recovering known\ntransformations in the presence of noise, and real applications in biomedical\nand medical image registration, for both 2D and 3D images. The method exhibits\ngreater robustness and higher accuracy than similarity measures in common use,\nwhen inserted into a standard gradient-based registration framework available\nas part of the open source Insight Segmentation and Registration Toolkit (ITK).\nThe method is also empirically shown to have a low computational cost, making\nit practical for real applications. Source code is available.","url_abs":"http://arxiv.org/abs/1807.11599v2","url_pdf":"http://arxiv.org/pdf/1807.11599v2.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":"fast-and-robust-symmetric-image-registration","repo_url":"https://github.com/MIDA-group/py_alpha_amd_release","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"fast-and-robust-symmetric-image-registration","repo_url":"https://github.com/MIDA-group/itkAlphaAMD","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"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":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":[{"repo":"MIDA-group/py_alpha_amd_release","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MIDA-group/itkAlphaAMD","kind":"official","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"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"4c67ed9935ba61ca9c9c762f300a482baf2a465f270f95b1589911eb68e67bbe","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}