Joint Reconstruction of Multi-contrast Images and Multi-channel Coil Sensitivities

Magnetic resonance imaging (MRI) has an important feature that it provides multiple images with different contrasts for complementary diagnostic information. However, a large amount of data is needed for multi-contrast images depiction, and thus, the scan is time-consuming. Many methods based on parallel magnetic resonance imaging (pMRI) and compressed sensing (CS) are applied to accelerate multi-contrast MR imaging. Nevertheless, the image reconstructed by sophisticated pMRI methods contains residual aliasing artifact that degrades the quality of the image when the acceleration factor is high. Other methods based on CS always suffer the regularization parameter-selecting problem. To address these issues, a new method is presented for joint multi-contrast image reconstruction and coil sensitivity estimation. The coil sensitivities can be shared during the reconstruction due to the identity of coil sensitivity profiles of different contrast images for imaging stationary tissues. The proposed method uses the coil sensitivities as sharable information during the reconstruction to improve the reconstruction quality. As a result, the residual aliasing artifact can be effectively removed in the reconstructed multi-contrast images even if the acceleration factor is high. Besides, as there is no regularization term in the proposed method, the troublesome regularization parameter selection in the CS can also be avoided. Results from multi-contrast in vivo experiments demonstrated that multi-contrast images can be jointly reconstructed by the proposed method with effective removal of the residual aliasing artifact at a high acceleration factor.     

Deep unregistered multi-contrast MRI reconstruction

Multiple magnetic resonance images of different contrasts are normally acquired for clinical diagnosis. Recently, research has shown that the previously acquired multi-contrast (MC) images of the same patient can be used as anatomical prior to accelerating magnetic resonance imaging (MRI). However, current MC-MRI networks are based on the assumption that the images are perfectly registered, which is rarely the case in real-world applications. In this paper, we propose an end-to-end deep neural network to reconstruct highly accelerated images by exploiting the shareable information from potentially misaligned reference images of an arbitrary contrast. Specifically, a spatial transformation (ST) module is designed and integrated into the reconstruction network to align the pre-acquired reference images with the images to be reconstructed. The misalignment is further alleviated by maximizing the normalized cross-correlation (NCC) between the MC images. The visualization of feature maps demonstrates that the proposed method effectively reduces the misalignment between the images for shareable information extraction when applied to the publicly available brain datasets. Additionally, the experimental results on these datasets show the proposed network allows the robust exploitation of shareable information across the misaligned MC images, leading to improved reconstruction results.     

Targeted-ROI imaging in electron paramagnetic resonance imaging

Electron paramagnetic resonance imaging (EPRI) is a technique that has been used for in vivo oxygen imaging of small animals. In continuous wave (CW) EPRI, the measurement can be interpreted as a sampled 4D Radon transform of the image function. The conventional filtered-backprojection (FBP) algorithm has been used widely for reconstructing images from full knowledge of the Radon transform acquired in CW EPRI. In practical applications of CW EPRI, one often is interested in information only in a region of interest (ROI) within the imaged subject. It is desirable to accurately reconstruct an ROI image only from partial knowledge of the Radon transform because acquisition of the partial data set can lead to considerable reduction of imaging time. The conventional FBP algorithm cannot, however, reconstruct accurate ROI images from partial knowledge of the Radon transform of even dimension. In this work, we describe two new algorithms, which are referred to as the backprojection filtration (BPF) and minimum-data filtered-backprojection (MDFBP) algorithms, for accurate ROI-image reconstruction from a partial Radon transform (or, truncated Radon transform) in CW EPRI. We have also performed numerical studies in the context of ROI-image reconstruction of a synthetic 2D image with density similar to that found in a small animal EPRI. This demonstrates both the inadequacy of the conventional FBP algorithm and the success of BPF and MDFBP algorithms in ROI reconstruction. The proposed ROI imaging approach promises a means to substantially reduce image acquisition time in CW EPRI.     

一种基于时空变换和压缩感知的磁共振螺旋采样的图像重建算法

螺旋采样磁共振快速成像在功能性成像、并行成像和动态成像等领域发挥着越来越重要的作用.螺旋采样图像重建的传统算法是用核函数将螺旋状分布的k空间数据插值到均匀网格中,再利用傅里叶变换和最小二乘法进行重建.但是基于网格化的算法对核函数过于依赖,在网格化过程中产生难以避免的误差.该文提出了基于时空变换和压缩感知的l1范数的最优化模型和重建算法.时空变换矩阵描述了空间上的磁共振图像与采集到的时域信号间的关系,使得算法直接使用采集到的数据作为保真约束项,避免了网格化过程产生的误差.此外,基于图像处理单元的并行计算被用来提高时空变换矩阵的运算速度,使得算法具有较强的应用价值.     

Fast multi-contrast MRI reconstruction

Multi-contrast magnetic resonance imaging (MRI) is a useful technique to aid clinical diagnosis. This paper proposes an efficient algorithm to jointly reconstruct multiple T1/T2-weighted images of the same anatomical cross section from partially sampled k-space data. The joint reconstruction problem is formulated as minimizing a linear combination of three terms, corresponding to a least squares data fitting, joint total variation (TV) and group wavelet-sparsity regularization. It is rooted in two observations: 1) the variance of image gradients should be similar for the same spatial position across multiple contrasts; 2) the wavelet coefficients of all images from the same anatomical cross section should have similar sparse modes. To efficiently solve this problem, we decompose it into joint TV regularization and group sparsity subproblems, respectively. Finally, the reconstructed image is obtained from the weighted average of solutions from the two subproblems, in an iterative framework. Experiments demonstrate the efficiency and effectiveness of the proposed method compared to existing multi-contrast MRI methods.     

Phase correction-based singularity function analysis for partial k-space reconstruction

Partial k-space acquisition is a conventional method in magnetic resonance imaging (MRI) for reducing imaging time while maintaining image quality. In this field, image reconstruction from partial k-space is a key issue. This paper proposes an approach fundamentally different from traditional techniques for reconstructing magnetic resonance (MR) images from partial k-space. It uses a so-called singularity function analysis (SFA) model based on phase correction. With such a reconstruction approach, some nonacquired negative spatial frequencies are first recovered by means of phase correction and Hermitian symmetry property, and then the other nonacquired negative and/or positive spatial frequencies are estimated using the mathematical SFA model. The method is particularly suitable for asymmetrical partial k-space acquisition owing to its ability of overcoming reconstruction limitations due to k-space truncations. The performance of this approach is evaluated using both simulated and real MR brain images, and compared with existing techniques. The results demonstrate that the proposed SFA based on phase correction achieves higher image quality than the initial SFA or the projection-onto-convex sets (POCS) method.     

Low-field magnetic resonance imaging using multiplicative regularization

In this paper we present a magnetic resonance imaging (MRI) technique that is based on multiplicative regularization. Instead of adding a regularizing objective function to a data fidelity term, we multiply by such a regularizing function. By following this approach, no regularization parameter needs to be determined for each new data set that is acquired. Reconstructions are obtained by iteratively updating the images using short-term conjugate gradient-type update formulas and Polak-Ribière update directions. We show that the algorithm can be used as an image reconstruction algorithm and as a denoising algorithm. We illustrate the performance of the algorithm on two-dimensional simulated low-field MR data that is corrupted by noise and on three-dimensional measured data obtained from a low-field MR scanner. Our reconstruction results show that the algorithm effectively suppresses noise and produces accurate reconstructions even for low-field MR signals with a low signal-to-noise ratio.     

APIR4EMC: Autocalibrated parallel imaging reconstruction for extended multi-contrast imaging

PurposeTo improve image quality of multi-contrast imaging with the proposed Autocalibrated Parallel Imaging Reconstruction for Extended Multi-Contrast Imaging (APIR4EMC).MethodsAPIR4EMC reconstructs multi-contrast images in an autocalibrated parallel imaging reconstruction framework by adding contrasts as virtual coils. Compensation of signal evolution along the echo train of different contrasts is performed to improve signal prediction for missing samples. As a proof of concept, we performed prospectively accelerated phantom and in-vivo brain acquisitions with T1, T1-fat saturated (Fatsat), T2, PD, and FLAIR contrasts. The k-space sampling patterns of these acquisitions were jointly optimized. Images were jointly reconstructed with the proposed APIR4EMC method as well as individually with GRAPPA. Root mean square error (RMSE) to fully sampled reference images and g-factor maps were computed for both methods in the phantom experiment. Visual evaluation was performed in the in-vivo experiment.ResultsCompared to GRAPPA, APIR4EMC reduced artifacts and improved SNR of the reconstructed images in the phantom acquisitions. Quantitatively, APIR4EMC substantially reduced noise amplification (g-factor) as well as RMSE compared to GRAPPA. Signal evolution compensation reduced artifacts. In the in-vivo experiments, 1 mm³ isotropic 3D images with contrasts of T1, T1-Fatsat, T2, PD, and FLAIR were acquired in as little as 7.5 min with the acceleration factor of 9. Reconstruction quality was consistent with the phantom results.ConclusionCompared to single contrast reconstruction with GRAPPA, APIR4EMC reduces artifacts and noise amplification in accelerated multi-contrast imaging.     

基于同时多层激发和并行成像的心脏磁共振电影成像

磁共振成像（MRI）无创无害、对比度多、可以任意剖面成像的特点特别适合用于心脏成像,却因扫描时间长限制了其在临床上的应用.为了解决心脏磁共振电影成像屏气扫描时间过长的问题,该文提出了一种基于同时多层激发的多倍加速心脏磁共振电影成像及其影像重建的方法,该方法将相位调制多层激发（CAIPIRINHA）技术与并行加速（PPA）技术相结合,运用到分段采集心脏电影成像序列中,实现了在相位编码方向和选层方向的四倍加速,并使用改进的SENSE/GRAPPA算法对图像进行重建.分别在水模以及人体上进行了实验,将加速序列图像与不加速序列图像进行对比,结果验证了重建算法的有效性,表明该方法可以在保障图像质量以及准确测量心脏功能的前提下成倍节省扫描时间.     

A multi-scale residual network for accelerated radial MR parameter mapping

A deep learning MR parameter mapping framework which combines accelerated radial data acquisition with a multi-scale residual network (MS-ResNet) for image reconstruction is proposed. The proposed supervised learning strategy uses input image patches from multi-contrast images with radial undersampling artifacts and target image patches from artifact-free multi-contrast images. Subspace filtering is used during pre-processing to denoise input patches. For each anatomy and relaxation parameter, an individual network is trained. in vivo T₁ mapping results are obtained on brain and abdomen datasets and in vivo T₂ mapping results are obtained on brain and knee datasets. Quantitative results for the T₂ mapping of the knee show that MS-ResNet trained using either fully sampled or undersampled data outperforms conventional model-based compressed sensing methods. This is significant because obtaining fully sampled training data is not possible in many applications. in vivo brain and abdomen results for T₁ mapping and in vivo brain results for T₂ mapping demonstrate that MS-ResNet yields contrast-weighted images and parameter maps that are comparable to those achieved by model-based iterative methods while offering two orders of magnitude reduction in reconstruction times. The proposed approach enables recovery of high-quality contrast-weighted images and parameter maps from highly accelerated radial data acquisitions. The rapid image reconstructions enabled by the proposed approach makes it a good candidate for routine clinical use.     

Spiral MRI和图像处理

介绍了在Bruker Biospec 47/30 超导核磁共振成象仪(4.7 T)上实现Spiral快速成像及图像处理系统. 图像处理系统基于PC技术构建而成,主要功能包括：1） 将以Spiral形式采集到的时域磁共振信号转化为适用于快速傅立叶变换的笛卡尔网格(Cartesian)形式（网格化处理）;2）二维快速傅立叶变换(2D-FFT,图像重建);3）由化学位移偏置或磁场不均匀引起得偏共振效应(off-resonance effect)的校正;4）图像分析. 该软件适用于包括以多片多回波在内的各种采样方式得到的Spiral图像的重建和分析,也适用于常规成像数据的重建和分析. 所得到的图像可以以数据方式保存以供再次读入,也能够以TIF、GIF、JPG、BM等格式辅出为图像文件.     

Accelerating MRI Using GROG Gridding Followed by ESPIRiT for Non-Cartesian Trajectories

Parallel imaging plays an important role to reduce data acquisition time in magnetic resonance imaging (MRI). Under-sampled non-Cartesian trajectories accelerate the MRI scan time, but the resulting images may have aliasing artifacts. To remove these artifacts, a variety of methods have been developed within the scope of parallel imaging in the recent past. In this paper, the use of Eigen-vector-based iterative Self-consistent Parallel Imaging Reconstruction Technique (ESPIRiT) along with self-calibrated GRAPPA operator gridding (self-calibrated GROG) on radial k-space data for accelerated MR image reconstruction is presented. The proposed method reconstructs the solution image from non-Cartesian k-space data in two steps: First, the acquired radial data is gridded using self-calibrated GROG and then ESPIRIT is applied on this gridded data to get the un-aliased image. The proposed method is tested on human head data and the short-axis cardiac radial data. The quality of the reconstructed images is evaluated using artifact power (AP), root-mean-square error (RMSE) and peak signal-to-noise ratio (PSNR) at different acceleration factors (AF). The results of the proposed method (GROG followed by ESPIRiT) are compared with GROG followed by pseudo-Cartesian GRAPPA reconstruction approach (conventionally used). The results show that the proposed method provides considerable improvement in the reconstructed images as compared to conventionally used pseudo-Cartesian GRAPPA with GROG, e.g., 87, 67 and 82% improvement in terms of AP for 1.5T, 3T human head and short-axis cardiac radial data, 63, 45 and 57% improvement in terms of RMSE for 1.5T, 3T human head and short-axis cardiac radial data, 11, 7 and 9% improvement in terms of PSNR for 1.5T, 3T human head and short-axis cardiac radial data, respectively, at AF = 4.     

双树小波变换与小波树稀疏联合的低场CS-MRI算法

压缩感知理论常用在磁共振快速成像上,仅采样少量的K空间数据即可重建出高质量的磁共振图像.压缩感知磁共振成像技术的原理是将磁共振图像重建问题建模成一个包含数据保真项、稀疏先验项和全变分项的线性组合最小化问题,显著减少磁共振扫描时间.稀疏表示是压缩感知理论的一个关键假设,重建结果很大程度上依赖于稀疏变换.本文将双树复小波变换和小波树稀疏联合作为压缩感知磁共振成像中的稀疏变换,提出了基于双树小波变换和小波树稀疏的压缩感知低场磁共振图像重建算法.实验表明,本文所提算法可以在某些磁共振图像客观评价指标中表现出一定的优势.     

Fast 3D spatial EPR imaging using spiral magnetic field gradient

Electron paramagnetic resonance imaging (EPRI) provides direct detection and mapping of free radicals. The continuous wave (CW) EPRI technique, in particular, has been widely used in a variety of applications in the fields of biology and medicine due to its high sensitivity and applicability to a wide range of free radicals and paramagnetic species. However, the technique requires long image acquisition periods, and this limits its use for many in vivo applications where relatively rapid changes occur in the magnitude and distribution of spins. Therefore, there has been a great need to develop fast EPRI techniques. We report the development of a fast 3D CW EPRI technique using spiral magnetic field gradient. By spiraling the magnetic field gradient and stepping the main magnetic field, this approach acquires a 3D image in one sweep of the main magnetic field, enabling significant reduction of the imaging time. A direct one-stage 3D image reconstruction algorithm, modified for reconstruction of the EPR images from the projections acquired with the spiral magnetic field gradient, was used. We demonstrated using a home-built L-band EPR system that the spiral magnetic field gradient technique enabled a 4-7-fold accelerated acquisition of projections. This technique has great potential for in vivo studies of free radicals and their metabolism.     

Compressed sensing MR image reconstruction using a motion-compensated reference

Compressed sensing (CS)-based methods have been proposed for image reconstruction from undersampled magnetic resonance data. Recently, CS-based schemes using reference images have also been proposed to further reduce the sampling requirement. In this study, we propose a new reference-constrained CS reconstruction method that accounts for the misalignment between the reference and the target image to be reconstructed. The proposed method uses a new image model that represents the target image as a linear combination of a motion-dependent reference image and a sparse difference image. We then use an efficient iterative algorithm to jointly estimate the motion parameters and the difference image from sparsely sampled data. Simulation results from a numerical phantom data set and an in vivo data set show that the proposed method can accurately compensate the motion effects between the reference and the target images and improve reconstruction quality. The proposed method should prove useful for several applications such as interventional imaging, longitudinal imaging studies and dynamic contrast-enhanced imaging.     

Singular Value Decomposition Using Jacobi Algorithm in pMRI and CS

Parallel magnetic resonance imaging (pMRI) and compressed sensing (CS) have been recently used to accelerate data acquisition process in MRI. Matrix inversion (for rectangular matrices) is required to reconstruct images from the acquired under-sampled data in various pMRI algorithms (e.g., SENSE, GRAPPA) and CS. Singular value decomposition (SVD) provides a mechanism to accurately estimate pseudo-inverse of a rectangular matrix. This work proposes the use of Jacobi SVD algorithm to reconstruct MR images from the acquired under-sampled data both in pMRI and in CS. The use of Jacobi SVD algorithm is proposed in advance MRI reconstruction algorithms, including SENSE, GRAPPA, and low-rank matrix estimation in L + S model for matrix inversion and estimation of singular values. Experiments are performed on 1.5T human head MRI data and 3T cardiac perfusion MRI data for different acceleration factors. The reconstructed images are analyzed using artifact power and central line profiles. The results show that the Jacobi SVD algorithm successfully reconstructs the images in SENSE, GRAPPA, and L + S algorithms. The benefit of using Jacobi SVD algorithm for MRI image reconstruction is its suitability for parallel computation on GPUs, which may be a great help in reducing the image reconstruction time.     

A software channel compression technique for faster reconstruction with many channels

In magnetic resonance imaging, highly parallel imaging using coil arrays with a large number of elements is an area of growing interest. With increasing channel numbers for parallel acquisition, the increased reconstruction time and extensive computer memory requirements have become significant concerns. In this work, principal component analysis (PCA) is used to develop a channel compression technique. This technique efficiently reduces the size of parallel imaging data acquired from a multichannel coil array, thereby significantly reducing the reconstruction time and computer memory requirement without undermining the benefits of multichannel coil arrays. Clinical data collected with a 32-channel cardiac coil are used in all of the experiments. The performance of the proposed method on parallel, partially acquired data, as well as fully acquired data, was evaluated. Experimental results show that the proposed method dramatically reduces the processing time without considerable degradation in the quality of reconstructed images. It is also demonstrated that this PCA technique can be used to perform intensity correction in parallel imaging applications.     

Optimizing Image Reconstruction in SENSE Using GPU

Parallel magnetic resonance imaging (MRI) (pMRI) uses multiple receiver coils to reduce the MRI scan time. To accelerate the data acquisition process in MRI, less amount of data is acquired from the scanner which leads to artifacts in the reconstructed images. SENSitivity Encoding (SENSE) is a reconstruction algorithm in pMRI to remove aliasing artifacts from the undersampled multi coil data and recovers fully sampled images. The main limitation of SENSE is computing inverse of the encoding matrix. This work proposes the inversion of encoding matrix using Jacobi singular value decomposition (SVD) algorithm for image reconstruction on GPUs to accelerate the reconstruction process. The performance of Jacobi SVD is compared with Gauss–Jordan algorithm. The simulations are performed on two datasets (brain and cardiac) with acceleration factors 2, 4, 6 and 8. The results show that the graphics processing unit (GPU) provides a speed up to 21.6 times as compared to CPU reconstruction. Jacobi SVD algorithm performs better in terms of acceleration in reconstructions on GPUs as compared to Gauss–Jordan method. The proposed algorithm is suitable for any number of coils and acceleration factors for SENSE reconstruction on real time processing systems.     

Synthetic T1-weighted brain image generation with incorporated coil intensity correction using DESPOT1

The increased use of phased-array and surface coils in magnetic resonance imaging, the push toward increased field strength and the need for standardized imaging across multiple sites during clinical trials have resulted in the need for methods that can ensure consistency of intensity both within the image and across multiple subjects/sites. Here, we describe a means of addressing these concerns through an extension of the rapid T(1) mapping technique - driven equilibrium single-pulse observation of T(1). The effectiveness of the proposed approach was evaluated using human brain T(1) maps acquired at 1.5 T with a multichannel phased-array coil. Corrected "synthetic" T(1)-weighted images were reconstructed by substituting the T(1) values back into the governing signal intensity equation while assuming a constant value for the equilibrium magnetization. To demonstrate signal normalization across a longitudinal study, we calculated synthetic T(1)-weighted images from data acquired from the same healthy subject at four different time points. Signal intensity profiles between the acquired and synthetic images were compared to determine the improvements with our proposed approach. Following correction, the images demonstrate obvious qualitative improvement with increased signal uniformity across the image. Near-perfect signal normalization was also observed across the longitudinal study, allowing direct comparison between the images. In addition, we observe an increase in contrast-to-noise ratio (compared with regular T(1)-weighted images) for synthetic images created, assuming uniform proton density throughout the volume. The proposed approach permits rapid correction for signal intensity inhomogeneity without significantly lengthening exam time or reducing image signal-to-noise ratio. This technique also provides a robust method for signal normalization, which is useful in multicenter longitudinal MR studies of disease progression, and allows the user to reconstruct T(1)-weighted images with arbitrary T(1) weighting.