Evidence map›Paper›PMID 42708129›Full record

ArticleProceedings. IEEE International Symposium on Biomedical Imaging2026

REVISITING MRI RECONSTRUCTION USING A COMBINATION OF COMPLEX AND MAGNITUDE MEASUREMENTS WITH LEARNED PRIORS.

Mahdi Saberi, Mehmet Akçakaya

Abstract read
In one paragraph

Article in Proceedings. IEEE International Symposium on Biomedical Imaging, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing 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

0 citing papers in PubMed.

No citing paper in PubMed yet.

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

2 authors.

Mahdi SaberiDepartment of Electrical and Computer Engineering, University of Minnesota, MN, USA.
Mehmet AkçakayaDepartment of Electrical and Computer Engineering, University of Minnesota, MN, USA.

Funding

TRD4 - Ultrahigh Field Engineering and SafetyP41EB027061 · NIBIB · UNIVERSITY OF MINNESOTA · PI Gregory John Metzger, KAMIL UGURBIL · 2019 to 2026
$11.7M
Rapid Comprehensive Cardiac MRI Exam for Diagnosis of Coronary Artery DiseaseR01HL153146 · NHLBI · UNIVERSITY OF MINNESOTA · PI AKCAKAYA, MEHMET · 2020 to 2024
$2.5M
Robust and Efficient Learning of High-Resolution Brain MRI Reconstruction from Small Referenceless DataR01EB032830 · NIBIB · UNIVERSITY OF MINNESOTA · PI Mehmet Akcakaya · 2023 to 2026
$2.0M
NHLBI NIH HHS R01 HL153146NIBIB NIH HHS P41 EB027061NIBIB NIH HHS R01 EB032830
6 · The paper itself

Abstract

MR image reconstruction techniques, from parallel imaging to compressed sensing to deep learning (DL), have been critical for reducing scan time with sub-sampled acquisitions. These methods have naturally all focused on complex-valued k-space measurements. On the other hand, theoretical results for sparse recovery have established that two random magnitude-only measurements, as in phase retrieval tasks, provide as much information as a single complex-valued measurement. However, these results have not translated into MRI reconstruction, as scenarios with magnitude-only measurements without access to corresponding complex data is unclear. In this work, with the advent of large-scale databases of raw data and physics-driven DL tools, we revisit the idea of combining image reconstruction and phase retrieval for MRI. We first investigate the k-space magnitude similarity across cardiac phases in cine MRI over a database, and establish this as a potential application. Subsequently, we propose a magnitude-informed PD-DL framework (

Indexed as

cine MRIdata fidelityMRI reconstructionphase retrievalPhysics-driven deep learning

Identifiers

PMID42708129
PMCPMC13549741

What OpenQuestion holds

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