A New Approach to Symmetric Registration of Longitudinal Structural MRI of the Human Brain
Bibliographic record
Abstract
Abstract This technical report presents the Automatic Temporal Registration Algorithm (ATRA) for symmetric rigid-body affine registration of longitudinal T 1 -weighted three-dimensional magnetic resonance imaging (MRI) scans of the human brain. This is a fundamental processing step in computational neuroimaging. The notion of leave-one-out consistent (LOOC) landmarks with respect to a supervised landmark detection algorithm is introduced. An automatic algorithm is presented for identification of LOOC landmarks on MRI scans. Using this technique, multiple sets of LOOC landmarks (around 150) are identified on each of the volumes being registered. Then, a Generalized Orthogonal Procrustes Analysis of the identified landmarks is used to find a rigid-body transformation of each volume into a common space where the transformed volumes are precisely aligned. In addition, a new approach is introduced for quantitative assessment of registration accuracy in the absence of a gold standard. Qualitative and quantitative evaluations of ATRA registration accuracy are performed using 2012 volumes from 503 subjects (4 longitudinal volumes/subject) from the Alzheimer’s Disease Neuroimaging Initiative database, and on a further 120 volumes acquired from 3 normal subjects (40 longitudinal volumes/subject). The algorithm is symmetric, in the sense that any permutation of the input volumes does not change the resulting transformation matrices, and unbiased, in the sense that all volumes undergo one and only one interpolation operation, which precisely aligns them in a common space. There is no interpolation bias and no reference volume. All volumes are treated exactly the same. The algorithm is fast and highly accurate. The software is publicly available.
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.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.002 |
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".