Poster — Thur Eve — 07: Simultaneous reconstruction of both true and scattered coincidences using a Generalized Scatter reconstruction algorithm in PET
Bibliographic record
Abstract
Introduction: Scattered coincidences in PET are generally taken as noise, which reduces image contrast and compromises quantification. We have developed a method, with promising results, to reconstruct activity distribution from scattered PET events instead of simply correcting for them. The implementation of this method on clinical PET scanners is however limited by the currently available detector energy resolution. With low energy resolution we lose the ability to distinguish scattered coincidences from true events based on the measured photon energy. In addition the two circular arcs used to confine the source position for a scattered event cannot be accurately defined. Method: This paper presents a modification to this approach which accounts for limited energy resolution. A measured event is split into a true and a scattered component each with different probabilities based on the position of the pair of photon energies in the energy spectrum. For the scattered component, we model the photon energy with a Gaussian distribution and the upper and lower energy limits can be estimated and used to define inner and outer circular arcs to confine the source position. The true and scattered components for each measured event were reconstructed using our Generalized Scatter reconstruction algorithm. Results and Conclusion: The results show that the contrast and noise properties were improved by 6–9% and 2–4% respectively. This demonstrates that the performance of the algorithm is less sensitive to the energy resolution and that incorporating scattered photons into reconstruction brings more benefits than simply rejecting them.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.002 |
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".