Evidence map›Paper›PMID 41108587›Full record

ArticleMagnetic resonance in medicine2026

Optimization of Pulsed Saturation Transfer MR Fingerprinting (ST MRF) Acquisition Using the Cramér-Rao Bound and Sequential Quadratic Programming.

Nikita Vladimirov, Moritz Zaiss, Or Perlman

Abstract read
In one paragraph

Article in Magnetic resonance in medicine, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 4 papers.

0numbers the graph read from it
0cells of the map it votes in
4citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

4 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Nikita VladimirovSchool of Biomedical Engineering, Tel Aviv University, Tel Aviv, Israel.ORCID https://orcid.org/0000-0003-1943-9139
Moritz ZaissInstitute of Neuroradiology, University Hospital Erlangen, Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), Erlangen, Germany.ORCID https://orcid.org/0000-0001-9780-3616
Or PerlmanSchool of Biomedical Engineering, Tel Aviv University, Tel Aviv, Israel.ORCID https://orcid.org/0000-0002-3566-569X

Funding

Blavatnik Artificial Intelligence and Data Science Fund, Tel Aviv University Center for AI and Data Science (TAD)Deutsche Forschungsgemeinschaft ZA 814/15-1HORIZON EUROPE European Research Council 101115639Ministry of Innovation, Science and Technology, IsraelMOONSHOT-MED
6 · The paper itself

Abstract

purposeTo develop a method for optimizing pulsed saturation transfer MR fingerprinting (ST MRF) acquisition.

methodsThe Cramér-Rao bound (CRB) for variance assessment was employed on Bloch-McConnell-based simulated signals, followed by a numerical sequential quadratic programming optimization and basin-hopping avoidance of local minima. Validation was performed using L-arginine phantoms and healthy human volunteers at 3T while restricting the scan time to be less than 40 s.

resultsThe proposed optimization approach resulted in a significantly improved agreement with reference standard values in vivo, compared to baseline non-optimized protocols (8% lower NRMSE, 7% higher SSIM, and 15% higher Pearson's r value,

conclusionThe combination of the CRB with sequential quadratic programming and a rapid Bloch-McConnell simulator offers a means for optimizing and accelerating pulsed CEST and semisolid magnetization transfer (MT) MRF acquisition.

Indexed as

Image Interpretation, Computer-AssistedImage Processing, Computer-AssistedMagnetic Resonance ImagingAdultAlgorithmsFemaleHumansMalePhantoms, ImagingReproducibility of ResultsCESTMR FingerprintingMToptimizationquantitative MRI

Identifiers

PMID41108587
PMCPMC12746367

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.