High-Resolution Oscillating Steady-State fMRI Using Patch-Tensor Low-Rank Reconstruction

Manifold Regularizer for High-Resolution fMRI Joint Reconstruction and Dynamic Quantification

Oscillating Steady-State Imaging (OSSI) is a recently developed fMRI acquisition method that can provide 2 to 3 times higher SNR than standard fMRI approaches. However, because the OSSI signal exhibits a nonlinear oscillation pattern, one must acquire and combine nc (e.g., 10) OSSI images to get an image that is free of oscillation for fMRI, and fully sampled acquisitions would compromise temporal resolution. To improve temporal resolution and accurately model the nonlinearity of OSSI signals, instead of using subspace models that are not well suited for the data, we build the MR physics for OSSI signal generation as a regularizer for the undersampled reconstruction. Our proposed physics-based manifold model turns the disadvantages of OSSI acquisition into advantages and enables joint reconstruction and quantification. OSSI manifold model (OSSIMM) outperforms subspace models and reconstructs high-resolution fMRI images with a factor of 12 acceleration and without spatial or temporal smoothing. Furthermore, OSSIMM can dynamically quantify important physics parameters, including R2∗ maps, with a temporal resolution of 150 ms.

Tensor Methods in Biomedical Image Analysis

In the past decade, tensors have become increasingly attractive in different aspects of signal and image processing areas. The main reason is the inefficiency of matrices in representing and analyzing multimodal and multidimensional datasets. Matrices cannot preserve the multidimensional correlation of elements in higher-order datasets and this highly reduces the effectiveness of matrix-based approaches in analyzing multidimensional datasets. Besides this, tensor-based approaches have demonstrated promising performances. These together, encouraged researchers to move from matrices to tensors. Among different signal and image processing applications, analyzing biomedical signals and images is of particular importance. This is due to the need for extracting accurate information from biomedical datasets which directly affects patient's health. In addition, in many cases, several datasets have been recorded simultaneously from a patient. A common example is recording electroencephalography (EEG) and functional magnetic resonance imaging (fMRI) of a patient with schizophrenia. In such a situation, tensors seem to be among the most effective methods for the simultaneous exploitation of two (or more) datasets. Therefore, several tensor-based methods have been developed for analyzing biomedical datasets. Considering this reality, in this paper, we aim to have a comprehensive review on tensor-based methods in biomedical image analysis. The presented study and classification between different methods and applications can show the importance of tensors in biomedical image enhancement and open new ways for future studies.

Fourier Domain Robust Denoising Decomposition and Adaptive Patch MRI Reconstruction

The sparsity of the Fourier transform domain has been applied to magnetic resonance imaging (MRI) reconstruction in k -space. Although unsupervised adaptive patch optimization methods have shown promise compared to data-driven-based supervised methods, the following challenges exist in MRI reconstruction: 1) in previous k -space MRI reconstruction tasks, MRI with noise interference in the acquisition process is rarely considered. 2) Differences in transform domains should be resolved to achieve the high-quality reconstruction of low undersampled MRI data. 3) Robust patch dictionary learning problems are usually nonconvex and NP-hard, and alternate minimization methods are often computationally expensive. In this article, we propose a method for Fourier domain robust denoising decomposition and adaptive patch MRI reconstruction (DDAPR). DDAPR is a two-step optimization method for MRI reconstruction in the presence of noise and low undersampled data. It includes the low-rank and sparse denoising reconstruction model (LSDRM) and the robust dictionary learning reconstruction model (RDLRM). In the first step, we propose LSDRM for different domains. For the optimization solution, the proximal gradient method is used to optimize LSDRM by singular value decomposition and soft threshold algorithms. In the second step, we propose RDLRM, which is an effective adaptive patch method by introducing a low-rank and sparse penalty adaptive patch dictionary and using a sparse rank-one matrix to approximate the undersampled data. Then, the block coordinate descent (BCD) method is used to optimize the variables. The BCD optimization process involves valid closed-form solutions. Extensive numerical experiments show that the proposed method has a better performance than previous methods in image reconstruction based on compressed sensing or deep learning.

Optimal MRI undersampling patterns for ultimate benefit of medical vision tasks

Compressed sensing is commonly concerned with optimizing the image quality after a partial undersampling of the measurable k-space to accelerate MRI. In this article, we propose to change the focus from the quality of the reconstructed image to the quality of the downstream image analysis outcome. Specifically, we propose to optimize the patterns according to how well a sought-after pathology could be detected or localized in the reconstructed images. We find the optimal undersampling patterns in k-space that maximize target value functions of interest in commonplace medical vision problems (reconstruction, segmentation, and classification) and propose a new iterative gradient sampling routine universally suitable for these tasks. We validate the proposed MRI acceleration paradigm on three classical medical datasets, demonstrating a noticeable improvement of the target metrics at the high acceleration factors (for the segmentation problem at ×16 acceleration, we report up to 12% improvement in Dice score over the other undersampling patterns).

Stochastic optimization of three-dimensional non-Cartesian sampling trajectory

PURPOSE

Optimizing three-dimensional (3D) k-space sampling trajectories is important for efficient MRI yet presents a challenging computational problem. This work proposes a generalized framework for optimizing 3D non-Cartesian sampling patterns via data-driven optimization.

METHODS

We built a differentiable simulation model to enable gradient-based methods for sampling trajectory optimization. The algorithm can simultaneously optimize multiple properties of sampling patterns, including image quality, hardware constraints (maximum slew rate and gradient strength), reduced peripheral nerve stimulation (PNS), and parameter-weighted contrast. The proposed method can either optimize the gradient waveform (spline-based freeform optimization) or optimize properties of given sampling trajectories (such as the rotation angle of radial trajectories). Notably, the method can optimize sampling trajectories synergistically with either model-based or learning-based reconstruction methods. We proposed several strategies to alleviate the severe nonconvexity and huge computation demand posed by the large scale. The corresponding code is available as an open-source toolbox.

RESULTS

We applied the optimized trajectory to multiple applications including structural and functional imaging. In the simulation studies, the image quality of a 3D kooshball trajectory was improved from 0.29 to 0.22 (NRMSE) with Stochastic optimization framework for 3D NOn-Cartesian samPling trajectorY (SNOPY) optimization. In the prospective studies, by optimizing the rotation angles of a stack-of-stars (SOS) trajectory, SNOPY reduced the NRMSE of reconstructed images from 1.19 to 0.97 compared to the best empirical method (RSOS-GR). Optimizing the gradient waveform of a rotational EPI trajectory improved participants' rating of the PNS from "strong" to "mild."

CONCLUSION

SNOPY provides an efficient data-driven and optimization-based method to tailor non-Cartesian sampling trajectories.

Enhanced clinical task-based fMRI metrics through locally low-rank denoising of complex-valued data

OBJECTIVE

This study investigates a locally low-rank (LLR) denoising algorithm applied to source images from a clinical task-based functional MRI (fMRI) exam before post-processing for improving statistical confidence of task-based activation maps.

METHODS

Task-based motor and language fMRI was obtained in eleven healthy volunteers under an IRB approved protocol. LLR denoising was then applied to raw complex-valued image data before fMRI processing. Activation maps generated from conventional non-denoised (control) data were compared with maps derived from LLR-denoised image data. Four board-certified neuroradiologists completed consensus assessment of activation maps; region-specific and aggregate motor and language consensus thresholds were then compared with nonparametric statistical tests. Additional evaluation included retrospective truncation of exam data without and with LLR denoising; a ROI-based analysis tracked t-statistics and temporal SNR (tSNR) as scan durations decreased. A test-retest assessment was performed; retest data were matched with initial test data and compared for one subject.

RESULTS

fMRI activation maps generated from LLR-denoised data predominantly exhibited statistically significant (p = 4.88×10-4 to p = 0.042; one p = 0.062) increases in consensus t-statistic thresholds for motor and language activation maps. Following data truncation, LLR data showed task-specific increases in t-statistics and tSNR respectively exceeding 20 and 50% compared to control. LLR denoising enabled truncation of exam durations while preserving cluster volumes at fixed thresholds. Test-retest showed variable activation with LLR data thresholded higher in matching initial test data.

CONCLUSION

LLR denoising affords robust increases in t-statistics on fMRI activation maps compared to routine processing, and offers potential for reduced scan duration while preserving map quality.

An untrained deep learning method for reconstructing dynamic MR images from accelerated model-based data

PURPOSE

To implement physics-based regularization as a stopping condition in tuning an untrained deep neural network for reconstructing MR images from accelerated data.

METHODS

The ConvDecoder (CD) neural network was trained with a physics-based regularization term incorporating the spoiled gradient echo equation that describes variable-flip angle data. Fully-sampled variable-flip angle k-space data were retrospectively accelerated by factors of R = {8, 12, 18, 36} and reconstructed with CD, CD with the proposed regularization (CD + r), locally low-rank (LR) reconstruction, and compressed sensing with L1-wavelet regularization (L1). Final images from CD + r training were evaluated at the "argmin" of the regularization loss; whereas the CD, LR, and L1 reconstructions were chosen optimally based on ground truth data. The performance measures used were the normalized RMS error, the concordance correlation coefficient, and the structural similarity index.

RESULTS

The CD + r reconstructions, chosen using the stopping condition, yielded structural similarity indexs that were similar to the CD (p = 0.47) and LR structural similarity indexs (p = 0.95) across R and that were significantly higher than the L1 structural similarity indexs (p = 0.04). The concordance correlation coefficient values for the CD + r T1 maps across all R and subjects were greater than those corresponding to the L1 (p = 0.15) and LR (p = 0.13) T1 maps, respectively. For R ≥ 12 (≤4.2 min scan time), L1 and LR T1 maps exhibit a loss of spatially refined details compared to CD + r.

CONCLUSION

The use of an untrained neural network together with a physics-based regularization loss shows promise as a measure for determining the optimal stopping point in training without relying on fully-sampled ground truth data.

OSCILLATE: A low-rank approach for accelerated magnetic resonance elastography

PURPOSE

MR elastography (MRE) is a technique to characterize brain mechanical properties in vivo. Due to the need to capture tissue deformation in multiple directions over time, MRE is an inherently long acquisition, which limits achievable resolution and use in challenging populations. The purpose of this work is to develop a method for accelerating MRE acquisition by using low-rank image reconstruction to exploit inherent spatiotemporal correlations in MRE data.

THEORY AND METHODS

The proposed MRE sampling and reconstruction method, OSCILLATE (Observing Spatiotemporal Correlations for Imaging with Low-rank Leveraged Acceleration in Turbo Elastography), involves alternating which k-space points are sampled between each repetition by a reduction factor, ROSC. Using a predetermined temporal basis from a low-resolution navigator in a joint low-rank image reconstruction, all images can be accurately reconstructed from a reduced amount of k-space data.

RESULTS

Decomposition of MRE displacement data demonstrated that, on average, 96.1% of all energy from an MRE dataset is captured at rank L = 12 (reduced from a full rank of 24). Retrospectively undersampling data with ROSC  = 2 and reconstructing at low-rank (L = 12) yields highly accurate stiffness maps with voxel-wise error of 5.8% ± 0.7%. Prospectively undersampled data at ROSC  = 2 were successfully reconstructed without loss of material property map fidelity, with average global stiffness error of 1.0% ± 0.7% compared to fully sampled data.

CONCLUSIONS

OSCILLATE produces whole-brain MRE data at 2 mm isotropic resolution in 1 min 48 s.

Multi-site clustering and nested feature extraction for identifying autism spectrum disorder with resting-state fMRI

Brain functional connectivity (FC) derived from resting-state functional magnetic resonance imaging (rs-fMRI) has been widely employed to study neuropsychiatric disorders such as autism spectrum disorder (ASD). Existing studies usually suffer from (1) significant data heterogeneity caused by different scanners or studied populations in multiple sites, (2) curse of dimensionality caused by millions of voxels in each fMRI scan and a very limited number (tens or hundreds) of training samples, and (3) poor interpretability, which hinders the identification of reproducible disease biomarkers. To this end, we propose a Multi-site Clustering and Nested Feature Extraction (MC-NFE) method for fMRI-based ASD detection. Specifically, we first divide multi-site training data into ASD and healthy control (HC) groups. To model inter-site heterogeneity within each category, we use a similarity-driven multiview linear reconstruction model to learn latent representations and perform subject clustering within each group. We then design a nested singular value decomposition (SVD) method to mitigate inter-site heterogeneity and extract FC features by learning both local cluster-shared features across sites within each category and global category-shared features across ASD and HC groups, followed by a linear support vector machine (SVM) for ASD detection. Experimental results on 609 subjects with rs-fMRI from the ABIDE database with 21 imaging sites suggest that the proposed MC-NFE outperforms several state-of-the-art methods in ASD detection. The most discriminative FCs identified by the MC-NFE are mainly located in default mode network, salience network, and cerebellum region, which could be used as potential biomarkers for fMRI-based ASD analysis.