TasksSotADatasetsPapersMethodsSubmitAbout
Papers With Code 2

A community resource for machine learning research: papers, code, benchmarks, and state-of-the-art results.

Explore

Notable BenchmarksAll SotADatasetsPapersMethods

Community

Submit ResultsAbout

Data sourced from the PWC Archive (CC-BY-SA 4.0). Built by the community, for the community.

Papers/Fill the K-Space and Refine the Image: Prompting for Dynam...

Fill the K-Space and Refine the Image: Prompting for Dynamic and Multi-Contrast MRI Reconstruction

Bingyu Xin, Meng Ye, Leon Axel, Dimitris N. Metaxas

2023-09-25MRI Reconstruction
PaperPDFCode(official)

Abstract

The key to dynamic or multi-contrast magnetic resonance imaging (MRI) reconstruction lies in exploring inter-frame or inter-contrast information. Currently, the unrolled model, an approach combining iterative MRI reconstruction steps with learnable neural network layers, stands as the best-performing method for MRI reconstruction. However, there are two main limitations to overcome: firstly, the unrolled model structure and GPU memory constraints restrict the capacity of each denoising block in the network, impeding the effective extraction of detailed features for reconstruction; secondly, the existing model lacks the flexibility to adapt to variations in the input, such as different contrasts, resolutions or views, necessitating the training of separate models for each input type, which is inefficient and may lead to insufficient reconstruction. In this paper, we propose a two-stage MRI reconstruction pipeline to address these limitations. The first stage involves filling the missing k-space data, which we approach as a physics-based reconstruction problem. We first propose a simple yet efficient baseline model, which utilizes adjacent frames/contrasts and channel attention to capture the inherent inter-frame/-contrast correlation. Then, we extend the baseline model to a prompt-based learning approach, PromptMR, for all-in-one MRI reconstruction from different views, contrasts, adjacent types, and acceleration factors. The second stage is to refine the reconstruction from the first stage, which we treat as a general video restoration problem to further fuse features from neighboring frames/contrasts in the image domain. Extensive experiments show that our proposed method significantly outperforms previous state-of-the-art accelerated MRI reconstruction methods.

Results

TaskDatasetMetricValueModel
Image ReconstructionfastMRI Knee Val 8x NMSE0.008PromptMR
Image ReconstructionfastMRI Knee Val 8x PSNR37.78PromptMR
Image ReconstructionfastMRI Knee Val 8x Params (M)80PromptMR
Image ReconstructionfastMRI Knee Val 8x SSIM0.8983PromptMR
MRI ReconstructionfastMRI Knee Val 8x NMSE0.008PromptMR
MRI ReconstructionfastMRI Knee Val 8x PSNR37.78PromptMR
MRI ReconstructionfastMRI Knee Val 8x Params (M)80PromptMR
MRI ReconstructionfastMRI Knee Val 8x SSIM0.8983PromptMR

Related Papers

MDPG: Multi-domain Diffusion Prior Guidance for MRI Reconstruction2025-06-30Adaptive Mask-guided K-space Diffusion for Accelerated MRI Reconstruction2025-06-23From Coarse to Continuous: Progressive Refinement Implicit Neural Representation for Motion-Robust Anisotropic MRI Reconstruction2025-06-19DUN-SRE: Deep Unrolling Network with Spatiotemporal Rotation Equivariance for Dynamic MRI Reconstruction2025-06-12Low-Rank Augmented Implicit Neural Representation for Unsupervised High-Dimensional Quantitative MRI Reconstruction2025-06-10Implicit Neural Representation-Based MRI Reconstruction Method with Sensitivity Map Constraints2025-06-06Sparsity-Driven Parallel Imaging Consistency for Improved Self-Supervised MRI Reconstruction2025-05-30Edge Computing for Physics-Driven AI in Computational MRI: A Feasibility Study2025-05-30