MétaCan
Menu
Back to cohort
Record W2128993200 · doi:10.1109/tns.2008.2000860

Crystal Identification Based on Recursive-Least-Squares and Least-Mean-Squares Auto-Regressive Models for Small Animal Pet

2008· article· en· W2128993200 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Transactions on Nuclear Science · 2008
Typearticle
Languageen
FieldPhysics and Astronomy
TopicRadiation Detection and Scintillator Technologies
Canadian institutionsUniversité de Sherbrooke
Fundersnot available
KeywordsDetectorIdentification (biology)Computer scienceAlgorithmAutoregressive modelFilter (signal processing)Artificial intelligenceComputer visionsortParallaxLeast-squares function approximationMathematicsStatistics

Abstract

fetched live from OpenAlex

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 exogeneous variable (ARX) algorithms were shown to be among the most powerful methods of crystal identification by pulse shape discrimination (PSD) for parallax mitigation or resolution improvement with phoswich detectors. Although ARX algorithms achieve a nearly 100% discrimination accuracy even in a noisy environment, 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.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.146
Threshold uncertainty score0.948

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0010.001
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.025
GPT teacher head0.243
Teacher spread0.218 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it