No abstract

Water/fat separation is a classical problem for in vivo proton MRI. Although many methods have been proposed to address this problem, robust water/fat separation remains a challenge, especially in the presence of large amplitude of static field inhomogeneities. This problem is challenging because of the nonuniqueness of the solution for an isolated voxel. This paper tackles the problem using a statistically motivated formulation that jointly estimates the complete field map and the entire water/fat images. This formulation results in a difficult optimization problem that is solved effectively using a novel graph cut algorithm, based on an iterative process where all voxels are updated simultaneously. The proposed method has good theoretical properties, as well as an efficient implementation. Simulations and in vivo results are shown to highlight the properties of the proposed method and compare it to previous approaches. Twenty-five cardiac datasets acquired on a short, wide-bore scanner with different slice orientations were used to test the proposed method, which produced robust water/fat separation for these challenging datasets. This paper also shows example applications of the proposed method, such as the characterization of intramyocardial fat.

No abstract

Partial separability (PS) and sparsity have been previously used to enable reconstruction of dynamic images from undersampled (k, t)-space data. This paper presents a new method to use PS and sparsity constraints jointly for enhanced performance in this context. The proposed method combines the complementary advantages of PS and sparsity constraints using a unified formulation, achieving significantly better reconstruction performance than using either of these constraints individually. A globally convergent computational algorithm is described to efficiently solve the underlying optimization problem. Reconstruction results from simulated and in vivo cardiac MRI data are also shown to illustrate the performance of the proposed method.

Water/fat separation in the presence of B 0 field inhomogeneity is a problem of considerable practical importance in MRI. This article describes two complementary methods for estimating the water/fat images and the field inhomogeneity map from Dixontype acquisitions. One is based on variable projection (VARPRO) and the other on linear prediction (LP). The VARPRO method is very robust and can be used in low signal-to-noise ratio conditions because of its ability to achieve the maximum-likelihood solution. The LP method is computationally more efficient, and is shown to perform well under moderate levels of noise and field inhomogeneity.

Spatiotemporal imaging, including both dynamic imaging and spectroscopic imaging, has a wide range of applications from functional neuroimaging, cardiac imaging to metabolic cancer imaging. A practical challenge lies in obtaining high spatiotemporal resolution because the amount of data required increases exponentially as the physical dimension increases (curse of dimensionality). This paper describes a new way for spatiotemporal imaging using partially separable functions. This model admits highly sparse sampling of the data space, providing an effective way to achieve high spatiotemporal resolution. Practical imaging data will also be presented to demonstrate the performance of the new method.

There has been significant recent interest in fast imaging with sparse sampling. Conventional imaging methods are based on ShannonNyquist sampling theory. As such, the number of required samples often increases exponentially with the dimensionality of the image, which limits achievable resolution in high-dimensional scenarios. The partially-separable function (PSF) model has previously been proposed to enable sparse data sampling in this context. Existing methods to leverage PSF structure utilize tailored data sampling strategies, which enable a specialized two-step reconstruction procedure. This work formulates the PSF reconstruction problem using the matrix-recovery framework. The explicit matrix formulation provides new opportunities for data acquisition and image reconstruction with rank constraints. Theoretical results from the emerging field of low-rank matrix recovery (which generalizes theory from sparse-vector recovery) and our empirical results illustrate the potential of this new approach.

Compressed sensing (CS) has the potential to reduce magnetic resonance (MR) data acquisition time. In order for CS-based imaging schemes to be effective, the signal of interest should be sparse or compressible in a known representation, and the measurement scheme should have good mathematical properties with respect to this representation. While MRimages are often compressible, the second requirement is often only weakly satisfied with respect to commonly used Fourier encoding schemes. This paper investigates the use of random encoding for CS-MRI, in an effort to emulate the “universal” encoding schemes suggested by the theoretical CS literature. This random encoding is achieved experimentally with tailored spatially-selective radio-frequency (RF) pulses. Both simulation and experimental studies were conducted to investigate the imaging properties of this new scheme with respect to Fourier schemes. Results indicate that random encoding has the potential to outperform conventional encoding in certain scenarios. However, our study also indicates that random encoding fails to satisfy theoretical sufficient conditions for stable and accurate CS reconstruction in many scenarios of interest. Therefore, there is still no general theoretical performance guarantee for CS-MRI, with or without random encoding, and CS-based methods should be developed and validated carefully in the context of specific applications.