Pith. sign in

REVIEW 4 major objections 5 minor 1 cited by

Domain-conditioned and Temporal-guided Diffusion Modeling for Accelerated Dynamic MRI Reconstruction

T0 review · 4 major / 5 minor · reviewed 2026-08-10 · deepseek-v4-flash

Pith's one-line read Dynamic MRI reconstruction improves when diffusion denoises the whole frame sequence with temporal guidance, not each frame alone.

desk verdict The cardiac experiments are credible and the temporal-diffusion idea is a real, if incremental, step; the lung results are not established because the reference is generated by the same GROG pipeline the network is trained to invert. read the letter →

arxiv 2501.09305 v1 pith:7MPUYTUD submitted 2025-01-16 eess.IV cs.CVphysics.med-ph

classification eess.IVcs.CVphysics.med-ph
keywords dynamicMRIreconstructiondiffusionmodeltemporalpriorsk-tspacecardiaccineradiallungnon-Cartesianconjugategradient
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Diffusion models have been used to reconstruct static MRI by denoising k-space, but a beating heart or breathing lung moves between frames. The paper tries to show that this temporal structure should be part of the diffusion process itself: instead of reconstructing each time frame independently, dDiMo denoises several adjacent frames together and guides every reverse step with learned spatiotemporal and frequency-temporal priors plus a nonlinear conjugate gradient refinement. If the claim holds, accelerated dynamic scans could recover both spatial detail and motion fidelity at higher undersampling than frame-wise methods can manage, which matters because cardiac and respiratory motion are exactly where fast MRI currently blurs or misaligns. The method is tested on Cartesian cardiac cine at 4x, 8x, and 10x acceleration and on non-Cartesian radial lung data at 70, 35, and 17 spokes per motion state.

What carries the argument

The load-bearing object is the temporally guided reverse diffusion step: the update that mixes the current noisy state with a temporally refined clean estimate to produce the next state. Three learned modules feed that step. A 3D noise-estimation U-Net sees several time frames at once, so predicted noise carries inter-frame context. A 3D spatiotemporal network acts on the estimated clean sequence in image space to sharpen temporal dynamics, and a 3D frequency-temporal network, trained in a self-consistency fashion on the auto-calibration region of k-space, enforces consistency with measured data; a nonlinear conjugate gradient layer with a temporal finite-difference penalty closes the step. The role of this machinery is to make temporal coherence a per-step constraint of the diffusion process rather than a post-processing afterthought.

What would settle it

Simulate a radial acquisition with known ground truth and exact spoke-to-state assignments, run dDiMo and the compressed-sensing baseline through the same GROG-binned pipeline, and check whether dDiMo's reported margins persist; if the margin shrinks or reverses when the reference is exact rather than bin-derived, the claimed superiority depends on the approximation in gridding and motion binning, not on the temporal priors themselves.

Watch

Extended reading notes

Core claim

The central claim is that for dynamic MRI the object of diffusion should be the whole frame sequence, not a single image. The reverse process starts from noise, and at each step a 3D noise-estimation network predicts noise using both spatial and temporal context; a clean estimate is pulled out of the noisy state, refined by an image-domain temporal network and by a frequency-domain self-consistency network trained on the auto-calibration region, and then polished by a nonlinear conjugate gradient layer that enforces temporal sparsity. The update then carries this temporally refined estimate into the next reverse step, so temporal coherence is enforced inside the diffusion loop rather than applied afterward. On Cartesian cardiac cine the paper reports consistent gains over low-rank-plus-sparse, frame-wise diffusion, and recurrent-network baselines at all tested accelerations, and on gridded radial lung data it reports gains over the motion-resolved compressed-sensing baseline at all tested spoke counts, with better temporal alignment and lower residual error.

Load-bearing premise

For the non-Cartesian lung experiments, the training pairs and the reported metrics rest on the assumption that gridding radial k-space onto a Cartesian grid with self-calibrating GROG (a calibration-based regridding) and binning spokes into respiratory states by the projection-based motion signal preserve the true image content; if gridding is lossy or spokes go to the wrong motion state, the quantitative gains are measured against a distorted reference rather than the true anatomy.

Editorial extensions

If this is right

  • Temporal guidance converts diffusion-based dynamic MRI reconstruction from a frame-by-frame denoiser into a sequence denoiser, so motion coherence is carried across adjacent frames by the same k-space conditioning machinery.
  • At every tested cardiac acceleration factor and radial spoke count, dDiMo is reported to have the best PSNR, SSIM, and NMSE among the compared methods, indicating the benefit persists as undersampling becomes more aggressive.
  • The ablations show that the spatiotemporal and frequency-temporal prior weights and the conjugate gradient temporal penalty each affect output quality, with quality rising up to an optimum and degrading beyond it, so each component is load-bearing rather than decorative.
  • Because radial data is gridded onto a Cartesian grid before entering the diffusion model, the same trained-in-k-space architecture transfers between Cartesian and non-Cartesian acquisitions without designing a new denoiser.
  • At 1000 diffusion steps, inference takes about six minutes per lung volume, so practical clinical use would require fewer steps or a latent-space diffusion formulation.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A testable extension the paper does not run is a native non-Cartesian diffusion baseline; comparing dDiMo with such a method would separate the benefit of the temporal priors from the benefit of converting radial data into a Cartesian grid.
  • The authors down-weight the frequency-temporal prior for radial lung data because the densely sampled k-space center makes auto-calibration learning unreliable; a trajectory-aware version that accounts for radial sampling density is a natural next step for very few spokes.
  • If temporal coherence is the active ingredient, the same sequence-denoiser design should transfer to other time-resolved reconstructions such as perfusion or contrast-dynamics imaging, where adjacent frames share structure and motion; the paper does not test these.
  • The reported performance saturates beyond optimal prior weights, so the practical gains depend on per-dataset tuning; automatic selection of those weights would be needed for reliable black-box use in the clinic.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The manuscript proposes dDiMo, a diffusion-based reconstruction method for accelerated dynamic MRI. The method extends the authors' prior DiMo framework by processing multi-frame multi-coil k-space sequences jointly, using a 3D U-Net for noise estimation, explicit x-t and k-t prior networks, data consistency, and a nonlinear CG refinement inside each reverse diffusion step. The method is evaluated on CMRxRecon cardiac cine at 4x, 8x, and 10x acceleration and on an in-house free-breathing stack-of-stars lung MRI dataset at 70, 35, and 17 spokes per respiratory motion bin, with comparisons to L+S, CRNN, DiMo, XD-GRASP, and zero-filled reconstruction. The main claim is that dDiMo provides improved temporal alignment and structural recovery over these methods for both Cartesian and non-Cartesian dynamic MRI.

Significance. The methodological integration is a reasonable and potentially useful extension of diffusion models to dynamic MRI, and the use of the public CMRxRecon benchmark and several independent baselines is a strength. If the results hold, the method could be valuable for high-acceleration cardiac and free-breathing lung imaging. The manuscript also includes helpful ablations for the weighting factors, diffusion steps, and the CG module. However, the lung evaluation is currently insufficient to support the central claim: the reference is generated from the same binning/gridding pipeline used to create training pairs, the test set contains only two subjects, and at 17 spokes the method does not beat XD-GRASP on NMSE. The paper would be strengthened by a disentangled evaluation of the non-Cartesian pipeline and by proper statistical testing.

major comments (4)
  1. [Section II-C, Section III-B, Table II] The non-Cartesian lung evaluation has a reference/training coupling problem. The reference for each motion state is formed by binning 283 golden-angle radial spokes with a projection-based respiratory signal and gridding them to Cartesian with self-calibrating GROG; the training pairs are then generated by randomly selecting subsets of those same binned spokes and gridding them with the same GROG operator (Fig. 3). All PSNR/SSIM/NMSE numbers are computed in this GROG-gridded Cartesian space. dDiMo is therefore trained to invert exactly the undersampling-plus-GROG mapping that produces the reference, and its scores can reflect fidelity to that pipeline rather than to true anatomy. XD-GRASP, by contrast, reconstructs directly from radial k-space and is not matched to the GROG operator. The authors' explanation that XD-GRASP's consistently higher Tenengrad is due to noise is plausible but not the only possible reading; the reference itself may be over-smoothed. A concrete test is needed, e.g., an independent reference reconstructed from all 1700 spokes or a retrospective simulation with a known ground-truth sequence, and XD-GRASP results should also be reported after the same GROG gridding so that the comparison is not biased by the training/reference pipeline.
  2. [Table II, Section IV-B] At 17 spokes, dDiMo does not outperform XD-GRASP on key quantitative metrics: NMSE is worse (0.1623 ± 0.0492 vs 0.1575 ± 0.0226), PSNR is equal within uncertainty (30.63 ± 1.55 vs 30.62 ± 1.04), and Tenengrad is lower at every spoke count (e.g., 0.0113 vs 0.0197 at 17 spokes). This contradicts the abstract's sweeping claim of 'improved temporal alignment and structural recovery' and the text's statement that dDiMo 'consistently achieves the highest PSNR and overall image similarity' across all undersampling levels. The claim needs to be revised or supported with paired statistical tests; no significance testing is reported anywhere in the manuscript.
  3. [Section III-B, Section IV-B] The lung test set consists of only two subjects, and no per-subject results are reported. With n = 2, the means and standard deviations in Table II and the violin plots in Figure 8 cannot support a claim of consistent, generalizable superiority over XD-GRASP; the results should be presented as a pilot or the test set should be expanded. At minimum, per-subject metrics and confidence intervals are needed.
  4. [Algorithm 1, Algorithm 2] The data-consistency update in Algorithm 1 (line 7) and Algorithm 2 (line 2) uses a coefficient λ_t that is never defined in the text; the forward and reverse diffusion formulas in Section II-B use only β_t, α_t, and σ_t. The authors should specify the schedule or value of λ_t; without this, the method cannot be reimplemented exactly.
minor comments (5)
  1. [Section II-B.2, Eq. (16)] The text says 'F represents a Fourier transform applied to the estimated clean k-space data to convert it into x-t space, and F^H denotes the inverse Fourier transform operation.' This is opposite to the convention in Eqs. (1)-(2), where F maps to k-space and F^H maps from k-space. The equation itself is consistent, but the prose should be corrected.
  2. [Figure 4 caption] The caption states that results are shown for 4x, 8x, and 16x undersampling, but the text and Table I consistently report 10x as the highest acceleration. This should be corrected to 10x.
  3. [Section II-C, Section III-B] The number of motion bins, the sliding window overlap, and the number of respiratory phases used for training are not specified; the evaluation uses 6 motion states, but the training details are needed for reproducibility.
  4. [Section V] The statement that the golden-angle radial lung results rely more on the x-t component than the k-t component is not supported by a lung-specific ablation; the only lambda ablation shown in Figure S3 is for cardiac cine. A lung ablation or a qualifying statement is needed.
  5. [General] No code or data availability statement is included; providing one would improve reproducibility.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: dDiMo's temporal-guidance components are trained and evaluated on external data and independent baselines; self-citations are incremental and not load-bearing.

full rationale

The derivation chain is self-contained. dDiMo's contribution, temporal x-t and k-t guidance added to a diffusion reverse process, is implemented through explicit 3D CNN components (Eqs. 15-22) trained with an objective that combines noise estimation, x-t consistency, and k-t self-consistency, and the final reconstructions are produced by the reverse-sampling loop in Algorithm 2 from noise and measured k-space, not from the training references. The claimed superiority is established empirically against external data and independent baselines: Cartesian cardiac results use the public CMRxRecon benchmark with a fully sampled reference and compare to L+S, CRNN, and DiMo (Table I), while the lung results compare to XD-GRASP on held-out subjects (Table II). The paper does cite the authors' prior DiMo and k-space methods for components, but these citations supply architectural starting points and are not used to justify the reported performance; the performance is measured, not derived from those citations. The lung reference is reconstructed via motion binning and GROG, the same gridding operator used to form training pairs, so lung metrics measure fidelity to that reference rather than an independent truth; this is a reference-fidelity limitation, not a circular derivation, because the network output is not algebraically tied to the reference and the cardiac evaluation provides an external benchmark. No fitted parameter is relabeled as a prediction, and no uniqueness theorem or definitional identity forces the claimed outcome.

Assumptions & free parameters 4 free parameters · 5 assumptions · 0 invented entities

The central empirical claim rests on standard diffusion modeling assumptions, the MRI forward model, and several domain choices about motion binning and radial gridding. Hyperparameters lambda_xt, lambda_kt, and lambda_td are tuned via ablation. No new physical entities or conserved quantities are introduced.

free parameters (4)
  • lambda_xt (x-t prior weight) = 1.0 (cardiac and lung)
    Chosen via ablation (Fig. S3); reconstruction improves as lambda_xt increases to 1.
  • lambda_kt (k-t prior weight) = 1.0 (cardiac), 0.001 (lung)
    Set to 1 for cardiac after ablation; set small for lung because k-t ACS learning is unreliable in radial data (Section V).
  • lambda_td (temporal sparsity weight in CG) = 0.015
    Selected from values 15 down to 0.00015 in ablation on lung data (Fig. S5); 0.015 gives the best quality.
  • total diffusion steps T = 1000
    Chosen as a balance between quality and runtime; ablation (Fig. S4) shows fewer steps leave residual noise. User-selected, not statistically fitted.
assumptions (5)
  • domain assumption The forward measurement model y = Ax + epsilon with known coil sensitivities and binary undersampling mask (Eqs. 1-2) accurately describes dynamic MRI acquisition.
    Used throughout Section II-A to define the inverse problem and the data consistency layers.
  • standard math The DDPM Gaussian forward and reverse process in k-space (Eqs. 7-14) is a valid generative model for multi-coil dynamic k-space data.
    Borrowed from Ho et al. (ref 40); the paper extends it to multi-frame k-space without proving that the Gaussian noise assumption holds for complex multi-coil k-space.
  • domain assumption x-t and k-t priors learned by 3D CNNs from training data generalize to new subjects and motion states.
    The method's performance relies on learned temporal priors; no generalization guarantee is given beyond the empirical test sets.
  • domain assumption Self-calibrating GROG maps radial k-space to a Cartesian grid without substantial information loss (Section II-C).
    Used to enable Cartesian-style diffusion on radial data; errors here would propagate into training and metrics.
  • domain assumption Respiratory motion signals estimated from z-projections correctly define motion states for binning (Section III-B).
    All lung training and reference data are generated from this binning; incorrect binning would make references and comparisons unreliable.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Domain-conditioned and Temporal-guided Diffusion Modeling for Accelerated Dynamic MRI Reconstruction." pith.science (2026). https://pith.science/paper/7MPUYTUD

@misc{pith2026250109305,
  author       = {Pith},
  title        = {Pith review of: Domain-conditioned and Temporal-guided Diffusion Modeling for Accelerated Dynamic MRI Reconstruction},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/7MPUYTUD}},
  note         = {Machine review of arXiv:2501.09305}
}
abstract

Purpose: To propose a domain-conditioned and temporal-guided diffusion modeling method, termed dynamic Diffusion Modeling (dDiMo), for accelerated dynamic MRI reconstruction, enabling diffusion process to characterize spatiotemporal information for time-resolved multi-coil Cartesian and non-Cartesian data. Methods: The dDiMo framework integrates temporal information from time-resolved dimensions, allowing for the concurrent capture of intra-frame spatial features and inter-frame temporal dynamics in diffusion modeling. It employs additional spatiotemporal ($x$-$t$) and self-consistent frequency-temporal ($k$-$t$) priors to guide the diffusion process. This approach ensures precise temporal alignment and enhances the recovery of fine image details. To facilitate a smooth diffusion process, the nonlinear conjugate gradient algorithm is utilized during the reverse diffusion steps. The proposed model was tested on two types of MRI data: Cartesian-acquired multi-coil cardiac MRI and Golden-Angle-Radial-acquired multi-coil free-breathing lung MRI, across various undersampling rates. Results: dDiMo achieved high-quality reconstructions at various acceleration factors, demonstrating improved temporal alignment and structural recovery compared to other competitive reconstruction methods, both qualitatively and quantitatively. This proposed diffusion framework exhibited robust performance in handling both Cartesian and non-Cartesian acquisitions, effectively reconstructing dynamic datasets in cardiac and lung MRI under different imaging conditions. Conclusion: This study introduces a novel diffusion modeling method for dynamic MRI reconstruction.

Figures

Figures reproduced from arXiv: 2501.09305 by the authors.

Figure 1
Figure 1. This new framework includes several key com [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Piecewise Dynamic Diffusion Regularization for Reconstruction of Cardiac Cine MRI

    eess.IV 2026-07 accept novelty 6.0 of 10

    Piecewise variational use of a spatiotemporal diffusion prior reconstructs long free-breathing cardiac cine MRI sequences with higher quality and lower compute than prior methods.

Reference graph

Works this paper leans on

67 extracted references · 55 canonical work pages · cited by 1 Pith paper

  1. [1]

    Simultaneous acquisition of spatial harmonics (smash): fast imaging with radiofrequency coil arrays,

    D. K. Sodickson and W. J. Manning, “Simultaneous acquisition of spatial harmonics (smash): fast imaging with radiofrequency coil arrays,” Magnetic resonance in medicine , vol. 38, no. 4, pp. 591–603, 1997

  2. [2]

    Sense: Sensitivity encoding for fast mri,

    K. P. Pruessmann, M. Weiger, M. B. Scheidegger, and P. Boesiger, “Sense: Sensitivity encoding for fast mri,” Magnetic Resonance in Medicine, vol. 42, no. 5, pp. 952–962, 1999

  3. [3]

    Generalized autocalibrating par- tially parallel acquisitions (grappa),

    M. A. Griswold, P. M. Jakob, R. M. Heidemann, M. Nittka, V . Jellus, J. Wang, B. Kiefer, and A. Haase, “Generalized autocalibrating par- tially parallel acquisitions (grappa),” Magnetic Resonance in Medicine , vol. 47, no. 6, pp. 1202–1210, 2002

  4. [4]

    Sparse mri: The application of compressed sensing for rapid mr imaging,

    M. Lustig, D. Donoho, and J. M. Pauly, “Sparse mri: The application of compressed sensing for rapid mr imaging,” Magnetic Resonance in Medicine: An Official Journal of the International Society for Magnetic Resonance in Medicine , vol. 58, no. 6, pp. 1182–1195, 2007

  5. [5]

    Accelerated dynamic mri exploiting sparsity and low-rank structure: kt slr,

    S. G. Lingala, Y . Hu, E. DiBella, and M. Jacob, “Accelerated dynamic mri exploiting sparsity and low-rank structure: kt slr,” IEEE transactions on medical imaging , vol. 30, no. 5, pp. 1042–1054, 2011

  6. [6]

    High-resolution cardiovascular mri by integrating parallel imaging with low-rank and sparse modeling,

    A. G. Christodoulou, H. Zhang, B. Zhao, T. K. Hitchens, C. Ho, and Z.-P. Liang, “High-resolution cardiovascular mri by integrating parallel imaging with low-rank and sparse modeling,” IEEE Transactions on Biomedical Engineering, vol. 60, no. 11, pp. 3083–3092, 2013

  7. [7]

    Low-rank modeling of local k-space neighborhoods (loraks) for constrained mri,

    J. P. Haldar, “Low-rank modeling of local k-space neighborhoods (loraks) for constrained mri,” IEEE transactions on medical imaging , vol. 33, no. 3, pp. 668–681, 2013

  8. [8]

    Compressive sensing via nonlocal low-rank regularization,

    W. Dong, G. Shi, X. Li, Y . Ma, and F. Huang, “Compressive sensing via nonlocal low-rank regularization,” IEEE transactions on image processing, vol. 23, no. 8, pp. 3618–3632, 2014

Show all 67 references
  1. [9]

    Calibrationless parallel imaging reconstruction based on structured low-rank matrix completion,

    P. J. Shin, P. E. Larson, M. A. Ohliger, M. Elad, J. M. Pauly, D. B. Vi- gneron, and M. Lustig, “Calibrationless parallel imaging reconstruction based on structured low-rank matrix completion,” Magnetic resonance in medicine, vol. 72, no. 4, pp. 959–970, 2014

  2. [10]

    Low-rank plus sparse matrix decomposition for accelerated dynamic mri with separation of background and dynamic components,

    R. Otazo, E. Candes, and D. K. Sodickson, “Low-rank plus sparse matrix decomposition for accelerated dynamic mri with separation of background and dynamic components,” Magnetic resonance in medicine, vol. 73, no. 3, pp. 1125–1136, 2015

  3. [11]

    Accelerating parameter mapping with a locally low rank constraint,

    T. Zhang, J. M. Pauly, and I. R. Levesque, “Accelerating parameter mapping with a locally low rank constraint,” Magnetic resonance in medicine, vol. 73, no. 2, pp. 655–661, 2015

  4. [12]

    Accelerated high-dimensional mr imaging with sparse sampling using low-rank tensors,

    J. He, Q. Liu, A. G. Christodoulou, C. Ma, F. Lam, and Z.-P. Liang, “Accelerated high-dimensional mr imaging with sparse sampling using low-rank tensors,” IEEE transactions on medical imaging, vol. 35, no. 9, pp. 2119–2129, 2016. 14

  5. [13]

    Accelerating magnetic resonance imaging via deep learning,

    S. Wang, Z. Su, L. Ying, X. Peng, S. Zhu, F. Liang, D. Feng, and D. Liang, “Accelerating magnetic resonance imaging via deep learning,” 2016 IEEE 13th International Symposium on Biomedical Imaging (ISBI), pp. 514–517, 2016

  6. [14]

    Deep admm-net for compres- sive sensing mri,

    Y . Yang, J. Sun, H. Li, and Z. Xu, “Deep admm-net for compres- sive sensing mri,” Advances in neural information processing systems , vol. 29, 2016

  7. [15]

    Dagan: Deep de-aliasing generative adversarial networks for fast compressed sensing mri reconstruction,

    G. Yang, S. Yu, H. Dong, G. Slabaugh, P. L. Dragotti, X. Ye, F. Liu, S. Arridge, J. Keegan, Y . Guoet al., “Dagan: Deep de-aliasing generative adversarial networks for fast compressed sensing mri reconstruction,” IEEE transactions on medical imaging , vol. 37, no. 6, pp. 1310–...

  8. [16]

    Modl: Model-based deep learning architecture for inverse problems,

    H. K. Aggarwal, M. P. Mani, and M. Jacob, “Modl: Model-based deep learning architecture for inverse problems,” IEEE transactions on medical imaging, vol. 38, no. 2, pp. 394–405, 2018

  9. [17]

    Learning a variational network for reconstruction of accelerated mri data,

    K. Hammernik, T. Klatzer, E. Kobler, M. P. Recht, D. K. Sodickson, T. Pock, and F. Knoll, “Learning a variational network for reconstruction of accelerated mri data,” Magnetic resonance in medicine, vol. 79, no. 6, pp. 3055–3071, 2018

  10. [18]

    Kiki-net: cross- domain convolutional neural networks for reconstructing undersampled magnetic resonance images,

    T. Eo, Y . Jun, T. Kim, J. Jang, H.-J. Lee, and D. Hwang, “Kiki-net: cross- domain convolutional neural networks for reconstructing undersampled magnetic resonance images,” Magnetic resonance in medicine , vol. 80, no. 5, pp. 2188–2201, 2018

  11. [19]

    Image reconstruction by domain-transform manifold learning,

    B. Zhu, J. Z. Liu, S. F. Cauley, B. R. Rosen, and M. S. Rosen, “Image reconstruction by domain-transform manifold learning,” Nature, vol. 555, no. 7697, pp. 487–492, 2018

  12. [20]

    Santis: sampling-augmented neural network with incoherent structure for mr image reconstruction,

    F. Liu, A. Samsonov, L. Chen, R. Kijowski, and L. Feng, “Santis: sampling-augmented neural network with incoherent structure for mr image reconstruction,” Magnetic resonance in medicine , vol. 82, no. 5, pp. 1890–1904, 2019

  13. [21]

    Plug-and-play methods for magnetic res- onance imaging: Using denoisers for image recovery,

    R. Ahmad, C. A. Bouman, G. T. Buzzard, S. Chan, S. Liu, E. T. Reehorst, and P. Schniter, “Plug-and-play methods for magnetic res- onance imaging: Using denoisers for image recovery,” IEEE signal processing magazine, vol. 37, no. 1, pp. 105–116, 2020

  14. [22]

    Scan- specific robust artificial-neural-networks for k-space interpolation (raki) reconstruction: Database-free deep learning for fast imaging,

    M. Akc ¸akaya, S. Moeller, S. Weing ¨artner, and K. U ˘gurbil, “Scan- specific robust artificial-neural-networks for k-space interpolation (raki) reconstruction: Database-free deep learning for fast imaging,” Magnetic resonance in medicine , vol. 81, no. 1, pp. 439–453, 2019

  15. [23]

    End-to-end variational net- works for accelerated mri reconstruction,

    A. Sriram, J. Zbontar, T. Murrell, A. Defazio, C. L. Zitnick, N. Yakubova, F. Knoll, and P. Johnson, “End-to-end variational net- works for accelerated mri reconstruction,” Medical Image Computing and Computer Assisted Intervention–MICCAI 2020: 23rd International Conference, L...

  16. [24]

    A deep cascade of convolutional neural networks for dynamic mr image reconstruction,

    J. Schlemper, J. Caballero, J. V . Hajnal, A. N. Price, and D. Rueckert, “A deep cascade of convolutional neural networks for dynamic mr image reconstruction,” IEEE transactions on Medical Imaging , vol. 37, no. 2, pp. 491–503, 2017

  17. [25]

    Convolutional recurrent neural networks for dynamic mr image reconstruction,

    C. Qin, J. Schlemper, J. Caballero, A. N. Price, J. V . Hajnal, and D. Rueckert, “Convolutional recurrent neural networks for dynamic mr image reconstruction,” IEEE transactions on medical imaging , vol. 38, no. 1, pp. 280–290, 2018

  18. [26]

    Complemen- tary time-frequency domain networks for dynamic parallel mr image reconstruction,

    C. Qin, J. Duan, K. Hammernik, J. Schlemper, T. K ¨ustner, R. Botnar, C. Prieto, A. N. Price, J. V . Hajnal, and D. Rueckert, “Complemen- tary time-frequency domain networks for dynamic parallel mr image reconstruction,” Magnetic Resonance in Medicine , vol. 86, no. 6, pp. 327...

  19. [27]

    Cinenet: deep learning-based 3d cardiac cine mri reconstruction with multi- coil complex-valued 4d spatio-temporal convolutions,

    T. K ¨ustner, N. Fuin, K. Hammernik, A. Bustin, H. Qi, R. Hajhosseiny, P. G. Masci, R. Neji, D. Rueckert, R. M. Botnar et al. , “Cinenet: deep learning-based 3d cardiac cine mri reconstruction with multi- coil complex-valued 4d spatio-temporal convolutions,”Scientific reports,...

  20. [28]

    Prior-guided image reconstruction for accelerated multi-contrast mri via generative adversarial networks,

    S. U. Dar, M. Yurt, M. Shahdloo, M. E. Ildız, B. Tınaz, and T. C ¸ ukur, “Prior-guided image reconstruction for accelerated multi-contrast mri via generative adversarial networks,” IEEE Journal of Selected Topics in Signal Processing , vol. 14, no. 6, pp. 1072–1087, 2020

  21. [29]

    Time- dependent deep image prior for dynamic mri,

    J. Yoo, K. H. Jin, H. Gupta, J. Yerly, M. Stuber, and M. Unser, “Time- dependent deep image prior for dynamic mri,” IEEE Transactions on Medical Imaging, vol. 40, no. 12, pp. 3337–3348, 2021

  22. [30]

    Real-time cardiac mri using an undersampled spiral k-space trajectory and a reconstruction based on a variational network,

    J. Kleineisel, J. F. Heidenreich, P. Eirich, N. Petri, H. K ¨ostler, B. Petritsch, T. A. Bley, and T. Wech, “Real-time cardiac mri using an undersampled spiral k-space trajectory and a reconstruction based on a variational network,” Magnetic Resonance in Medicine , vol. 88, no...

  23. [31]

    Camp-net: Consistency-aware multi- prior network for accelerated mri reconstruction,

    L. Zhang, X. Li, and W. Chen, “Camp-net: Consistency-aware multi- prior network for accelerated mri reconstruction,” IEEE Journal of Biomedical and Health Informatics , pp. 1–14, 2024

  24. [32]

    A motion-corrected deep-learning reconstruction framework for accelerating whole-heart magnetic resonance imaging in patients with congenital heart disease,

    A. Phair, A. Fotaki, L. Felsner, T. J. Fletcher, H. Qi, R. M. Botnar, and C. Prieto, “A motion-corrected deep-learning reconstruction framework for accelerating whole-heart magnetic resonance imaging in patients with congenital heart disease,” Journal of Cardiovascular Magneti...

  25. [33]

    Unsupervised reconstruction of accelerated car- diac cine mri using neural fields,

    T. Catal ´an, M. Courdurier, A. Osses, A. Fotaki, R. Botnar, F. Sahli- Costabal, and C. Prieto, “Unsupervised reconstruction of accelerated car- diac cine mri using neural fields,” Computers in Biology and Medicine , vol. 185, p. 109467, 2025

  26. [34]

    Mantis: model-augmented neural network with incoherent k-space sampling for efficient mr parameter mapping,

    F. Liu, L. Feng, and R. Kijowski, “Mantis: model-augmented neural network with incoherent k-space sampling for efficient mr parameter mapping,” Magnetic resonance in medicine , vol. 82, no. 1, pp. 174– 188, 2019

  27. [35]

    High-performance rapid mr parameter mapping using model-based deep adversarial learning,

    F. Liu, R. Kijowski, L. Feng, and G. El Fakhri, “High-performance rapid mr parameter mapping using model-based deep adversarial learning,” Magnetic resonance imaging , vol. 74, pp. 152–160, 2020

  28. [36]

    Magnetic resonance parameter mapping using model-guided self-supervised deep learning,

    F. Liu, R. Kijowski, G. El Fakhri, and L. Feng, “Magnetic resonance parameter mapping using model-guided self-supervised deep learning,” Magnetic resonance in medicine , vol. 85, no. 6, pp. 3211–3226, 2021

  29. [37]

    Deep model-based magnetic resonance parameter mapping network (dopamine) for fast t1 mapping using variable flip angle method,

    Y . Jun, H. Shin, T. Eo, T. Kim, and D. Hwang, “Deep model-based magnetic resonance parameter mapping network (dopamine) for fast t1 mapping using variable flip angle method,” Medical Image Analysis , vol. 70, p. 102017, 2021

  30. [38]

    Improving quantitative mri using self- supervised deep learning with model reinforcement: Demonstration for rapid t1 mapping,

    W. Bian, A. Jang, and F. Liu, “Improving quantitative mri using self- supervised deep learning with model reinforcement: Demonstration for rapid t1 mapping,” Magnetic Resonance in Medicine , vol. 92, no. 1, pp. 98–111, 2024

  31. [39]

    Zero-deepsub: Zero-shot deep subspace reconstruction for rapid multiparametric quantitative mri using 3d-qalas,

    Y . Jun, Y . Arefeen, J. Cho, S. Fujita, X. Wang, P. E. Grant, B. Gagoski, C. Jaimes, M. S. Gee, and B. Bilgic, “Zero-deepsub: Zero-shot deep subspace reconstruction for rapid multiparametric quantitative mri using 3d-qalas,” Magnetic Resonance in Medicine , vol. 91, no. 6, pp...

  32. [40]

    Denoising diffusion probabilistic models,

    J. Ho, A. Jain, and P. Abbeel, “Denoising diffusion probabilistic models,” Advances in neural information processing systems , vol. 33, pp. 6840– 6851, 2020

  33. [41]

    Improved denoising diffusion proba- bilistic models,

    A. Q. Nichol and P. Dhariwal, “Improved denoising diffusion proba- bilistic models,” International Conference on Machine Learning , pp. 8162–8171, 2021

  34. [42]

    Diffusion models beat gans on image synthesis,

    P. Dhariwal and A. Nichol, “Diffusion models beat gans on image synthesis,” Advances in neural information processing systems , vol. 34, pp. 8780–8794, 2021

  35. [43]

    Score-based diffusion models for accelerated mri,

    H. Chung and J. C. Ye, “Score-based diffusion models for accelerated mri,” Medical image analysis , vol. 80, p. 102479, 2022

  36. [44]

    Come-closer-diffuse-faster: Accelerat- ing conditional diffusion models for inverse problems through stochastic contraction,

    H. Chung, B. Sim, and J. C. Ye, “Come-closer-diffuse-faster: Accelerat- ing conditional diffusion models for inverse problems through stochastic contraction,” Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pp. 12 413–12 422, 2022

  37. [45]

    Adaptive diffusion priors for accelerated mri reconstruction,

    A. G ¨ung¨or, S. U. Dar, S ¸. ¨Ozt¨urk, Y . Korkmaz, H. A. Bedel, G. Elmas, M. Ozbey, and T. C ¸ ukur, “Adaptive diffusion priors for accelerated mri reconstruction,” Medical image analysis , vol. 88, p. 102872, 2023

  38. [46]

    Bayesian mri reconstruction with joint uncertainty estimation using diffusion models,

    G. Luo, M. Blumenthal, M. Heide, and M. Uecker, “Bayesian mri reconstruction with joint uncertainty estimation using diffusion models,” Magnetic Resonance in Medicine , vol. 90, no. 1, pp. 295–311, 2023

  39. [47]

    Diffusion modeling with domain-conditioned prior guidance for accelerated mri and qmri reconstruction,

    W. Bian, A. Jang, L. Zhang, X. Yang, Z. Stewart, and F. Liu, “Diffusion modeling with domain-conditioned prior guidance for accelerated mri and qmri reconstruction,” IEEE Transactions on Medical Imaging, 2024

  40. [48]

    Diffbir: Toward blind image restoration with generative diffusion prior,

    X. Lin, J. He, Z. Chen, Z. Lyu, B. Dai, F. Yu, Y . Qiao, W. Ouyang, and C. Dong, “Diffbir: Toward blind image restoration with generative diffusion prior,”European Conference on Computer Vision, pp. 430–448, 2025

  41. [49]

    k-t grappa: A k-space implementation for dynamic mri with high reduction factor,

    F. Huang, J. Akao, S. Vijayakumar, G. R. Duensing, and M. Limkeman, “k-t grappa: A k-space implementation for dynamic mri with high reduction factor,” Magnetic Resonance in Medicine: An Official Journal of the International Society for Magnetic Resonance in Medicine , vol. 54,...

  42. [50]

    k-t clair: Self-consistency guided multi-prior learning for dynamic parallel mr image reconstruction,

    L. Zhang and W. Chen, “k-t clair: Self-consistency guided multi-prior learning for dynamic parallel mr image reconstruction,” International Workshop on Statistical Atlases and Computational Models of the Heart, pp. 314–325, 2023

  43. [51]

    Golden-angle radial sparse parallel mri: combination of compressed sensing, parallel imaging, and golden-angle radial sampling for fast and flexible dynamic volumetric mri,

    L. Feng, R. Grimm, K. T. Block, H. Chandarana, S. Kim, J. Xu, L. Axel, D. K. Sodickson, and R. Otazo, “Golden-angle radial sparse parallel mri: combination of compressed sensing, parallel imaging, and golden-angle radial sampling for fast and flexible dynamic volumetric mri,” ...

  44. [52]

    L. Feng, L. Axel, H. Chandarana, K. T. Block, D. K. Sodickson, and R. Otazo, “Xd-grasp: golden-angle radial mri with reconstruction of ZHANG et al.: DOMAIN-CONDITIONED AND TEMPORAL-GUIDED DIFFUSION MODELING FOR ACCELERATED DYNAMIC MRI RECONSTRUCTION 15 extra motion-state dimen...

  45. [53]

    An optimal radial profile order based on the golden ratio for time- resolved mri,

    S. Winkelmann, T. Schaeffter, T. Koehler, H. Eggers, and O. Doessel, “An optimal radial profile order based on the golden ratio for time- resolved mri,” IEEE transactions on medical imaging , vol. 26, no. 1, pp. 68–76, 2006

  46. [54]

    Z intensity-weighted position self-respiratory gating method for free- breathing 3d cardiac cine imaging,

    P. Spincemaille, J. Liu, T. Nguyen, M. R. Prince, and Y . Wang, “Z intensity-weighted position self-respiratory gating method for free- breathing 3d cardiac cine imaging,” Magnetic resonance imaging , vol. 29, no. 6, pp. 861–868, 2011

  47. [55]

    Non-cartesian data reconstruction using grappa operator gridding (grog),

    N. Seiberlich, F. A. Breuer, M. Blaimer, K. Barkauskas, P. M. Jakob, and M. A. Griswold, “Non-cartesian data reconstruction using grappa operator gridding (grog),” Magnetic Resonance in Medicine: An Offi- cial Journal of the International Society for Magnetic Resonance in Medi...

  48. [56]

    Self- calibrating grappa operator gridding for radial and spiral trajectories,

    N. Seiberlich, F. Breuer, M. Blaimer, P. Jakob, and M. Griswold, “Self- calibrating grappa operator gridding for radial and spiral trajectories,” Magnetic Resonance in Medicine: An Official Journal of the Interna- tional Society for Magnetic Resonance in Medicine , vol. 59, no...

  49. [57]

    Optimization and validation of accelerated golden-angle radial sparse mri reconstruction with self-calibrating grappa operator gridding,

    T. Benkert, Y . Tian, C. Huang, E. V . DiBella, H. Chandarana, and L. Feng, “Optimization and validation of accelerated golden-angle radial sparse mri reconstruction with self-calibrating grappa operator gridding,” Magnetic resonance in medicine , vol. 80, no. 1, pp. 286–293, 2018

  50. [58]

    Cmrxrecon: A publicly available k-space dataset and benchmark to advance deep learning for cardiac mri,

    C. Wang, J. Lyu, S. Wang, C. Qin, K. Guo, X. Zhang, X. Yu, Y . Li, F. Wang, J. Jin et al., “Cmrxrecon: A publicly available k-space dataset and benchmark to advance deep learning for cardiac mri,” Scientific Data, vol. 11, no. 1, p. 687, 2024

  51. [59]

    Coil com- pression for accelerated imaging with cartesian sampling,

    T. Zhang, J. M. Pauly, S. S. Vasanawala, and M. Lustig, “Coil com- pression for accelerated imaging with cartesian sampling,” Magnetic resonance in medicine , vol. 69, no. 2, pp. 571–582, 2013

  52. [60]

    Understanding the difficulty of training deep feedforward neural networks,

    X. Glorot and Y . Bengio, “Understanding the difficulty of training deep feedforward neural networks,” Proceedings of the thirteenth interna- tional conference on artificial intelligence and statistics , pp. 249–256, 2010

  53. [61]

    Decoupled weight decay regularization,

    I. Loshchilov, “Decoupled weight decay regularization,” arXiv preprint arXiv:1711.05101, 2017

  54. [62]

    Active computer vision by cooperative focus and stereo,

    E. P. Krotkov, “Active computer vision by cooperative focus and stereo,” 1989

  55. [63]

    Grasp-pro: improving grasp dce-mri through self-calibrating subspace- modeling and contrast phase automation,

    L. Feng, Q. Wen, C. Huang, A. Tong, F. Liu, and H. Chandarana, “Grasp-pro: improving grasp dce-mri through self-calibrating subspace- modeling and contrast phase automation,” Magnetic resonance in medicine, vol. 83, no. 1, pp. 94–108, 2020

  56. [64]

    Multi-task magnetic resonance imaging reconstruction using meta-learning,

    W. Bian, A. Jang, and F. Liu, “Multi-task magnetic resonance imaging reconstruction using meta-learning,” Magnetic Resonance Imaging , vol. 116, p. 110278, 2025

  57. [65]

    High- resolution image synthesis with latent diffusion models,

    R. Rombach, A. Blattmann, D. Lorenz, P. Esser, and B. Ommer, “High- resolution image synthesis with latent diffusion models,” Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , pp. 10 684–10 695, 2022

  58. [66]

    Deep subspace learning for efficient reconstruction of spatiotemporal imaging data,

    C. M. Sandino, F. Ong, S. S. Iyer, A. Bush, and S. Vasanawala, “Deep subspace learning for efficient reconstruction of spatiotemporal imaging data,” NeurIPS 2021 Workshop on Deep Learning and Inverse Problems, 2021. SUPPORTING INFORMATION The following supporting information i...

  59. [67]

    Self-Attention

    (C) Both λxt and λkt set to equal, varying values. These experiments evaluate the relative contributions of x-t and k-t priors to the reconstruction of cine short-axis (SAX) and long- axis (LAX) cardiac MR images. For the experiments presented in the manuscript, λxt and λkt we...

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.