Crystal Identification Based on Recursive-Least-Squares and Least-Mean-Squares AutoRegressive Models for Small-Animal PET
Bibliographic record
Abstract
Most positron emission tomography (PET) scanners still partly rely on analog processing to sort out events from the PET detector front-end. Recent all-digital architectures enable the use of more complex algorithms to solve common problems in PET scanners, such as crystal identification and parallax error. Auto-regressive moving-average (ARMAX) algorithms are among the most powerful methods for parallax mitigation in phoswich detectors. Although ARMAX achieves excellent discrimination accuracy even with noisy data, such methods are computationally expensive and can hardly be implemented in a real-time digital PET system. A crystal identification method based on adaptive filter theory using an auto-regressive (AR) model is proposed to enable real-time crystal identification in a noisy environment. Preliminary results based on MatLab simulation demonstrate a high discrimination accuracy (~95%) for phoswich LSO-LYSO crystals (with 40 and 51 ns decay time constants) and nearly 99% for BGO-LSO, including Compton photons
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 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.000 | 0.000 |
| 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.000 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".