Real Time Artificial Neural Network FPGA Implementation for Triple Coincidences Recovery in PET
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
In small-animal Positron Emission Tomography (PET), spatial resolution improvements rely on detector minimization in size and often come at the expense of lowering the detector photoelectric fraction. As a result, Inter-Crystal Scatter (ICS) occurrences are increased and affect the overall PET detection efficiency. To reclaim some lost efficiency, previous work used an artificial neural network (ANN) to identify the true line of response (LOR) for the simplest multiple event detection case, three coincident singles known as triplets. Despite promising results, this method is limited to an offline processing which is impractical when a limited data bandwidth is present between the scanner and the PC. This paper demonstrates the capability of processing triplets in real time using an ANN implemented in the field-programmable gate array (FPGA). The ANN pipelined architecture can process over 1 million triplets/second using less than 6000 FPGA slices. Real time processing on the LabPET I scanner yielded an overall 39.7% increase in detection efficiency relative to traditional high resolution settings with a 360-660 keV energy window along with a slight Contrast-to-Noise Ratio ( CNR) degradation. Although improvements are still possible, the proposed FPGA implementation proves the usability of an ANN in real time PET applications in conditions where spare computational resources are limited and the data rate to be processed is high.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| 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 it