Calibration-less multi-coil MR image reconstruction

In parallel magnetic resonance imaging (MRI), the problem is to reconstruct an image given the partial K-space scans from all the receiver coils. Depending on its position within the scanner, each coil has a different sensitivity profile. All existing parallel MRI techniques require estimation of certain parameters pertaining to the sensitivity profile, e.g., the sensitivity map needs to be estimated for the SENSE and SMASH and the interpolation weights need to be calibrated for GRAPPA and SPIRiT. The assumption is that the estimated parameters are applicable at the operational stage. This assumption does not always hold, consequently the reconstruction accuracies of existing parallel MRI methods may suffer. We propose a reconstruction method called Calibration-Less Multi-coil (CaLM) MRI. As the name suggests, our method does not require estimation of any parameters related to the sensitivity maps and hence does not require a calibration stage. CaLM MRI is an image domain method that produces a sensitivity encoded image for each coil. These images are finally combined by the sum-of-squares method to yield the final image. It is based on the theory of Compressed Sensing (CS). During reconstruction, the constraint that "all the coil images should appear similar" is introduced within the CS framework. This leads to a CS optimization problem that promotes group-sparsity. The results from our proposed method are comparable (at least for the data used in this work) with the best results that can be obtained from state-of-the-art methods.     

Exploiting the wavelet structure in compressed sensing MRI

Sparsity has been widely utilized in magnetic resonance imaging (MRI) to reduce k-space sampling. According to structured sparsity theories, fewer measurements are required for tree sparse data than the data only with standard sparsity. Intuitively, more accurate image reconstruction can be achieved with the same number of measurements by exploiting the wavelet tree structure in MRI. A novel algorithm is proposed in this article to reconstruct MR images from undersampled k-space data. In contrast to conventional compressed sensing MRI (CS-MRI) that only relies on the sparsity of MR images in wavelet or gradient domain, we exploit the wavelet tree structure to improve CS-MRI. This tree-based CS-MRI problem is decomposed into three simpler subproblems then each of the subproblems can be efficiently solved by an iterative scheme. Simulations and in vivo experiments demonstrate the significant improvement of the proposed method compared to conventional CS-MRI algorithms, and the feasibleness on MR data compared to existing tree-based imaging algorithms.     

Motion predicted online dynamic MRI reconstruction from partially sampled k-space data

In this work we address the problem of reconstructing dynamic MRI sequences in an online fashion, i.e. reconstructing the current frame given that the previous frames have been already reconstructed. The reconstruction consists of a prediction and a correction step. The prediction step is based on an Auto-Regressive AR(1) model. Assuming that the prediction is good, the difference between the predicted frame and the actual frame (to be reconstructed) will be sparse. In the correction step, the difference between the predicted frame and the actual frame is estimated from partially sampled K-space data via a sparsity promoting least squares minimization problem. We have compared the proposed method with state-of-the-art methods in online dynamic MRI reconstruction. The experiments have been carried out on 2D and 3D Dynamic Contrast Enhanced (DCE) MRI datasets. Results show that our method yields the least reconstruction error.     

Undersampled MRI reconstruction with patch-based directional wavelets

Compressed sensing has shown great potential in reducing data acquisition time in magnetic resonance imaging (MRI). In traditional compressed sensing MRI methods, an image is reconstructed by enforcing its sparse representation with respect to a preconstructed basis or dictionary. In this paper, patch-based directional wavelets are proposed to reconstruct images from undersampled k-space data. A parameter of patch-based directional wavelets, indicating the geometric direction of each patch, is trained from the reconstructed image using conventional compressed sensing MRI methods and incorporated into the sparsifying transform to provide the sparse representation for the image to be reconstructed. A reconstruction formulation is proposed and solved via an efficient alternating direction algorithm. Simulation results on phantom and in vivo data indicate that the proposed method outperforms conventional compressed sensing MRI methods in preserving the edges and suppressing the noise. Besides, the proposed method is not sensitive to the initial image when training directions.     

Wavelet-based edge correlation incorporated iterative reconstruction for undersampled MRI

Undersampling k-space is an effective way to decrease acquisition time for MRI. However, aliasing artifacts introduced by undersampling may blur the edges of magnetic resonance images, which often contain important information for clinical diagnosis. Moreover, k-space data is often contaminated by the noise signals of unknown intensity. To better preserve the edge features while suppressing the aliasing artifacts and noises, we present a new wavelet-based algorithm for undersampled MRI reconstruction. The algorithm solves the image reconstruction as a standard optimization problem including a ?₂ data fidelity term and ?₁ sparsity regularization term. Rather than manually setting the regularization parameter for the ?₁ term, which is directly related to the threshold, an automatic estimated threshold adaptive to noise intensity is introduced in our proposed algorithm. In addition, a prior matrix based on edge correlation in wavelet domain is incorporated into the regularization term. Compared with nonlinear conjugate gradient descent algorithm, iterative shrinkage/thresholding algorithm, fast iterative soft-thresholding algorithm and the iterative thresholding algorithm using exponentially decreasing threshold, the proposed algorithm yields reconstructions with better edge recovery and noise suppression.     

Improved dynamic MRI reconstruction by exploiting sparsity and rank-deficiency

In this paper we address the problem of dynamic MRI reconstruction from partially sampled K-space data. Our work is motivated by previous studies in this area that proposed exploiting the spatiotemporal correlation of the dynamic MRI sequence by posing the reconstruction problem as a least squares minimization regularized by sparsity and low-rank penalties. Ideally the sparsity and low-rank penalties should be represented by the l₀-norm and the rank of a matrix; however both are NP hard penalties. The previous studies used the convex l₁-norm as a surrogate for the l₀-norm and the non-convex Schatten-q norm (0 < q ≤ 1) as a surrogate for the rank of matrix. Following past research in sparse recovery, we know that non-convex l_p-norm (0 < p ≤ 1) is a better substitute for the NP hard l₀-norm than the convex l₁-norm. Motivated by these studies, we propose improvements over the previous studies by replacing the l₁-norm sparsity penalty by the l_p-norm. Thus, we reconstruct the dynamic MRI sequence by solving a least squares minimization problem regularized by l_p-norm as the sparsity penalty and Schatten-q norm as the low-rank penalty. There are no efficient algorithms to solve the said problems. In this paper, we derive efficient algorithms to solve them. The experiments have been carried out on Dynamic Contrast Enhanced (DCE) MRI datasets. Both quantitative and qualitative analysis indicates the superiority of our proposed improvement over the existing methods.     

Edge-enhanced spatiotemporal constrained reconstruction of undersampled dynamic contrast-enhanced radial MRI

Dynamic contrast-enhanced magnetic resonance imaging (MRI) is a technique used to study and track contrast kinetics in an area of interest in the body over time. Reconstruction of images with high contrast and sharp edges from undersampled data is a challenge. While good results have been reported using a radial acquisition and a spatiotemporal constrained reconstruction (STCR) method, we propose improvements from using spatially adaptive weighting and an additional edge-based constraint. The new method uses intensity gradients from a sliding window reference image to improve the sharpness of edges in the reconstructed image. The method was tested on eight radial cardiac perfusion data sets with 24 rays and compared to the STCR method. The reconstructions showed that the new method, termed edge-enhanced spatiotemporal constrained reconstruction, was able to reconstruct images with sharper edges, and there were a 36%±13.7% increase in contrast-to-noise ratio and a 24%±11% increase in contrast near the edges when compared to STCR. The novelty of this paper is the combination of spatially adaptive weighting for spatial total variation (TV) constraint along with a gradient matching term to improve the sharpness of edges. The edge map from a reference image allows the reconstruction to trade-off between TV and edge enhancement, depending on the spatially varying weighting provided by the edge map.     

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.     

Stationary wavelet transform for under-sampled MRI reconstruction

In addition to coil sensitivity data (parallel imaging), sparsity constraints are often used as an additional l_p-penalty for under-sampled MRI reconstruction (compressed sensing). Penalizing the traditional decimated wavelet transform (DWT) coefficients, however, results in visual pseudo-Gibbs artifacts, some of which are attributed to the lack of translation invariance of the wavelet basis. We show that these artifacts can be greatly reduced by penalizing the translation-invariant stationary wavelet transform (SWT) coefficients. This holds with various additional reconstruction constraints, including coil sensitivity profiles and total variation. Additionally, SWT reconstructions result in lower error values and faster convergence compared to DWT. These concepts are illustrated with extensive experiments on in vivo MRI data with particular emphasis on multiple-channel acquisitions.     

Causal dynamic MRI reconstruction via nuclear norm minimization

This work addresses the problem of online reconstruction of dynamic magnetic resonance images (MRI). The proposed method reconstructs the difference between the images of previous and current time frames. This difference image is modeled as a rank deficient matrix and is solved from the partially sampled k-space data via nuclear norm minimization. Our proposed method has been compared against state-of-the-art offline and online reconstruction methods. Our method has similar reconstruction accuracy as the offline method and significantly higher accuracy compared to the online technique. It is about an order of magnitude faster than the online technique compared against. Our experimental data consisted of dynamic MRI data that were collected at 6 to 7 frames per second and having resolutions of 128×128 and 256×256 pixels per frame. Experimental evaluation indicates that our proposed method is capable of reconstructing 128×128 images at the rate of 4 frames per second and 256×256 images at the rate of 2 frames per second. The previous online method requires about 3.75 s for reconstructing each image. The improvement in reconstruction speed is clearly discernible. Moreover, our method has a reconstruction error that is about half that of the previous online method.     

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.     

Non-convex algorithm for sparse and low-rank recovery: Application to dynamic MRI reconstruction

In this work we exploit two assumed properties of dynamic MRI in order to reconstruct the images from under-sampled K-space samples. The first property assumes the signal is sparse in the x-f space and the second property assumes the signal is rank-deficient in the x-t space. These assumptions lead to an optimization problem that requires minimizing a combined l_p-norm and Schatten-p norm. We propose a novel FOCUSS based approach to solve the optimization problem. Our proposed method is compared with state-of-the-art techniques in dynamic MRI reconstruction. Experimental evaluation carried out on three real datasets shows that for all these datasets, our method yields better reconstruction both in quantitative and qualitative evaluation.     

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

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

Automatic knee cartilage segmentation from multi-contrast MR images using support vector machine classification with spatial dependencies

Accurate segmentation of knee cartilage is required to obtain quantitative cartilage measurements, which is crucial for the assessment of knee pathology caused by musculoskeletal diseases or sudden injuries. This paper presents an automatic knee cartilage segmentation technique which exploits a rich set of image features from multi-contrast magnetic resonance (MR) images and the spatial dependencies between neighbouring voxels. The image features and the spatial dependencies are modelled into a support vector machine (SVM)-based association potential and a discriminative random field (DRF)-based interaction potential. Subsequently, both potentials are incorporated into an inference graphical model such that the knee cartilage segmentation is cast into an optimal labelling problem which can be efficiently solved by loopy belief propagation. The effectiveness of the proposed technique is validated on a database of multi-contrast MR images. The experimental results show that using diverse forms of image and anatomical structure information as the features are helpful in improving the segmentation, and the joint SVM-DRF model is superior to the classification models based solely on DRF or SVM in terms of accuracy when the same features are used. The developed segmentation technique achieves good performance compared with gold standard segmentations and obtained higher average DSC values than the state-of-the-art automatic cartilage segmentation studies.     

基于联合正则化及压缩传感的MRI图像重构

基于压缩传感的MRI图像重构利用图像稀疏的先验知识能从很少的投影值重构原图像。目前MRI重构算法只利用MRI图像稀疏性表示或只利用基于其局部光滑性的先验知识,重构效果不理想。针对此问题,结合两种先验知识,提出一种基于联合正则化及压缩传感的MRI图像重构方法。利用块坐标下降法将求解联合正则化问题转化为交替求解二次凸优化、稀疏正则化和全变差正则化三个简单的优化问题。并提出分别采用共轭梯度法、二元自适应收缩法以及梯度下降法对以上优化问题求解。实验结果表明,该算法重构效果比现有算法有明显地提高。     

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.     

Evaluation of imaging protocol for ECT based on CS image reconstruction algorithm

Single-photon emission computerized tomography and positron emission tomography are essential med- ical imaging tools, for which the sampling angle number and scan time should be carefully chosen to give a good compromise between image quality and radiopharmaceutical dose. In this study, the image quality of different ac- quisition protocols was evaluated via varied angle number and count number per angle with Monte Carlo simulation data. It was shown that, when similar imaging counts were used, the factor of acquisition counts was more important than that of the sampling number in emission computerized tomography. To further reduce the activity requirement and the scan duration, an iterative image reconstruction algorithm for limited-view and low-dose tomography based on compressed sensing theory has been developed. The total variation regulation was added to the reconstruction process to improve the signal to noise Ratio and reduce artifacts caused by the limited angle sampling. Maximization of the maximum likelihood of the estimated image and the measured data and minimization of the total variation of the image are alternatively implemented. By using this advanced algorithm, the reconstruction process is able to achieve image quality matching or exceed that of normal scans with only half of the injection radiopharmaceutical dose.     

Evaluation of imaging protocol for ECT based on CS image reconstruction algorithm

Single-photon emission computerized tomography and positron emission tomography are essential medical imaging tools, for which the sampling angle number and scan time should be carefully chosen to give a good compromise between image quality and radiopharmaceutical dose. In this study, the image quality of different acquisition protocols was evaluated via varied angle number and count number per angle with Monte Carlo simulation data. It was shown that, when similar imaging counts were used, the factor of acquisition counts was more important than that of the sampling number in emission computerized tomography. To further reduce the activity requirement and the scan duration, an iterative image reconstruction algorithm for limited-view and low-dose tomography based on compressed sensing theory has been developed. The total variation regulation was added to the reconstruction process to improve the signal to noise Ratio and reduce artifacts caused by the limited angle sampling. Maximization of the maximum likelihood of the estimated image and the measured data and minimization of the total variation of the image are alternatively implemented. By using this advanced algorithm, the reconstruction process is able to achieve image quality matching or exceed that of normal scans with only half of the injection radiopharmaceutical dose.     

Magnetic resonance image reconstruction using trained geometric directions in 2D redundant wavelets domain and non-convex optimization

Reducing scanning time is significantly important for MRI. Compressed sensing has shown promising results by undersampling the k-space data to speed up imaging. Sparsity of an image plays an important role in compressed sensing MRI to reduce the image artifacts. Recently, the method of patch-based directional wavelets (PBDW) which trains geometric directions from undersampled data has been proposed. It has better performance in preserving image edges than conventional sparsifying transforms. However, obvious artifacts are presented in the smooth region when the data are highly undersampled. In addition, the original PBDW-based method does not hold obvious improvement for radial and fully 2D random sampling patterns. In this paper, the PBDW-based MRI reconstruction is improved from two aspects: 1) An efficient non-convex minimization algorithm is modified to enhance image quality; 2) PBDW are extended into shift-invariant discrete wavelet domain to enhance the ability of transform on sparsifying piecewise smooth image features. Numerical simulation results on vivo magnetic resonance images demonstrate that the proposed method outperforms the original PBDW in terms of removing artifacts and preserving edges.     

基于压缩传感和代数重建法的CT图像重建

代数重建法(ART)是一种重要的CT图像重建方法,适合于不完全投影数据的图像重建,其缺点是重建速度慢。为提高图像重建的质量和速度,利用压缩传感理论提出了一种基于ART的高质量图像重建算法。该算法将CT图像的梯度稀疏性结合到ART图像重建中,在每次迭代中的投影操作结束后用梯度下降法调整全变差,减小图像梯度的l1范数。实验结果验证了该算法的有效性。