Investigation of a Model-Based Time-Over-Threshold Technique for Phoswich Crystal Discrimination
Bibliographic record
Abstract
The best crystal identification (CI) algorithms proposed so far for phoswich detectors are based on adaptive filtering and pulse shape discrimination (PSD). However, these techniques require free running analog to digital converters, which is no longer possible with the ever increasing pixelization of new detectors. We propose to explore the dual-threshold time-over-threshold (ToT) technique, used to measure events energy and time of occurence, as a more robust solution for CI with broad energy windows in phoswich detectors. In this study, phoswich assemblies made of various combinations of LGSO and LYSO scintillators with decay times in the range 30 to 65 ns were investigated for the LabPET II detection front-end. The electronic readout is based on a <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$4\times8$ </tex-math></inline-formula> APD array where pixels are individually coupled to charge sensitive preamplifiers followed by first order CR-RC shapers with 75 ns peaking time. CI data were sorted out based on the measurements of likeliness between acquired signals and a time domain model of the analog front-end. Results demonstrate that CI can be successfully performed using a dual-threshold ToT scheme with a discrimination accuracy of 99.1% for LGSO (30 ns)/LGSO (45 ns), 98.1% for LGSO (65 ns)/LYSO (40 ns), and 92.1% for LYSO (32 ns)/LYSO (47 ns), for an energy window of [350-650] keV. Moreover, the method shows a discrimination accuracy >97% for the two first pairs and ~90% for the last one when using a wide energy window of [250-650] keV.
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".