{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/near-exact-recovery-for-tomographic-inverse","title":"Near-Exact Recovery for Tomographic Inverse Problems via Deep Learning","arxiv_id":"2206.07050","date":"2022-06-14","proceeding":null,"authors":["Martin Genzel","Ingo Gühring","Jan Macdonald","Maximilian März"],"abstract":"This work is concerned with the following fundamental question in scientific machine learning: Can deep-learning-based methods solve noise-free inverse problems to near-perfect accuracy? Positive evidence is provided for the first time, focusing on a prototypical computed tomography (CT) setup. We demonstrate that an iterative end-to-end network scheme enables reconstructions close to numerical precision, comparable to classical compressed sensing strategies. Our results build on our winning submission to the recent AAPM DL-Sparse-View CT Challenge. Its goal was to identify the state-of-the-art in solving the sparse-view CT inverse problem with data-driven techniques. A specific difficulty of the challenge setup was that the precise forward model remained unknown to the participants. Therefore, a key feature of our approach was to initially estimate the unknown fanbeam geometry in a data-driven calibration step. Apart from an in-depth analysis of our methodology, we also demonstrate its state-of-the-art performance on the open-access real-world dataset LoDoPaB CT.","url_abs":"https://arxiv.org/abs/2206.07050v1","url_pdf":"https://arxiv.org/pdf/2206.07050v1.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":"near-exact-recovery-for-tomographic-inverse","repo_url":"https://github.com/jmaces/aapm-ct-challenge","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"computed-tomography-ct","task_name":"Computed Tomography (CT)"},{"task_slug":"deep-learning","task_name":"Deep Learning"},{"task_slug":"compressed-sensing","task_name":"compressed sensing"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2206.07050","atlas_url":"https://app.syntology.ai/?focus=2206.07050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.07050"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/jmaces/aapm-ct-challenge","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":1,"ran_honours":1,"unverified":2},"by_repo_kind":{"official":{"samples":4,"ran":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"727166fa90b5f3c1","entry":"l2_error","repo":"jmaces/aapm-ct-challenge","repo_kind":"official","path":"aapm-ct/operators.py","file_url":"https://github.com/jmaces/aapm-ct-challenge/blob/HEAD/aapm-ct/operators.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"727166fa90b5f3c1"}},{"code_sha256_prefix":"bd9b4f62ae1d8205","entry":"loss_func","repo":"jmaces/aapm-ct-challenge","repo_kind":"official","path":"aapm-ct/script_train_ddnet_inv.py","file_url":"https://github.com/jmaces/aapm-ct-challenge/blob/HEAD/aapm-ct/script_train_ddnet_inv.py","link_basis":"harvester_set","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"bd9b4f62ae1d8205"}},{"code_sha256_prefix":"e700127968c21d3d","entry":"fft1","repo":"jmaces/aapm-ct-challenge","repo_kind":"official","path":"aapm-ct/operators.py","file_url":"https://github.com/jmaces/aapm-ct-challenge/blob/HEAD/aapm-ct/operators.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"e700127968c21d3d"}},{"code_sha256_prefix":"9a7f763f830a9ec5","entry":"ifft1","repo":"jmaces/aapm-ct-challenge","repo_kind":"official","path":"aapm-ct/operators.py","file_url":"https://github.com/jmaces/aapm-ct-challenge/blob/HEAD/aapm-ct/operators.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9a7f763f830a9ec5"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}