MRI Reconstruction with Regularized 3D Diffusion Model (R3DM)
Arya Bangun, Zhuo Cao, Alessio Quercia, Hanno Scharr, Elisabeth Pfaehler
TL;DR
R3DM tackles fast 3D MRI reconstruction from undersampled k-space data by integrating a pre-trained 3D diffusion prior with an optimization framework that enforces k-space fidelity and 3D consistency through Fourier-slice relations. The approach uses a 2D+A diffusion model to form a volumetric prior and couples it with proximal-regularized optimization to promote sparsity and smoothness during diffusion sampling. Experiments across knee, BRATS brain, and plant-root datasets show superior performance to established baselines under in-distribution and out-of-distribution conditions, highlighting the importance of true 3D representation and diffusion priors for high-fidelity reconstructions. The work suggests promising directions for scalable, robust 3D MRI reconstruction and motivates further exploration of diffusion-based priors and real-time inference.
Abstract
Magnetic Resonance Imaging (MRI) is a powerful imaging technique widely used for visualizing structures within the human body and in other fields such as plant sciences. However, there is a demand to develop fast 3D-MRI reconstruction algorithms to show the fine structure of objects from under-sampled acquisition data, i.e., k-space data. This emphasizes the need for efficient solutions that can handle limited input while maintaining high-quality imaging. In contrast to previous methods only using 2D, we propose a 3D MRI reconstruction method that leverages a regularized 3D diffusion model combined with optimization method. By incorporating diffusion based priors, our method improves image quality, reduces noise, and enhances the overall fidelity of 3D MRI reconstructions. We conduct comprehensive experiments analysis on clinical and plant science MRI datasets. To evaluate the algorithm effectiveness for under-sampled k-space data, we also demonstrate its reconstruction performance with several undersampling patterns, as well as with in- and out-of-distribution pre-trained data. In experiments, we show that our method improves upon tested competitors.
