Filtering-based preconditioner for accelerated high-dimensional cone beam CT image reconstruction

preprint OA: closed
Full text JSON View at publisher

Abstract

Abstract Model-based image reconstruction algorithms are known to produce high-accuracy images but are still rarely used in cone beam computed tomography. One of the reasons for this is the computational requirements of model-based iterative algorithms, as it can take hundreds of iterations to obtain converged images. In this work, we present a measurement space-based preconditioner applied to the primal-dual hybrid gradient (PDHG) algorithm. The method is compared with the regular PDHG, FISTA, and OS-SART algorithms, as well as to a PDHG algorithm where the step-size parameters are adaptively computed. All tested algorithms utilize subsets for acceleration. The presented filtering-based preconditioner can obtain convergence in 10 iterations with 20 subsets, compared to a hundred or more iterations required by the other tested methods. The presented method is also computationally fast and has only a 15% increase in computation time per iteration compared to PDHG without the preconditioner.
Full text 12,820 characters · extracted from preprint-html · click to expand
Filtering-based preconditioner for accelerated high-dimensional cone beam CT image reconstruction | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Filtering-based preconditioner for accelerated high-dimensional cone beam CT image reconstruction Ville-Veikko Wettenhovi, Ari Hietanen, Kati Niinimäki, Marko Vauhkonen, and 1 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-5741932/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 29 Nov, 2025 Read the published version in Journal of Mathematical Imaging and Vision → Version 1 posted 9 You are reading this latest preprint version Abstract Model-based image reconstruction algorithms are known to produce high-accuracy images but are still rarely used in cone beam computed tomography. One of the reasons for this is the computational requirements of model-based iterative algorithms, as it can take hundreds of iterations to obtain converged images. In this work, we present a measurement space-based preconditioner applied to the primal-dual hybrid gradient (PDHG) algorithm. The method is compared with the regular PDHG, FISTA, and OS-SART algorithms, as well as to a PDHG algorithm where the step-size parameters are adaptively computed. All tested algorithms utilize subsets for acceleration. The presented filtering-based preconditioner can obtain convergence in 10 iterations with 20 subsets, compared to a hundred or more iterations required by the other tested methods. The presented method is also computationally fast and has only a 15% increase in computation time per iteration compared to PDHG without the preconditioner. Cone beam computed tomography image reconstruction model-based iterative primal-dual preconditioner Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Published Journal Publication published 29 Nov, 2025 Read the published version in Journal of Mathematical Imaging and Vision → Version 1 posted Editorial decision: Revision requested 11 Aug, 2025 Reviews received at journal 07 Apr, 2025 Reviews received at journal 04 Apr, 2025 Reviewers agreed at journal 07 Feb, 2025 Reviewers agreed at journal 02 Feb, 2025 Reviewers invited by journal 02 Feb, 2025 Editor assigned by journal 26 Jan, 2025 Submission checks completed at journal 02 Jan, 2025 First submitted to journal 31 Dec, 2024 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-5741932","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":396851771,"identity":"6692db90-18f7-4482-abc7-d99634d3ae1c","order_by":0,"name":"Ville-Veikko Wettenhovi","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAsklEQVRIiWNgGAWjYDACZubGA0BKjoGB8QFDhQFRWhgbQFqMgSwDhjNEaWGAaElsAGshRoPBcaCWj2026RuONzMwHCggRsthxoaDM9vScjecOQzUQozDJJsZGw7zbjucu+FG/gHmD0Rr+bvtf7rB/cdE2sIPDLHDjNsOJBjcYCZBy8Hef8mGM88kMxwgSgsb/+GDD36csZPnO36Y8cGBP0RoQQEHSNUwCkbBKBgFowAHAAB9zzyyzAqOtgAAAABJRU5ErkJggg==","orcid":"","institution":"University of Eastern Finland","correspondingAuthor":true,"prefix":"","firstName":"Ville-Veikko","middleName":"","lastName":"Wettenhovi","suffix":""},{"id":396851772,"identity":"034be3fd-f60a-471f-ba1f-fc59445750eb","order_by":1,"name":"Ari Hietanen","email":"","orcid":"","institution":"Planmeca Group","correspondingAuthor":false,"prefix":"","firstName":"Ari","middleName":"","lastName":"Hietanen","suffix":""},{"id":396851773,"identity":"b3b41b11-dc45-4df5-8431-cef30c35b68c","order_by":2,"name":"Kati Niinimäki","email":"","orcid":"","institution":"Planmeca Group","correspondingAuthor":false,"prefix":"","firstName":"Kati","middleName":"","lastName":"Niinimäki","suffix":""},{"id":396851774,"identity":"b37c715a-6f49-4c1a-a49b-cea192aec2e5","order_by":3,"name":"Marko Vauhkonen","email":"","orcid":"","institution":"University of Eastern Finland","correspondingAuthor":false,"prefix":"","firstName":"Marko","middleName":"","lastName":"Vauhkonen","suffix":""},{"id":396851775,"identity":"39b41164-d3b2-43a2-a407-4ac49afd8e7d","order_by":4,"name":"Ville Kolehmainen","email":"","orcid":"","institution":"University of Eastern Finland","correspondingAuthor":false,"prefix":"","firstName":"Ville","middleName":"","lastName":"Kolehmainen","suffix":""}],"badges":[],"createdAt":"2024-12-31 12:23:11","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-5741932/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-5741932/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1007/s10851-025-01276-4","type":"published","date":"2025-11-29T15:58:45+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":97178688,"identity":"b5a717a4-b125-4b12-bb0e-51ae860d0320","added_by":"auto","created_at":"2025-12-01 16:12:46","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":11672195,"visible":true,"origin":"","legend":"","description":"","filename":"filteringpaperiuus.pdf","url":"https://assets-eu.researchsquare.com/files/rs-5741932/v1_covered_e6bbdef1-3fe4-454c-b619-29c402dc6aa2.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Filtering-based preconditioner for accelerated high-dimensional cone beam CT image reconstruction","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"journal-of-mathematical-imaging-and-vision","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"jmiv","sideBox":"Learn more about [Journal of Mathematical Imaging and Vision](http://link.springer.com/journal/10851)","snPcode":"10851","submissionUrl":"https://submission.nature.com/new-submission/10851/3","title":"Journal of Mathematical Imaging and Vision","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Cone beam computed tomography, image reconstruction, model-based iterative, primal-dual, preconditioner","lastPublishedDoi":"10.21203/rs.3.rs-5741932/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-5741932/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eModel-based image reconstruction algorithms are known to produce high-accuracy images but are still rarely used in cone beam computed tomography. One of the reasons for this is the computational requirements of model-based iterative algorithms, as it can take hundreds of iterations to obtain converged images. In this work, we present a measurement space-based preconditioner applied to the primal-dual hybrid gradient (PDHG) algorithm. The method is compared with the regular PDHG, FISTA, and OS-SART algorithms, as well as to a PDHG algorithm where the step-size parameters are adaptively computed. All tested algorithms utilize subsets for acceleration. The presented filtering-based preconditioner can obtain convergence in 10 iterations with 20 subsets, compared to a hundred or more iterations required by the other tested methods. The presented method is also computationally fast and has only a 15% increase in computation time per iteration compared to PDHG without the preconditioner.\u003c/p\u003e","manuscriptTitle":"Filtering-based preconditioner for accelerated high-dimensional cone beam CT image reconstruction","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-01-06 03:35:31","doi":"10.21203/rs.3.rs-5741932/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2025-08-11T10:12:25+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-04-07T13:42:50+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-04-04T16:20:35+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"211168593567813730791567707665717271912","date":"2025-02-07T13:38:12+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"38596018882403098681014990500077982218","date":"2025-02-03T01:40:31+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-02-03T01:38:02+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-01-26T13:21:24+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-01-02T14:57:19+00:00","index":"","fulltext":""},{"type":"submitted","content":"Journal of Mathematical Imaging and Vision","date":"2024-12-31T12:15:12+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"journal-of-mathematical-imaging-and-vision","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"jmiv","sideBox":"Learn more about [Journal of Mathematical Imaging and Vision](http://link.springer.com/journal/10851)","snPcode":"10851","submissionUrl":"https://submission.nature.com/new-submission/10851/3","title":"Journal of Mathematical Imaging and Vision","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"8371a389-db69-4244-936e-9fa91af28f76","owner":[],"postedDate":"January 6th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[],"tags":[],"updatedAt":"2025-12-01T16:05:32+00:00","versionOfRecord":{"articleIdentity":"rs-5741932","link":"https://doi.org/10.1007/s10851-025-01276-4","journal":{"identity":"journal-of-mathematical-imaging-and-vision","isVorOnly":false,"title":"Journal of Mathematical Imaging and Vision"},"publishedOn":"2025-11-29 15:58:45","publishedOnDateReadable":"November 29th, 2025"},"versionCreatedAt":"2025-01-06 03:35:31","video":"","vorDoi":"10.1007/s10851-025-01276-4","vorDoiUrl":"https://doi.org/10.1007/s10851-025-01276-4","workflowStages":[]},"version":"v1","identity":"rs-5741932","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-5741932","identity":"rs-5741932","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00