Non-Iterative Regularized reconstruction Algorithm for Non-CartesiAn MRI: NIRVANA

We introduce a novel noniterative algorithm for the fast and accurate reconstruction of nonuniformly sampled MRI data. The proposed scheme derives the reconstructed image as the nonuniform inverse Fourier transform of a compensated dataset. We derive each sample in the compensated dataset as a weighted linear combination of a few measured k-space samples. The specific k-space samples and the weights involved in the linear combination are derived such that the reconstruction error is minimized. The computational complexity of the proposed scheme is comparable to that of gridding. At the same time, it provides significantly improved accuracy and is considerably more robust to noise and undersampling. The advantages of the proposed scheme makes it ideally suited for the fast reconstruction of large multidimensional datasets, which routinely arise in applications such as f-MRI and MR spectroscopy. The comparisons with state-of-the-art algorithms on numerical phantoms and MRI data clearly demonstrate the performance improvement.     

Post-processing central k-space subtraction for high-resolution arterial peripheral MR angiography

Peripheral MR angiography requires high resolution and arterial contrast. Neither can be obtained simultaneously due to the short arterial phase of the contrast agent. To improve temporal resolution, keyhole imaging was developed, which combines high resolution and arterial k-spaces at the time of image acquisition. Here, a related approach is introduced for image post-processing in the Fourier domain. It is demonstrated that simple substitution of the central k-space with low-resolution data leads to severe distortion. Hence, a dedicated calculation scheme is necessary for composite k-space post-processing. A solution is presented for high-resolution arterial peripheral MR angiography that uses subtraction of venous intensities from the central high-resolution k-space. The calculations in the Fourier domain do not require interpolations between the different resolutions. High-resolution steady-state MR angiography, which exhibits contrast-enhanced arteries and veins at an isotropic resolution of 0.65 mm, and standard resolution arterial first-pass MR angiography were combined to obtain images with the resolution of the steady-state images and arterial contrast. Numerical simulations on software phantoms are presented. The operation of the method is demonstrated in five patients.     

A statistical fMRI model for differential T2* contrast incorporating T1 and T2* of gray matter

Relaxation parameter estimation and brain activation detection are two main areas of study in magnetic resonance imaging (MRI) and functional magnetic resonance imaging (fMRI). Relaxation parameters can be used to distinguish voxels containing different types of tissue whereas activation determines voxels that are associated with neuronal activity. In fMRI, the standard practice has been to discard the first scans to avoid magnetic saturation effects. However, these first images have important information on the MR relaxivities for the type of tissue contained in voxels, which could provide pathological tissue discrimination. It is also well-known that the voxels located in gray matter (GM) contain neurons that are to be active while the subject is performing a task. As such, GM MR relaxivities can be incorporated into a statistical model in order to better detect brain activation. Moreover, although the MR magnetization physically depends on tissue and imaging parameters in a nonlinear fashion, a linear model is what is conventionally used in fMRI activation studies. In this study, we develop a statistical fMRI model for Differential T₂^? ConTrast Incorporating T₁ and T₂^? of GM, so-called DeTeCT-ING Model, that considers the physical magnetization equation to model MR magnetization; uses complex-valued time courses to estimate T₁ and T₂^? for each voxel; then incorporates gray matter MR relaxivities into the statistical model in order to better detect brain activation, all from a single pulse sequence by utilizing the first scans.     

An algorithm for sparse MRI reconstruction by Schatten p-norm minimization

In recent years, there has been a concerted effort to reduce the MR scan time. Signal processing research aims at reducing the scan time by acquiring less K-space data. The image is reconstructed from the subsampled K-space data by employing compressed sensing (CS)-based reconstruction techniques. In this article, we propose an alternative approach to CS-based reconstruction. The proposed approach exploits the rank deficiency of the MR images to reconstruct the image. This requires minimizing the rank of the image matrix subject to data constraints, which is unfortunately a nondeterministic polynomial time (NP) hard problem. Therefore we propose to replace the NP hard rank minimization problem by its nonconvex surrogate — Schatten p-norm minimization. The same approach can be used for denoising MR images as well.Since there is no algorithm to solve the Schatten p-norm minimization problem, we derive an efficient first-order algorithm. Experiments on MR brain scans show that the reconstruction and denoising accuracy from our method is at par with that of CS-based methods. Our proposed method is considerably faster than CS-based methods.     

Adaptive fixed-point iterative shrinkage/thresholding algorithm for MR imaging reconstruction using compressed sensing

Recently compressed sensing (CS) has been applied to under-sampling MR image reconstruction for significantly reducing signal acquisition time. To guarantee the accuracy and efficiency of the CS-based MR image reconstruction, it necessitates determining several regularization and algorithm-introduced parameters properly in practical implementations. The regularization parameter is used to control the trade-off between the sparsity of MR image and the fidelity measures of k-space data, and thus has an important effect on the reconstructed image quality. The algorithm-introduced parameters determine the global convergence rate of the algorithm itself. These parameters make CS-based MR image reconstruction a more difficult scheme than traditional Fourier-based method while implemented on a clinical MR scanner. In this paper, we propose a new approach that reveals that the regularization parameter can be taken as a threshold in a fixed-point iterative shrinkage/thresholding algorithm (FPIST) and chosen by employing minimax threshold selection method. No extra parameter is introduced by FPIST. The simulation results on synthetic and real complex-valued MRI data show that the proposed method can adaptively choose the regularization parameter and effectively achieve high reconstruction quality. The proposed method should prove very useful for practical CS-based MRI applications.     

Self-gated Fourier velocity encoding

Self-gating is investigated to improve the velocity resolution of real-time Fourier velocity encoding measurements in the absence of a reliable electrocardiogram waveform (e.g., fetal magnetic resonance or severe arrhythmia). Real-time flow data are acquired using interleaved k-space trajectories which share a common path near the origin of k-space. These common data provide a rapid self-gating signal that can be used to combine the interleaved data. The combined interleaves cover a greater area of k-space than a single real-time acquisition, thereby providing higher velocity resolution for a given aliasing velocity and temporal resolution. For example, this approach provided velocity spectra with a temporal resolution of 19 ms and velocity resolution of 22 cm/s over an 818 cm/s field-of-view. The method was validated experimentally using a computer-controlled pulsatile flow apparatus and applied in vivo to measure aortic-valve flow in a healthy volunteer.     

Remarks on q-space MR propagator in partially restricted,axially-symmetric,and isotropic environments

The problem of reconstruction of an apparent propagator from a series of diffusion-attenuated magnetic resonance (MR) signals is revisited. In nonimaging acquisitions, the inverse Fourier transform of the MR signal attenuation is consistent with the notion of an ensemble average propagator. However, in image acquisitions where one is interested in quantifying a displacement distribution in every voxel of the image, the propagator derived in the traditional way may lead to a counter-intuitive profile when it is nonsymmetric, which could be a problem in partially restricted environments. By exploiting the reciprocity of the diffusion propagator, an alternative is introduced, which implies a forward Fourier transform of the MR signal attenuations yielding a propagator reflected around the origin. Two simple problems were considered as examples. In the case of diffusion in the proximity of a restricting barrier, the reflected propagator yields a more meaningful result, whereas in the case of curving fibers, the original propagator is more intuitive. In the final section of the article, two more one-dimensional transformations are introduced, which enable the reconstruction of two- and three-dimensional propagators in, respectively, axially symmetric and isotropic environments — in both cases, from one-dimensional q-space MR data.     

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.     

Image registration guided,sparsity constrained reconstructions for dynamic MRI

It is generally a challenging task to reconstruct dynamic magnetic resonance (MR) images with high spatial and high temporal resolutions, especially with highly incomplete k-space sampling. In this work, a novel method that combines a non-rigid image registration technique with sparsity-constrained image reconstruction is introduced. Employing a multi-resolution free-form deformation technique with B-spline interpolations, the non-rigid image registration accurately models the complex deformations of the physiological dynamics, and provides artifact-suppressed high spatial-resolution predictions. Based on these prediction images, the sparsity-constrained data fidelity-enforced image reconstruction further improves the reconstruction accuracy. When compared with the k-t FOCUSS with motion estimation/motion compensation (MEMC) technique on volunteer scans, the proposed method consistently outperforms in both the spatial and the temporal accuracy with variously accelerated k-space sampling. High fidelity reconstructions for dynamic systolic phases with reduction factor of 10 and cardiac perfusion series with reduction factor of 3 are presented.     

Contrast changes in portal vein and bile duct between centric and linear k-space ordering on three-dimensional segmented true fast imaging with steady-state precession magnetic resonance imaging

Purpose

To compare the degree of visualization of the bile duct and portal vein in terms of the difference in k-space ordering on a three-dimensional (3D) segmented true fast imaging with steady-state precession (trueFISP) sequence.

Materials and Methods

A breath-hold coronal 3D segmented trueFISP sequence was prospectively performed on 14 healthy volunteers. Images obtained with centric and linear k-space ordering in the k(x)–k(y) plane were compared by two independent radiologists qualitatively with depiction scores on a five-point scale (1=not seen to 5=excellent depiction) using the Wilcoxon signed-rank test. Images were also compared quantitatively using relative contrast values for the bile duct and portal vein against the hepatic parenchyma using a paired t-test.

Results

With centric ordering, both the mean depiction scores and relative contrast values for the portal vein were significantly lower than those with linear ordering (1.5 vs. 3.5, P<.01; and 0.08±0.19 vs. 0.51±0.10, P<.01, respectively). However, in the bile duct, there were no significant differences, only slight differences were found among the results obtained with centric and linear ordering (3.9 vs. 3.8, P=.72; and 0.59±0.06 vs. 0.68±0.06, P<.01, respectively).

Conclusion

For visualizing the bile duct, centric k-space ordering on 3D segmented trueFISP sequence is recommended, while linear ordering is recommended for portal vein visualization.     

Dynamic MRI reconstruction from highly undersampled (k,t)-space data using weighted Schatten p-norm regularizer of tensor

Combination of the low-rankness and sparsity has been successfully used to reconstruct desired dynamic magnetic resonance image (MRI) from highly-undersampled (k, t)-space data. However, nuclear norm, as a convex relaxation of the rank function, can cause the solution deviating from the original solution of low-rank problem. Moreover, equally treating different rank component is not flexible to deal with real applications. In this paper, an efficient reconstruction model is proposed to efficiently reconstruct dynamic MRI. First, we treat dynamic MRI as a 3rd-order tensor, and formulate the low-rankness via non-convex Schatten p-norm of matrices unfolded from the tensor. Secondly, we assign different weight for each rank component in Schatten p-norm. Furthermore, we combine the proposed weighted Schatten p-norm of a tensor as low-rank regularizer, and spatiotemporal total variation as sparse regularizer to formulate the reconstruction model for dynamic MRI. Thirdly, to efficiently solve the formulated reconstruction model, we derive an algorithm based on Bregman iterations with alternating direction multiplier. Over two public data sets of dynamic MRI, experiments demonstrate that the proposed method achieves much better quality.     

Automated vessel segmentation using cross-correlation and pooled covariance matrix analysis

Time-resolved contrast-enhanced magnetic resonance angiography (CE-MRA) provides contrast dynamics in the vasculature and allows vessel segmentation based on temporal correlation analysis. Here we present an automated vessel segmentation algorithm including automated generation of regions of interest (ROIs), cross-correlation and pooled sample covariance matrix analysis. The dynamic images are divided into multiple equal-sized regions. In each region, ROIs for artery, vein and background are generated using an iterative thresholding algorithm based on the contrast arrival time map and contrast enhancement map. Region-specific multi-feature cross-correlation analysis and pooled covariance matrix analysis are performed to calculate the Mahalanobis distances (MDs), which are used to automatically separate arteries from veins. This segmentation algorithm is applied to a dual-phase dynamic imaging acquisition scheme where low-resolution time-resolved images are acquired during the dynamic phase followed by high-frequency data acquisition at the steady-state phase. The segmented low-resolution arterial and venous images are then combined with the high-frequency data in k-space and inverse Fourier transformed to form the final segmented arterial and venous images. Results from volunteer and patient studies demonstrate the advantages of this automated vessel segmentation and dual phase data acquisition technique.     

Optimization of hyperparameters for SMS reconstruction

PurposeSimultaneous multi-slice (SMS) imaging accelerates MRI data acquisition by exciting multiple image slices with a single radiofrequency pulse. Overlapping slices encoded in acquired signal are separated using a mathematical model, which requires estimation of image reconstruction kernels using calibration data. Several parameters used in SMS reconstruction impact the quality and fidelity of final images. Therefore, finding an optimal set of reconstruction parameters is critical to ensure that accelerated acquisition does not significantly degrade resulting image quality.MethodsGradient-echo echo planar imaging data were acquired with a range of SMS acceleration factors from a cohort of five volunteers with no known neurological pathology. Images were collected using two available phased-array head coils (a 48-channel array and a reduced diameter 32-channel array) that support SMS. Data from these coils were identically reconstructed offline using a range of coil compression factors and reconstruction kernel parameters. A hybrid space (k-x), externally-calibrated coil-by-coil slice unaliasing approach was used for image reconstruction. The image quality of the resulting reconstructed SMS images was assessed by evaluating correlations with identical echo-planar reference data acquired without SMS. A finger tapping functional MRI (fMRI) experiment was also performed and group analysis results were compared between data sets reconstructed with different coil compression levels.ResultsBetween the two RF coils tested in this study, the 32-channel coil with smaller dimensions clearly outperformed the larger 48-channel coil in our experiments. Generally, a large calibration region (144–192 samples) and small kernel sizes (2–4 samples) in k_y direction improved image quality. Use of regularization in the kernel fitting procedure had a notable impact on the fidelity of reconstructed images and a regularization value 0.0001 provided good image quality. With optimal selection of other hyperparameters in the hybrid space SMS unaliasing algorithm, coil compression caused small reduction in correlation between single-band and SMS unaliased images. Similarly, group analysis of fMRI results did not show a significant influence of coil compression on resulting image quality.ConclusionsThis study demonstrated that the hyperparameters used in SMS reconstruction need to be fine-tuned once the experimental factors such as the RF receive coil and SMS factor have been determined. A cursory evaluation of SMS reconstruction hyperparameter values is therefore recommended before conducting a full-scale quantitative study using SMS technologies.     

A statistical method for characterizing the noise in nonlinearly reconstructed images from undersampled MR data: The POCS example

The projection-onto-convex-sets (POCS) algorithm is a powerful tool for reconstructing high-resolution images from undersampled k-space data. It is a nonlinear iterative method that attempts to estimate values for missing data. The convergence of the algorithm and its other deterministic properties are well established, but relatively little is known about how noise in the source data influences noise in the final reconstructed image. In this paper, we present an experimental treatment of the statistical properties in POCS and investigate 12 stochastic models for its noise distribution beside its nonlinear point spread functions. Statistical results show that as the ratio of the missing k-space data increases, the noise distribution in POCS images is no longer Rayleigh as with conventional linear Fourier reconstruction. Instead, the probability density function for the noise is well approximated by a lognormal distribution. For small missing data ratios, however, the noise remains Rayleigh distributed. Preliminary results show that in the presence of noise, POCS images are often dominated by POCS-enhanced noise rather than POCS-induced artifacts. Implicit in this work is the presentation of a general statistical method that can be used to assess the noise properties in other nonlinear reconstruction algorithms.     

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.     

Rapid 3D whole-heart cine imaging using golden ratio stack of spirals

Three-dimensional cine imaging provides a wealth of information about cardiac anatomy and function, but its use in the clinical environment is limited because data acquisition is very time consuming. In this work, a free-breathing 3D whole-heart cine imaging framework was developed using a time-efficient stack of spirals trajectory and accelerated reconstruction. Two suitable view ordering methods are considered with different spacing between k-space readouts in the partition dimension: uniform and tiny golden ratio based. A simulation study suggested the latter did not present any benefits in terms of similarity to the true image. The proposed method was subsequently tested on 10 prospective subjects and compared with conventional multi-slice breath-hold imaging. Image quality was evaluated using objective and subjective scores and ventricular measurements were compared to assess clinical accuracy. Image quality was lower in the proposed technique than in breath-hold images but good agreement was found in clinically relevant ventricular measurements. In addition, the proposed method was fast to acquire, required minimal planning and provided full anatomical coverage with isotropic resolution.     

A CUDA-based reverse gridding algorithm for MR reconstruction

MR raw data collected using non-Cartesian method can be transformed on Cartesian grids by traditional gridding algorithm (GA) and reconstructed by Fourier transform. However, its runtime complexity is O(K× N²), where resolution of raw data is N× N and size of convolution window (CW) is K. And it involves a large number of matrix calculation including modulus, addition, multiplication and convolution. Therefore, a Compute Unified Device Architecture (CUDA)-based algorithm is proposed to improve the reconstruction efficiency of PROPELLER (a globally recognized non-Cartesian sampling method). Experiment shows a write–write conflict among multiple CUDA threads. This induces an inconsistent result when synchronously convoluting multiple k-space data onto the same grid. To overcome this problem, a reverse gridding algorithm (RGA) was developed. Different from the method of generating a grid window for each trajectory as in traditional GA, RGA calculates a trajectory window for each grid. This is what “reverse” means. For each k-space point in the CW, contribution is cumulated to this grid. Although this algorithm can be easily extended to reconstruct other non-Cartesian sampled raw data, we only implement it based on PROPELLER. Experiment illustrates that this CUDA-based RGA has successfully solved the write–write conflict and its reconstruction speed is 7.5 times higher than that of traditional GA.     

3D sensitivity encoded ellipsoidal MR spectroscopic imaging of gliomas at 3T

Purpose

The goal of this study was to implement time efficient data acquisition and reconstruction methods for 3D magnetic resonance spectroscopic imaging (MRSI) of gliomas at a field strength of 3T using parallel imaging techniques.

Methods

The point spread functions, signal to noise ratio (SNR), spatial resolution, metabolite intensity distributions and Cho:NAA ratio of 3D ellipsoidal, 3D sensitivity encoding (SENSE) and 3D combined ellipsoidal and SENSE (e-SENSE) k-space sampling schemes were compared with conventional k-space data acquisition methods.

Results

The 3D SENSE and e-SENSE methods resulted in similar spectral patterns as the conventional MRSI methods. The Cho:NAA ratios were highly correlated (P<.05 for SENSE and P<.001 for e-SENSE) with the ellipsoidal method and all methods exhibited significantly different spectral patterns in tumor regions compared to normal appearing white matter. The geometry factors ranged between 1.2 and 1.3 for both the SENSE and e-SENSE spectra. When corrected for these factors and for differences in data acquisition times, the empirical SNRs were similar to values expected based upon theoretical grounds. The effective spatial resolution of the SENSE spectra was estimated to be same as the corresponding fully sampled k-space data, while the spectra acquired with ellipsoidal and e-SENSE k-space samplings were estimated to have a 2.36–2.47-fold loss in spatial resolution due to the differences in their point spread functions.

Conclusion

The 3D SENSE method retained the same spatial resolution as full k-space sampling but with a 4-fold reduction in scan time and an acquisition time of 9.28 min. The 3D e-SENSE method had a similar spatial resolution as the corresponding ellipsoidal sampling with a scan time of 4:36 min. Both parallel imaging methods provided clinically interpretable spectra with volumetric coverage and adequate SNR for evaluating Cho, Cr and NAA.     

Network topology and subgap resonances observed by Fourier transform scanning tunnelling microscopy of cuprate high-temperature superconductors

Fourier transform scanning tunnelling microscopy (STM) on Bi₂Sr₂CaCu₂O_{8+ δ} (BSCCO) subgap resonances has deciphered an octet of ‘quasiparticle’ states that are consistent with the Fermi surface and energy gap observed by angle-resolved photoemission spectroscopy (ARPES), but the origin of the high-intensity k-space octets and the sharply defined r-space chequerboard is unexplained. The filamentary ferroelastic nanodomain model that predicted the r-space chequerboard also explains the k-space octets and the origin of the apparent anisotropic surface d-wave gap by using strong electron–phonon interactions outside the CuO₂ planes. The topological model identifies the factors that stabilize high-intensity k-space octets in the presence of a very high level of irregular r-space chequerboard noise.