Fast computation of myelin maps from MRI T<sub>2</sub>relaxation data using multicore CPU and graphics card parallelization
Bibliographic record
Abstract
PURPOSE: To develop a fast algorithm for computing myelin maps from multiecho T2 relaxation data using parallel computation with multicore CPUs and graphics processing units (GPUs). MATERIALS AND METHODS: Using an existing MATLAB (MathWorks, Natick, MA) implementation with basic (nonalgorithm-specific) parallelism as a guide, we developed a new version to perform the same computations but using C++ to optimize the hybrid utilization of multicore CPUs and GPUs, based on experimentation to determine which algorithmic components would benefit from CPU versus GPU parallelization. Using 32-echo T2 data of dimensions 256 × 256 × 7 from 17 multiple sclerosis patients and 18 healthy subjects, we compared the two methods in terms of speed, myelin values, and the ability to distinguish between the two patient groups using Student's t-tests. RESULTS: The new method was faster than the MATLAB implementation by 4.13 times for computing a single map and 14.36 times for batch-processing 10 scans. The two methods produced very similar myelin values, with small and explainable differences that did not impact the ability to distinguish the two patient groups. CONCLUSION: The proposed hybrid multicore approach represents a more efficient alternative to MATLAB, especially for large-scale batch processing.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".