Computationally efficient system matrix calculation techniques in computed tomography iterative reconstruction
Bibliographic record
Abstract
Background: Relative to classical methods in computed tomography, iterative reconstruction techniques enable significantly improved image qualities and/or lowered patient doses. However, the computational speed is a major concern for these iterative techniques. In the present study, we present a method for fast system matrix calculation based on the line integral model (LIM) to speed up the computations without compromising the image quality. In addition, we develop a hybrid line–area integral model (AIM) that highlights the advantages of both LIM and AIMs. Methods: The contributing detectors for a given pixel and a given projection view, and the length of corresponding intersection lines with pixels, are calculated using our proposed algorithm. For the hybrid method, the respective narrow-angle fan beam was modeled by multiple equally spaced lines. The computed system matrix was evaluated in the context of reconstruction using the simultaneous algebraic reconstruction technique (SART) as well as maximum likelihood expectation maximization (MLEM). Results: The proposed LIM offers a considerable reduction in calculation times compared to the standard Siddon algorithm: 2.9 times faster. Differences in root mean square error and peak signal-to-noise ratio were not significant between the proposed LIM and the Siddon algorithm for both SART and MLEM reconstruction methods (P > 0.05). Meanwhile, the proposed hybrid method resulted in significantly improved image qualities relative to LIM and the Siddon algorithm (P < 0.05), though computations were 4.9 times more intensive than the proposed LIM. Conclusion: We have proposed two fast algorithms to calculate the system matrix. The first is based on LIM and was faster than the Siddon algorithm, with matched image quality, whereas the second method is a hybrid LIM–AIM that achieves significantly improved images though with its computational requirements.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".