Interpretable Dimension Reduction for MRI Channel Suppression

Channel suppression can reduce the redundant information in multiple channel receiver coils and accelerate reconstruction speed to meet real-time imaging requirements. The principal component analysis has been used for channel suppression, but it is difficult to be interpreted because all channels contribute to principal components. Furthermore, the importance of interpretability in machine learning has recently attracted increasing attention in radiology. To improve the interpretability of PCA-based channel suppression, a sparse PCA method is proposed to reduce the most coils' loadings to be zero. Channel suppression is formulated as solving a nonlinear eigenvalue problem using the inverse power method instead of the direct matrix decomposition. Experimental results of in vivo data show that the sparse PCA-based channel suppression not only improves the interpretability with sparse channels, but also improves reconstruction quality compared to the standard PCA-based reconstruction with the similar reconstruction time.

Compressed sensing MRI: a review from signal processing perspective

Magnetic resonance imaging (MRI) is an inherently slow imaging modality, since it acquires multi-dimensional k-space data through 1-D free induction decay or echo signals. This often limits the use of MRI, especially for high resolution or dynamic imaging. Accordingly, many investigators has developed various acceleration techniques to allow fast MR imaging. For the last two decades, one of the most important breakthroughs in this direction is the introduction of compressed sensing (CS) that allows accurate reconstruction from sparsely sampled k-space data. The recent FDA approval of compressed sensing products for clinical scans clearly reflect the maturity of this technology. Therefore, this paper reviews the basic idea of CS and how this technology have been evolved for various MR imaging problems.

Kernel Principal Component Analysis of Coil Compression in Parallel Imaging

A phased array with many coil elements has been widely used in parallel MRI for imaging acceleration. On the other hand, it results in increased memory usage and large computational costs for reconstructing the missing data from such a large number of channels. A number of techniques have been developed to linearly combine physical channels to produce fewer compressed virtual channels for reconstruction. A new channel compression technique via kernel principal component analysis (KPCA) is proposed. The proposed KPCA method uses a nonlinear combination of all physical channels to produce a set of compressed virtual channels. This method not only reduces the computational time but also improves the reconstruction quality of all channels when used. Taking the traditional GRAPPA algorithm as an example, it is shown that the proposed KPCA method can achieve better quality than both PCA and all channels, and at the same time the calculation time is almost the same as the existing PCA method.

Iterative Schemes to Solve Low-Dimensional Calibration Equations in Parallel MR Image Reconstruction with GRAPPA

GRAPPA (Generalized Autocalibrating Partially Parallel Acquisition) is a widely used parallel MRI reconstruction technique. The processing of data from multichannel receiver coils may increase the storage and computational requirements of GRAPPA reconstruction. Random projection on GRAPPA (RP-GRAPPA) uses random projection (RP) method to overcome the computational overheads of solving large linear equations in the calibration phase of GRAPPA, saving reconstruction time. However, RP-GRAPPA compromises the reconstruction accuracy in case of large reductions in the dimensions of calibration equations. In this paper, we present the implementation of GRAPPA reconstruction method using potential iterative solvers to estimate the reconstruction coefficients from the randomly projected calibration equations. Experimental results show that the proposed methods withstand the reconstruction accuracy (visually and quantitatively) against large reductions in the dimension of linear equations, when compared with RP-GRAPPA reconstruction. Particularly, the proposed method using conjugate gradient for least squares (CGLS) demonstrates more savings in the computational time of GRAPPA, without significant loss in the reconstruction accuracy, when compared with RP-GRAPPA. It is also demonstrated that the proposed method using CGLS complements the channel compression method for reducing the computational complexities associated with higher channel count, thereby resulting in additional memory savings and speedup.

Application of direct virtual coil to dynamic contrast-enhanced MRI and MR angiography with data-driven parallel imaging

PURPOSE

To demonstrate the feasibility of direct virtual coil (DVC) in the setting of 4D dynamic imaging used in multiple clinical applications.

THEORY AND METHODS

Three dynamic imaging applications were chosen: pulmonary perfusion, liver perfusion, and peripheral MR angiography (MRA), with 18, 11, and 10 subjects, respectively. After view-sharing, the k-space data were reconstructed twice: once with channel-by-channel (CBC) followed by sum-of-squares coil combination and once with DVC. Images reconstructed using CBC and DVC were compared and scored based on overall image quality by two experienced radiologists using a five-point scale.

RESULTS

The CBC and DVC showed similar image quality in image domain. Time course measurements also showed good agreement in the temporal domain. CBC and DVC images were scored as equivalent for all pulmonary perfusion cases, all liver perfusion cases, and four of the 10 peripheral MRA cases. For the remaining six peripheral MRA cases, DVC were scored as slightly better (not clinically significant) than the CBC images by Radiologist A and as equivalent by Radiologist B.

CONCLUSION

For dynamic contrast-enhanced MR applications, it is clinically feasible to reduce image reconstruction time while maintaining image quality and time course measurement using the DVC technique.

Magnetic Resonance Sequences and Rapid Acquisition for MR-Guided Interventions

Interventional MR uses rapid imaging to guide diagnostic and therapeutic procedures. One of the attractions of MR-guidance is the abundance of inherent contrast mechanisms available. Dynamic procedural guidance with real-time imaging has pushed the limits of MR technology, demanding rapid acquisition and reconstruction paired with interactive control and device visualization. This article reviews the technical aspects of real-time MR sequences that enable MR-guided interventions.

Fast GRAPPA reconstruction with random projection

PURPOSE

To address the issue of computational complexity in generalized autocalibrating partially parallel acquisition (GRAPPA) when several calibration data are used.

METHOD

GRAPPA requires fully sampled data for accurate calibration with increasing data needed for higher reduction factors to maintain accuracy, which leads to longer computational time, especially in a three-dimensional (3D) setting and with higher channel count coils. Channel reduction methods have been developed to address this issue when massive array coils are used. In this study, the complexity problem was addressed from a different prospective. Instead of compressing to fewer channels, we propose the use of random projections to reduce the dimension of the linear equation in the calibration phase. The equivalence before and after the reduction is supported by the Johnson-Lindenstrauss lemma. The proposed random projection method can be integrated with channel reduction sequentially for even higher computational efficiency.

RESULTS

Experimental results show that GRAPPA with random projection can achieve comparable image quality with much less computational time when compared with conventional GRAPPA without random projection.

CONCLUSION

The proposed random projection method is able to reduce the computational time of GRAPPA, especially in a 3D setting, without compromising the image quality, or to improve the reconstruction quality by allowing more data for calibration when the computational time is a limiting factor. Magn Reson Med 74:71-80, 2015. © 2014 Wiley Periodicals, Inc.

Coil compression for accelerated imaging with Cartesian sampling

MRI using receiver arrays with many coil elements can provide high signal-to-noise ratio and increase parallel imaging acceleration. At the same time, the growing number of elements results in larger datasets and more computation in the reconstruction. This is of particular concern in 3D acquisitions and in iterative reconstructions. Coil compression algorithms are effective in mitigating this problem by compressing data from many channels into fewer virtual coils. In Cartesian sampling there often are fully sampled k-space dimensions. In this work, a new coil compression technique for Cartesian sampling is presented that exploits the spatially varying coil sensitivities in these nonsubsampled dimensions for better compression and computation reduction. Instead of directly compressing in k-space, coil compression is performed separately for each spatial location along the fully sampled directions, followed by an additional alignment process that guarantees the smoothness of the virtual coil sensitivities. This important step provides compatibility with autocalibrating parallel imaging techniques. Its performance is not susceptible to artifacts caused by a tight imaging field-of-view. High quality compression of in vivo 3D data from a 32 channel pediatric coil into six virtual coils is demonstrated.