Dynamic cell tracking using time‐lapse <scp>MRI</scp> with variable temporal resolution Cartesian sampling
Bibliographic record
Abstract
PURPOSE: Temporal resolution of time-lapse MRI to track individual iron-labeled cells is limited by the required data-acquisition time to fill k-space and to reach sufficient SNR. Although motion of slowly patrolling monocytes can be resolved, detection of fast-moving immune cells requires improved acquisition and reconstruction strategies. THEORY AND METHODS: For accelerated MRI cell tracking, a Cartesian sampling scheme was designed, in which the fully sampled and undersampled k-space data for different acceleration factors were acquired simultaneously, and multiple undersampling ratios could be chosen retrospectively. Compressed-sensing reconstruction was applied using dictionary learning and low-rank constraints. Detection of iron-labeled monocytes was evaluated with simulations, rotating phantom experiments and in vivo mouse brain measurements at 9.4 T. RESULTS: Fully sampled and 2.4-times and 4.8-times accelerated images were reconstructed and had sufficient contrast-to-noise ratio (CNR) for single cells to be resolved and followed dynamically. The phantom experiments showed an improvement in CNR of 6.1% per μm/s in the 4.8-times undersampled images. Geometric distortion of cells caused by motion was visibly reduced in the accelerated images, which enabled detection of moving cells with velocities of up to 7.0 μm/s. In vivo, additional cells were resolved in the accelerated images due to the improved temporal resolution. CONCLUSION: The easy-to-implement flexible Cartesian sampling scheme with compressed-sensing reconstruction permits simultaneous acquisition of both fully sampled and high temporal resolution images. The CNR of moving cells is effectively improved, enabling the recovery of high velocity cells with sufficient contrast at virtually no cost.
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.000 | 0.001 |
| 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.001 |
| 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.001 | 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 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".