{"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-graph-cut-based-optimization-for","title":"Fast Graph-Cut Based Optimization for Practical Dense Deformable Registration of Volume Images","arxiv_id":"1810.08427","date":"2018-10-19","proceeding":null,"authors":["Simon Ekström","Filip Malmberg","Håkan Ahlström","Joel Kullberg","Robin Strand"],"abstract":"Objective: Deformable image registration is a fundamental problem in medical\nimage analysis, with applications such as longitudinal studies, population\nmodeling, and atlas based image segmentation. Registration is often phrased as\nan optimization problem, i.e., finding a deformation field that is optimal\naccording to a given objective function. Discrete, combinatorial, optimization\ntechniques have successfully been employed to solve the resulting optimization\nproblem. Specifically, optimization based on $\\alpha$-expansion with minimal\ngraph cuts has been proposed as a powerful tool for image registration. The\nhigh computational cost of the graph-cut based optimization approach, however,\nlimits the utility of this approach for registration of large volume images.\nMethods: Here, we propose to accelerate graph-cut based deformable registration\nby dividing the image into overlapping sub-regions and restricting the\n$\\alpha$-expansion moves to a single sub-region at a time. Results: We\ndemonstrate empirically that this approach can achieve a large reduction in\ncomputation time -- from days to minutes -- with only a small penalty in terms\nof solution quality. Conclusion: The reduction in computation time provided by\nthe proposed method makes graph cut based deformable registration viable for\nlarge volume images. Significance: Graph cut based image registration has\npreviously been shown to produce excellent results, but the high computational\ncost has hindered the adoption of the method for registration of large medical\nvolume images. Our proposed method lifts this restriction, requiring only a\nsmall fraction of the computational cost to produce results of comparable\nquality.","url_abs":"http://arxiv.org/abs/1810.08427v1","url_pdf":"http://arxiv.org/pdf/1810.08427v1.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-graph-cut-based-optimization-for","repo_url":"https://github.com/simeks/deform","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"fast-graph-cut-based-optimization-for","repo_url":"https://github.com/tarolangner/mri-biometry","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"combinatorial-optimization","task_name":"Combinatorial Optimization"},{"task_slug":"image-registration","task_name":"Image Registration"},{"task_slug":"image-segmentation","task_name":"Image Segmentation"},{"task_slug":"medical-image-analysis","task_name":"Medical Image Analysis"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"}],"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":"simeks/deform","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tarolangner/mri-biometry","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1610.02391"],"harvested_for_calls":[{"arxiv_id":"1610.02391","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1610.02391"},"call":"get_harvested_code_for_paper(arxiv_id=\"1610.02391\")"}]}],"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":"c6143b0ed68e953b742a05ac2b83fd4d9993178eecc6a2178e301c3f4ee4d0d0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}