Accelerated magnetic resonance imaging using the sparsity of multi-channel coil images

Joint estimation of coil sensitivities and output image (JSENSE) is a promising approach that improves the reconstruction of parallel magnetic resonance imaging (pMRI). However, when acceleration factor increases, the signal to noise ratio (SNR) of JSENSE reconstruction decreases as quickly as that of the conventional pMRI. Although sparse constraints have been used to improve the JSENSE reconstruction in recent years, these constraints only use the sparsity of the output image, which cannot fully exploit the prior information of pMRI. In this paper, we use the sparsity of coil images, instead of the output image, to exploit more prior information for JSENSE. Numerical simulation, phantom and in vivo experiments demonstrate that the proposed method has better performance than the SparseSENSE method and the constrained JSENSE method using the sparsity of the output image only.     

Parallel variable-density spiral imaging using nonlocal total variation reconstruction

The relatively long scan time is still a bottleneck for both clinical applications and research of magnetic resonance imaging. To reduce the data acquisition time, we propose a novel fast magnetic resonance imaging method based on parallel variable-density spiral acquisition, which combines undersampling optimization and nonlocal total variation reconstruction.The undersampling optimization promotes the incoherence of resultant aliasing artifact via the "worst-case" residual error metric, and thus accelerates the data acquisition. Moreover, nonlocal total variation reconstruction is utilized to remove such an incoherent aliasing artifact and so improve image quality. The feasibility of the proposed method is demonstrated by both numerical phantom simulation and in vivo experiment. The experimental results show that the proposed method can achieve high acceleration factor and effectively remove an aliasing artifact from data undersampling with well-preserved image details. The image quality is better than that achieved with the total variation method.     

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.     

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.     

Sparse MRI reconstruction using multi-contrast image guided graph representation

Accelerating the imaging speed without sacrificing image structures plays an important role in magnetic resonance imaging. Under-sampling the k-space data and reconstructing the image with sparsity constraint is one efficient way to reduce the data acquisition time. However, achieving high acceleration factor is challenging since image structures may be lost or blurred when the acquired information is not sufficient. Therefore, incorporating extra knowledge to improve image reconstruction is expected for highly accelerated imaging. Fortunately, multi-contrast images in the same region of interest are usually acquired in magnetic resonance imaging protocols. In this work, we propose a new approach to reconstruct magnetic resonance images by learning the prior knowledge from these multi-contrast images with graph-based wavelet representations. We further formulate the reconstruction as a bi-level optimization problem to allow misalignment between these images. Experiments on realistic imaging datasets demonstrate that the proposed approach improves the image reconstruction significantly and is practical for real world application since patients are unnecessarily to stay still during successive reference image scans.     

Improved simultaneous multislice magnetic resonance imaging using total variation regularization

Controlled aliasing in parallel imaging results in higher acceleration(CAIPIRINHA) for simultaneous multislice imaging has been proposed recently, which combines multiband excitation and phase cycling techniques to reduce scan time and improve subsequent imaging reconstruction. In this work, the total variation(TV) regularization method is used to further improve CAIPIRINHA. The TV regularization uses an edge-preserving prior, which establishes a relationship between neighboring pixels for image reconstruction. It reduces artifacts and suppresses noise amplification simultaneously.The results are presented with a standard eight-channel head coil with an acceleration factor of 4, where the TV-regularized CAIPIRINHA generates an improved reconstruction as compared with a typical nonregularized CAIPIRINHA.     

GPU based parallel framework for receiver coil sensitivity estimation in SENSE reconstruction

Magnetic Resonance Imaging (MRI) uses non-ionizing radiations and is safer as compared to CT and X-ray imaging. MRI is broadly used around the globe for medical diagnostics. One main limitation of MRI is its long data acquisition time. Parallel MRI (pMRI) was introduced in late 1990's to reduce the MRI data acquisition time. In pMRI, data is acquired by under-sampling the Phase Encoding (PE) steps which introduces aliasing artefacts in the MR images. SENSitivity Encoding (SENSE) is a pMRI based method that reconstructs fully sampled MR image from the acquired under-sampled data using the sensitivity information of receiver coils. In SENSE, precise estimation of the receiver coil sensitivity maps is vital to obtain good quality images. Eigen-value method (a recently proposed method in literature for the estimation of receiver coil sensitivity information) does not require a pre-scan image unlike other conventional methods of sensitivity estimation. However, Eigen-value method is computationally intensive and takes a significant amount of time to estimate the receiver coil sensitivity maps. This work proposes a parallel framework for Eigen-value method of receiver coil sensitivity estimation that exploits its inherent parallelism using Graphics Processing Units (GPUs). We evaluated the performance of the proposed algorithm on in-vivo and simulated MRI datasets (i.e. human head and simulated phantom datasets) with Peak Signal-to-Noise Ratio (PSNR) and Artefact Power (AP) as evaluation metrics. The results show that the proposed GPU implementation reduces the execution time of Eigen-value method of receiver coil sensitivity estimation (providing up to 30 times speed up in our experiments) without degrading the quality of the reconstructed image.     

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

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

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.     

基于非均匀螺旋线数据和布雷格曼迭代的快速磁共振成像方法

数据采集时间长是制约磁共振成像技术发展的重要瓶颈.为了解决这一问题, 本文基于压缩感知成像理论, 提出了一种结合非均匀螺旋线磁共振数据采集序列和布雷格曼迭代重建的快速磁共振成像方法, 通过欠采样缩短数据采集时间.欠采样引起混迭伪影则通过非均匀螺旋线欠采样特性和布雷格曼迭代重建去除.水模磁共振成像实验和在体磁共振成像实验结果表明: 欠采样情况下, 所提出的方法能有效去除欠采样导致的混迭伪影, 获得的图像结构信息完整的成像结果, 在缩短采样时间的同时, 具有较高的准确度. 关键词： 磁共振成像 非均匀螺旋线 全变分 布雷格曼迭代     

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.     

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.     

一种结合并行成像和压缩感知的快速磁共振成像新方法

压缩感知（CS）技术和并行成像技术（主要是SENSE技术、GRAPPA技术等）都能通过减少k空间数据的采集量来加快磁共振成像速度,目前已有一些将两种方法相结合进一步加速磁共振成像速度的方法（例如CS-GRAPPA）.本文针对数据采集和重建这两方面对现有CS-GRAPPA方法进行了改进,采集方式上采用了局部等间隔采集模板以满足GRAPPA重建的要求,并对采集模板进行随机放置以满足CS重建的要求;数据重建时,根据自动校正数据估算GRAPPA算法中欠采行的重建误差,并利用误差的大小确定在CS算法中保真的程度.不同磁共振图像重建实验的结果表明：与现有方法相比,本文方法能够更好地保留原有图像细节并有效减少伪影.     

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.     

A simple application of compressed sensing to further accelerate partially parallel imaging

Compressed sensing (CS) and partially parallel imaging (PPI) enable fast magnetic resonance (MR) imaging by reducing the amount of k-space data required for reconstruction. Past attempts to combine these two have been limited by the incoherent sampling requirement of CS since PPI routines typically sample on a regular (coherent) grid. Here, we developed a new method, “CS+GRAPPA,” to overcome this limitation. We decomposed sets of equidistant samples into multiple random subsets. Then, we reconstructed each subset using CS and averaged the results to get a final CS k-space reconstruction. We used both a standard CS and an edge- and joint-sparsity-guided CS reconstruction. We tested these intermediate results on both synthetic and real MR phantom data and performed a human observer experiment to determine the effectiveness of decomposition and to optimize the number of subsets. We then used these CS reconstructions to calibrate the generalized autocalibrating partially parallel acquisitions (GRAPPA) complex coil weights. In vivo parallel MR brain and heart data sets were used. An objective image quality evaluation metric, Case-PDM, was used to quantify image quality. Coherent aliasing and noise artifacts were significantly reduced using two decompositions. More decompositions further reduced coherent aliasing and noise artifacts but introduced blurring. However, the blurring was effectively minimized using our new edge- and joint-sparsity-guided CS using two decompositions. Numerical results on parallel data demonstrated that the combined method greatly improved image quality as compared to standard GRAPPA, on average halving Case-PDM scores across a range of sampling rates. The proposed technique allowed the same Case-PDM scores as standard GRAPPA using about half the number of samples. We conclude that the new method augments GRAPPA by combining it with CS, allowing CS to work even when the k-space sampling pattern is equidistant.     

Nuclear norm-regularized SENSE reconstruction

SENSitivity Encoding (SENSE) is a mathematically optimal parallel magnetic resonance (MRI) imaging technique when the coil sensitivities are known. In recent times, compressed sensing (CS)-based techniques are incorporated within the SENSE reconstruction framework to recover the underlying MR image. CS-based techniques exploit the fact that the MR images are sparse in a transform domain (e.g., wavelets). Mathematically, this leads to an l(1)-norm-regularized SENSE reconstruction. In this work, we show that instead of reconstructing the image by exploiting its transform domain sparsity, we can exploit its rank deficiency to reconstruct it. This leads to a nuclear norm-regularized SENSE problem. The reconstruction accuracy from our proposed method is the same as the l(1)-norm-regularized SENSE, but the advantage of our method is that it is about an order of magnitude faster.     

Motion correction based reconstruction method for compressively sampled cardiac MR imaging

Respiratory motion during Magnetic Resonance (MR) acquisition causes strong blurring artifacts in the reconstructed images. These artifacts become more pronounced when used with the fast imaging reconstruction techniques like compressed sensing (CS). Recently, an MR reconstruction technique has been done with the help of compressed sensing (CS), to provide good quality sparse images from the highly under-sampled k-space data. In order to maximize the benefits of CS, it is obvious to use CS with the motion corrected samples. In this paper, we propose a novel CS based motion corrected image reconstruction technique. First, k-space data have been assigned to different respiratory state with the help of frequency domain phase correlation method. Then, multiple sparsity constraints has been used to provide good quality reconstructed cardiac cine images with the highly under-sampled k-space data. The proposed method exploits the multiple sparsity constraints, in combination with demon based registration technique and a novel reconstruction technique to provide the final motion free images. The proposed method is very simple to implement in clinical settings as compared to existing motion corrected methods. The performance of the proposed method is examined using simulated data and clinical data. Results show that this method performs better than the reconstruction of CS based method of cardiac cine images. Different acceleration rates have been used to show the performance of the proposed method.     

基于PCAU-Net的快速多通道磁共振成像方法

多通道磁共振成像方法采用多个接收线圈同时欠采样k空间以加快成像速度,并基于后处理算法重建图像,但在较高加速因子时,其图像重建质量仍然较差．本文提出了一种基于PCAU-Net的快速多通道磁共振成像方法,将单通道实数U型卷积神经网络拓展到多通道复数卷积神经网络,设计了一种结构不对称的U型网络结构,通过在解码部分减小网络规模以降低模型的复杂度．PCAU-Net网络在跳跃连接前增加了1×1卷积,以实现跨通道信息交互．输入和输出之间利用残差连接为误差的反向传播提供捷径．实验结果表明,使用规则和随机采样模板,在不同加速因子时,相比常规的GRAPPA重建算法和SPIRiT重建方法,本文提出的PCAU-Net方法可高质量重建出磁共振复数图像,并且相比于PCU-Net方法,PCAU-Net减少了模型参数、缩短了训练时间．     

Coil-combined split slice-GRAPPA for simultaneous multi-slice diffusion MRI

Objective: To develop a kernel optimization method called coil-combined split slice-GRAPPA (CC-SSG) to improve the accuracy of the reconstructed coil-combined images for simultaneous multi-slice (SMS) diffusion weighted imaging (DWI) data.Methods: The CC-SSG method optimizes the tuning parameters in the k-space SSG kernels to achieve an optimal trade-off between the intra-slice artifact and inter-slice leakage after the root-sum-of-squares (rSOS) coil combining of the de-aliased SMS DWI data. A detailed analysis is conducted to evaluate the contributions of the intra-slice artifact and inter-slice leakage to the total reconstruction error after coil combining.Results: Comparisons of the proposed CC-SSG method with the slice-GRAPPA (SG) and split slice-GRAPPA (SSG) methods are provided using two in-vivo readout-segmented (RS) EPI datasets collected from stroke patients. The CC-SSG method demonstrates improved accuracy of the reconstructed coil-combined images and the estimated diffusion tensor imaging (DTI) maps.Conclusion: CC-SSG strikes a good balance between the intra-slice artifact and inter-slice leakage for rSOS coil combining, and so can yield better reconstruction performance compared to SG and SSG for rSOS reconstruction. The optimal trade-off between the two artifacts is robust to the contrast of SMS data and the choice of the coil combining method.