Positron emission tomography (PET) image reconstruction by density estimation
Bibliographic record
Abstract
PET (positron emission tomography) scans are still in the experimental phase, as one of the newest breast cancer diagnostic techniques. It is becoming the new standard in neurology, oncology and cardiology. PET, like other nuclear medicine diagnostic and treatment techniques, involves the use of radiation. Because of the negative impact of radioactivity to our bodies the radiation doses in PET should be small. \n\nThe existing computing algorithms for calculating PET images can be divided into two broad categories: analytical and iterative methods. In the analytical approach the relation between the picture and its projections is expressed by a set of integral equations which are then solved analytically. The Fourier backprojection (FBP) algorithm is a numerical approximation of this analytical solution. Iterative approaches use deterministic (ART = Algebraic Reconstructed Technique) or stochastic (EM = Expectation Maximization) algorithms.\n\nMy proposed kernel density estimation (KDE) algorithm also falls also into the category of iterative methods. However, in this approach each coincidence event is considered individually. The estimate location of the annihilation event that caused each coincidence event is based on the previously assigned location of events processed earlier. To accomplish this, we construct a probability distribution along each coincidence line. This is generated from previous annihilation points by density estimation. It is shown that this density estimation approach to PET can reconstruct an image of an existing tumor using significantly less data than the standard CT algorithms, such as FBP. Therefore, it might be very promising technique allowing reduced radiation dose for patients, while retaining or improving image quality.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| 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.001 | 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".