Evaluation of the Feasibility and Quantitative Accuracy of a Generalized Scatter 2D PET Reconstruction Method
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Scatter degrades the contrast and quantitative accuracy of positron emission tomography (PET) images, and most methods for estimating and correcting scattered coincidences in PET subtract scattered events from the measured data. Compton scattering kinematics can be used to map out the locus of possible scattering locations. These curved lines (2D) or surfaces (3D), which connect the coincidence detectors, encompass the surface (2D) or volume (3D) where the decay occurs. In the limiting case where the scattering angle approaches zero, the scattered coincidence approaches the true coincidence. Therefore, both true and scattered coincidences can be considered similarly in a generalized scatter maximum-likelihood expectation-maximization reconstruction algorithm. The proposed method was tested using list-mode data obtained from a GATE simulation of a Jaszczak-type phantom. For scatter fractions from 10% to 60%, this approach reduces noise and improves the contrast recovery coefficients by 0.5–3.0% compared with reconstructions using true coincidences and by 3.0–24.5% with conventional reconstruction methods. The results demonstrate that this algorithm is capable of producing images entirely from scattered photons, eliminates the need for scatter corrections, increases image contrast, and reduces noise. This could be used to improve diagnostic quality and/or to reduce patient dose and radiopharmaceutical cost.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 it