Synthesizing PET images from high-field and ultra-high-field MR images using joint diffusion attention model.

BACKGROUND: Magnetic Resonance Imaging (MRI) and Positron Emission Tomography (PET) stand as pivotal diagnostic tools for brain disorders, offering the potential for mutually enriching disease diagnostic perspectives. However, the costs associated with PET scans and the inherent radioactivity have limited the widespread application of PET. Furthermore, it is noteworthy to highlight the promising potential of high-field and ultra-high-field neuroimaging in cognitive neuroscience research and clinical practice. With the enhancement of MRI resolution, a related question arises: can high-resolution MRI improve the quality of PET images? PURPOSE: This study aims to enhance the quality of synthesized PET images by leveraging the superior resolution capabilities provided by high-field and ultra-high-field MRI. METHODS: From a statistical perspective, the joint probability distribution is considered the most direct and fundamental approach for representing the correlation between PET and MRI. In this study, we proposed a novel model, the joint diffusion attention model, namely, the joint diffusion attention model (JDAM), which primarily focuses on learning information about the joint probability distribution. JDAM consists of two primary processes: the diffusion process and the sampling process. During the diffusion process, PET gradually transforms into a Gaussian noise distribution by adding Gaussian noise, while MRI remains fixed. The central objective of the diffusion process is to learn the gradient of the logarithm of the joint probability distribution between MRI and noise PET. The sampling process operates as a predictor-corrector. The predictor initiates a reverse diffusion process, and the corrector applies Langevin dynamics. RESULTS: Experimental results from the publicly available Alzheimer's Disease Neuroimaging Initiative dataset highlight the effectiveness of the proposed model compared to state-of-the-art (SOTA) models such as Pix2pix and CycleGAN. Significantly, synthetic PET images guided by ultra-high-field MRI exhibit marked improvements in signal-to-noise characteristics when contrasted with those generated from high-field MRI data. These results have been endorsed by medical experts, who consider the PET images synthesized through JDAM to possess scientific merit. This endorsement is based on their symmetrical features and precise representation of regions displaying hypometabolism, a hallmark of Alzheimer's disease. CONCLUSIONS: This study establishes the feasibility of generating PET images from MRI. Synthesis of PET by JDAM significantly enhances image quality compared to SOTA models.

A Two-Stage Generative Model with CycleGAN and Joint Diffusion for MRI-based Brain Tumor Detection.

Accuratedetection and segmentation of brain tumors is critical for medical diagnosis. However, current supervised learning methods require extensively annotated images and the state-of-the-art generative models used in unsupervised methods often have limitations in covering the whole data distribution. In this paper, we propose a novel framework Two-Stage Generative Model (TSGM) that combines Cycle Generative Adversarial Network (CycleGAN) and Variance Exploding stochastic differential equation using joint probability (VE-JP) to improve brain tumor detection and segmentation. The CycleGAN is trained on unpaired data to generate abnormal images from healthy images as data prior. Then VE-JP is implemented to reconstruct healthy images using synthetic paired abnormal images as a guide, which alters only pathological regions but not regions of healthy. Notably, our method directly learned the joint probability distribution for conditional generation. The residual between input and reconstructed images suggests the abnormalities and a thresholding method is subsequently applied to obtain segmentation results. Furthermore, the multimodal results are weighted with different weights to improve the segmentation accuracy further. We validated our method on three datasets, and compared with other unsupervised methods for anomaly detection and segmentation. The DSC score of 0.8590 in BraTs2020 dataset, 0.6226 in ITCS dataset and 0.7403 in In-house dataset show that our method achieves better segmentation performance and has better generalization.

High-Frequency Space Diffusion Model for Accelerated MRI.

Diffusion models with continuous stochastic differential equations (SDEs) have shown superior performances in image generation. It can serve as a deep generative prior to solving the inverse problem in magnetic resonance (MR) reconstruction. However, low-frequency regions of k -space data are typically fully sampled in fast MR imaging, while existing diffusion models are performed throughout the entire image or k -space, inevitably introducing uncertainty in the reconstruction of low-frequency regions. Additionally, existing diffusion models often demand substantial iterations to converge, resulting in time-consuming reconstructions. To address these challenges, we propose a novel SDE tailored specifically for MR reconstruction with the diffusion process in high-frequency space (referred to as HFS-SDE). This approach ensures determinism in the fully sampled low-frequency regions and accelerates the sampling procedure of reverse diffusion. Experiments conducted on the publicly available fastMRI dataset demonstrate that the proposed HFS-SDE method outperforms traditional parallel imaging methods, supervised deep learning, and existing diffusion models in terms of reconstruction accuracy and stability. The fast convergence properties are also confirmed through theoretical and experimental validation. Our code and weights are available at https://github.com/Aboriginer/HFS-SDE.

Annihilation-Net: Learned annihilation relation for dynamic MR imaging.

BACKGROUND: Deep learning methods driven by the low-rank regularization have achieved attractive performance in dynamic magnetic resonance (MR) imaging. The effectiveness of existing methods lies mainly in their ability to capture interframe relationships using network modules, which are lack interpretability. PURPOSE: This study aims to design an interpretable methodology for modeling interframe relationships using convolutiona networks, namely Annihilation-Net and use it for accelerating dynamic MRI. METHODS: Based on the equivalence between Hankel matrix product and convolution, we utilize convolutional networks to learn the null space transform for characterizing low-rankness. We employ low-rankness to represent interframe correlations in dynamic MR imaging, while combining with sparse constraints in the compressed sensing framework. The corresponding optimization problem is solved in an iterative form with the semi-quadratic splitting method (HQS). The iterative steps are unrolled into a network, dubbed Annihilation-Net. All the regularization parameters and null space transforms are set as learnable in the Annihilation-Net. RESULTS: Experiments on the cardiac cine dataset show that the proposed model outperforms other competing methods both quantitatively and qualitatively. The training set and test set have 800 and 118 images, respectively. CONCLUSIONS: The proposed Annihilation-Net improves the reconstruction quality of accelerated dynamic MRI with better interpretability.

PEARL: Cascaded Self-supervised Cross-fusion Learning For Parallel MRI Acceleration.

Supervised deep learning (SDL) methodology holds promise for accelerated magnetic resonance imaging (AMRI) but is hampered by the reliance on extensive training data. Some self-supervised frameworks, such as deep image prior (DIP), have emerged, eliminating the explicit training procedure but often struggling to remove noise and artifacts under significant degradation. This work introduces a novel self-supervised accelerated parallel MRI approach called PEARL, leveraging a multiple-stream joint deep decoder with two cross-fusion schemes to accurately reconstruct one or more target images from compressively sampled k-space. Each stream comprises cascaded cross-fusion sub-block networks (SBNs) that sequentially perform combined upsampling, 2D convolution, joint attention, ReLU activation and batch normalization (BN). Among them, combined upsampling and joint attention facilitate mutual learning between multiple-stream networks by integrating multi-parameter priors in both additive and multiplicative manners. Long-range unified skip connections within SBNs ensure effective information propagation between distant cross-fusion layers. Additionally, incorporating dual-normalized edge-orientation similarity regularization into the training loss enhances detail reconstruction and prevents overfitting. Experimental results consistently demonstrate that PEARL outperforms the existing state-of-the-art (SOTA) self-supervised AMRI technologies in various MRI cases. Notably, 5-fold  âˆ¼ 6-fold accelerated acquisition yields a 1 %  âˆ¼  2 % improvement in SSIM ROI and a 3 %  âˆ¼  6 % improvement in PSNR ROI, along with a significant 15 %  âˆ¼  20 % reduction in RLNE ROI.

K-UNN: k-space interpolation with untrained neural network.

Recently, untrained neural networks (UNNs) have shown satisfactory performances for MR image reconstruction on random sampling trajectories without using additional full-sampled training data. However, the existing UNN-based approaches lack the modeling of physical priors, resulting in poor performance in some common scenarios (e.g., partial Fourier (PF), regular sampling, etc.) and the lack of theoretical guarantees for reconstruction accuracy. To bridge this gap, we propose a safeguarded k-space interpolation method for MRI using a specially designed UNN with a tripled architecture driven by three physical priors of the MR images (or k-space data), including transform sparsity, coil sensitivity smoothness, and phase smoothness. We also prove that the proposed method guarantees tight bounds for interpolated k-space data accuracy. Finally, ablation experiments show that the proposed method can characterize the physical priors of MR images well. Additionally, experiments show that the proposed method consistently outperforms traditional parallel imaging methods and existing UNNs, and is even competitive against supervised-trained deep learning methods in PF and regular undersampling reconstruction.

Accelerating Magnetic Resonance T1ρ Mapping Using Simultaneously Spatial Patch-Based and Parametric Group-Based Low-Rank Tensors (SMART).

Quantitative magnetic resonance (MR) [Formula: see text] mapping is a promising approach for characterizing intrinsic tissue-dependent information. However, long scan time significantly hinders its widespread applications. Recently, low-rank tensor models have been employed and demonstrated exemplary performance in accelerating MR [Formula: see text] mapping. This study proposes a novel method that uses spatial patch-based and parametric group-based low-rank tensors simultaneously (SMART) to reconstruct images from highly undersampled k-space data. The spatial patch-based low-rank tensor exploits the high local and nonlocal redundancies and similarities between the contrast images in [Formula: see text] mapping. The parametric group-based low-rank tensor, which integrates similar exponential behavior of the image signals, is jointly used to enforce multidimensional low-rankness in the reconstruction process. In vivo brain datasets were used to demonstrate the validity of the proposed method. Experimental results demonstrated that the proposed method achieves 11.7-fold and 13.21-fold accelerations in two-dimensional and three-dimensional acquisitions, respectively, with more accurate reconstructed images and maps than several state-of-the-art methods. Prospective reconstruction results further demonstrate the capability of the SMART method in accelerating MR [Formula: see text] imaging.

Accelerated submillimeter wave-encoded magnetic resonance imaging via deep untrained neural network.

BACKGROUND: Wave gradient encoding can adequately utilize coil sensitivity profiles to facilitate higher accelerations in parallel magnetic resonance imaging (pMRI). However, there are limitations in mainstream pMRI and a few deep learning (DL) methods for recovering missing data under wave encoding framework: the former is prone to introduce errors from the auto-calibration signals (ACS) signal acquisition and is time-consuming, while the latter requires a large amount of training data. PURPOSE: To tackle the above issues, an untrained neural network (UNN) model incorporating wave-encoded physical properties and deep generative model, named WDGM, was proposed with additional ACS- and training data-free. METHODS: Generally, the proposed method can provide powerful missing data interpolation capability using the wave physical encoding framework and designed UNN to characterize the MR image (k-space data) priors. Specifically, the MRI reconstruction combining physical wave encoding and elaborate UNN is modeled as a generalized minimization problem. The designation of UNN is driven by the coil sensitivity maps (CSM) smoothness and k-space linear predictability. And then, the iterative paradigm to recover the full k-space signal is determined by the projected gradient descent, and the complex computation is unrolled to the network with optimized parameters by the optimizer. Simulated wave encoding and in vivo experiments are exploited to demonstrate the feasibility of the proposed method. The best quantitative metrics RMSE/SSIM/PSNR of 0.0413, 0.9514, and 37.4862 gave competitive results in all experiments with at least six-fold acceleration, respectively. RESULTS: In vivo experiments of human brains and knees showed that the proposed method can achieve comparable reconstruction quality and even has superiority relative to the comparison, especially at a high resolution of 0.67 mm and fewer ACS. In addition, the proposed method has a higher computational efficiency achieving a computation time of 9.6 s/per slice. CONCLUSIONS: The model proposed in this work addresses two limitations of MRI reconstruction in the wave encoding framework. The first is to eliminate the need for ACS signal acquisition to perform the time-consuming calibration process and to avoid errors such as motion during the acquisition procedure. Furthermore, the proposed method has clinical application friendly without the need to prepare large training datasets, which is difficult in the clinical. All results of the proposed method demonstrate more confidence in both quantitative and qualitative metrics. In addition, the proposed method can achieve higher computational efficiency.

Accelerated cardiac cine MRI using spatiotemporal correlation-based hybrid plug-and-play priors (SEABUS).

Objective. The plug-and-play prior (P3) can be flexibly coupled with multiple iterative optimizations, which has been successfully applied to the inverse problems of medical imaging. In this work, for accelerated cardiac cine magnetic resonance imaging (CC-MRI), the Spatiotemporal corrElAtion-based hyBrid plUg-and-play priorS (SEABUS) integrating a local P3and a nonlocal P3are introduced.Approach. Specifically, the local P3enforces pixelwise edge-orientation consistency by conducting reference frame guided multiscale orientation projection on a subset containing a few adjacent frames; the nonlocal P3constrains the cubewise anatomic-structure similarity by performing cube matching and 4D filtering (CM4D) on all frames. By using effectively a composite splitting algorithm (CSA), SEABUS is incorporated into a fast iterative shrinkage-thresholding algorithm and a new accelerated CC-MRI approach named SEABUS-FCSA is proposed.Main results. The experiment and algorithm analysis demonstrate the efficiency and potential of the proposed SEABUS-FCSA approach, which has the best performance in terms of reducing aliasing artifacts and capturing dynamic features in comparison with several state-of-the-art accelerated CC-MRI technologies.Significance. Our approach aims to propose a new hybrid P3based iterative algorithm, which is not only used to improve the quality of accelerated cardiac cine imaging but also extend the FCSA methodology.