arXiv subjects

Mathews Jacob

Publications and source records attributed to Mathews Jacob.

At least 55 records · Page 3Linked to original sources

arXiv2020

Deep Generalization of Structured Low-Rank Algorithms (Deep-SLR)

Structured low-rank (SLR) algorithms, which exploit annihilation relations between the Fourier samples of a signal resulting from different properties, is a powerful image reconstruction framework in several applications. This scheme relies on low-rank matrix completion to estimate the annihilation relations from the measurements. The main challenge with this strategy is the high computational complexity of matrix completion. We introduce a deep learning (DL) approach to significantly reduce the computational complexity. Specifically, we use a convolutional neural network (CNN)-based filterbank that is trained to estimate the annihilation relations from imperfect (under-sampled and noisy) k-space measurements of Magnetic Resonance Imaging (MRI). The main reason for the computational efficiency is the pre-learning of the parameters of the non-linear CNN from exemplar data, compared to SLR schemes that learn the linear filterbank parameters from the dataset itself. Experimental comparisons show that the proposed scheme can enable calibration-less parallel MRI; it can offer performance similar to SLR schemes while reducing the runtime by around three orders of magnitude. Unlike pre-calibrated and self-calibrated approaches, the proposed uncalibrated approach is insensitive to motion errors and affords higher acceleration. The proposed scheme also incorporates image domain priors that are complementary, thus significantly improving the performance over that of SLR schemes.

cs.LG↗

arXiv2020

Free-breathing and ungated cardiac cine using navigator-less spiral SToRM

We introduce a kernel low-rank algorithm to recover free-breathing and ungated dynamic MRI from spiral acquisitions without explicit k-space navigators. It is often challenging for low-rank methods to recover free-breathing and ungated images from undersampled measurements; extensive cardiac and respiratory motion often results in the Casorati matrix not being sufficiently low-rank. Therefore, we exploit the non-linear structure of the dynamic data, which gives the low-rank kernel matrix. Unlike prior work that rely on navigators to estimate the manifold structure, we propose a kernel low-rank matrix completion method to directly fill in the missing k-space data from variable density spiral acquisitions. We validate the proposed scheme using simulated data and in-vivo data. Our results show that the proposed scheme provides improved reconstructions compared to the classical methods such as low-rank and XD-GRASP. The comparison with breath-held cine data shows that the quantitative metrics agree, whereas the image quality is marginally lower.

eess.IV↗

arXiv2020

J-MoDL: Joint Model-Based Deep Learning for Optimized Sampling and Reconstruction

Modern MRI schemes, which rely on compressed sensing or deep learning algorithms to recover MRI data from undersampled multichannel Fourier measurements, are widely used to reduce scan time. The image quality of these approaches is heavily dependent on the sampling pattern. We introduce a continuous strategy to jointly optimize the sampling pattern and network parameters. We use a multichannel forward model, consisting of a non-uniform Fourier transform with continuously defined sampling locations, to realize the data consistency block within a model-based deep learning image reconstruction scheme. This approach facilitates the joint and continuous optimization of the sampling pattern and the CNN parameters to improve image quality. We observe that the joint optimization of the sampling patterns and the reconstruction module significantly improves the performance of most deep learning reconstruction algorithms. The source code of the proposed joint learning framework is available at https://github.com/hkaggarwal/J-MoDL.

eess.IV↗

arXiv2020

Model-Based Deep Learning for Reconstruction of Joint k-q Under-sampled High Resolution Diffusion MRI

We propose a model-based deep learning architecture for the reconstruction of highly accelerated diffusion magnetic resonance imaging (MRI) that enables high resolution imaging. The proposed reconstruction jointly recovers all the diffusion weighted images in a single step from a joint k-q under-sampled acquisition in a parallel MRI setting. We propose the novel use of a pre-trained denoiser as a regularizer in a model-based reconstruction for the recovery of highly under-sampled data. Specifically, we designed the denoiser based on a general diffusion MRI tissue microstructure model for multi-compartmental modeling. By using a wide range of biologically plausible parameter values for the multi-compartmental microstructure model, we simulated diffusion signal that spans the entire microstructure parameter space. A neural network was trained in an unsupervised manner using an autoencoder to learn the diffusion MRI signal subspace. We employed the autoencoder in a model-based reconstruction and show that the autoencoder provides a strong denoising prior to recover the q-space signal. We show reconstruction results on a simulated brain dataset that shows high acceleration capabilities of the proposed method.

eess.IV↗

arXiv2020

Calibrationless Parallel MRI using Model based Deep Learning (C-MODL)

We introduce a fast model based deep learning approach for calibrationless parallel MRI reconstruction. The proposed scheme is a non-linear generalization of structured low rank (SLR) methods that self learn linear annihilation filters from the same subject. It pre-learns non-linear annihilation relations in the Fourier domain from exemplar data. The pre-learning strategy significantly reduces the computational complexity, making the proposed scheme three orders of magnitude faster than SLR schemes. The proposed framework also allows the use of a complementary spatial domain prior; the hybrid regularization scheme offers improved performance over calibrated image domain MoDL approach. The calibrationless strategy minimizes potential mismatches between calibration data and the main scan, while eliminating the need for a fully sampled calibration region.

cs.LG↗

arXiv2019

Sampling of Planar Curves: Theory and Fast Algorithms

We introduce a continuous domain framework for the recovery of a planar curve from a few samples. We model the curve as the zero level set of a trigonometric polynomial. We show that the exponential feature maps of the points on the curve lie on a low-dimensional subspace. We show that the null-space vector of the feature matrix can be used to uniquely identify the curve, given a sufficient number of samples. The worst-case theoretical guarantees show that the number of samples required for unique recovery depends on the bandwidth of the underlying trigonometric polynomial, which is a measure of the complexity of the curve. We introduce an iterative algorithm that relies on the low-rank property of the feature maps to recover the curves when the samples are noisy or when the true bandwidth of the curve is unknown. We also demonstrate the preliminary utility of the proposed curve representation in the context of image segmentation.

eess.SP↗

arXiv2019

Dynamic MRI using deep manifold self-learning

We propose a deep self-learning algorithm to learn the manifold structure of free-breathing and ungated cardiac data and to recover the cardiac CINE MRI from highly undersampled measurements. Our method learns the manifold structure in the dynamic data from navigators using autoencoder network. The trained autoencoder is then used as a prior in the image reconstruction framework. We have tested the proposed method on free-breathing and ungated cardiac CINE data, which is acquired using a navigated golden-angle gradient-echo radial sequence. Results show the ability of our method to better capture the manifold structure, thus providing us reduced spatial and temporal blurring as compared to the SToRM reconstruction.

eess.IV↗

arXiv2019

Structured Low-Rank Algorithms: Theory, MR Applications, and Links to Machine Learning

In this survey, we provide a detailed review of recent advances in the recovery of continuous domain multidimensional signals from their few non-uniform (multichannel) measurements using structured low-rank matrix completion formulation. This framework is centered on the fundamental duality between the compactness (e.g., sparsity) of the continuous signal and the rank of a structured matrix, whose entries are functions of the signal. This property enables the reformulation of the signal recovery as a low-rank structured matrix completion, which comes with performance guarantees. We will also review fast algorithms that are comparable in complexity to current compressed sensing methods, which enables the application of the framework to large-scale magnetic resonance (MR) recovery problems. The remarkable flexibility of the formulation can be used to exploit signal properties that are difficult to capture by current sparse and low-rank optimization strategies. We demonstrate the utility of the framework in a wide range of MR imaging (MRI) applications, including highly accelerated imaging, calibration-free acquisition, MR artifact correction, and ungated dynamic MRI.

cs.CV↗

arXiv2019

MoDL-MUSSELS: Model-Based Deep Learning for Multi-Shot Sensitivity Encoded Diffusion MRI

We introduce a model-based deep learning architecture termed MoDL-MUSSELS for the correction of phase errors in multishot diffusion-weighted echo-planar MRI images. The proposed algorithm is a generalization of existing MUSSELS algorithm with similar performance but with significantly reduced computational complexity. In this work, we show that an iterative re-weighted least-squares implementation of MUSSELS alternates between a multichannel filter bank and the enforcement of data consistency. The multichannel filter bank projects the data to the signal subspace thus exploiting the phase relations between shots. Due to the high computational complexity of self-learned filter bank, we propose to replace it with a convolutional neural network (CNN) whose parameters are learned from exemplary data. The proposed CNN is a hybrid model involving a multichannel CNN in the k-space and another CNN in the image space. The k-space CNN exploits the phase relations between the shot images, while the image domain network is used to project the data to an image manifold. The experiments show that the proposed scheme can yield reconstructions that are comparable to state of the art methods while offering several orders of magnitude reduction in run-time.

cs.CV↗

arXiv2019

Improved Reconstruction for high-resolution Multi-shot Diffusion Weighted Imaging

Purpose: To introduce a fast and improved direct reconstruction method for multi-shot diffusion weighted (msDW) scans for high-resolution studies. Methods:Multi-shot EPI methods can enable higher spatial resolution for diffusion MRI studies. Traditionally, such acquisitions required specialized reconstructions involving phase compensation to correct for inter-shot motion artifacts. The recently proposed MUSSELS reconstruction belongs to a new class of parallel imaging-based methods that recover artifact-free DWIs from msDW data without needing phase compensation. However, computational demands of the MUSSELS reconstruction scales as the matrix size and the number of shots increases, which hinders its practical utility for high-resolution applications. In this work, we propose a computationally efficient formulation using iterative reweighted least squares (IRLS) method. The new formulation is not only fast but it enables to accommodate additional priors such as conjugate symmetry property of the k-space data to improve the reconstruction. Using whole-brain in-vivo data, we show the utility of the new formulation for routine high-resolution studies with minimal computational burden. Results: The IRLS formulation provides about six times faster reconstruction for matrix sizes 192x192 and 256x256, compared to the original implementations. The reconstruction quality is improved by the addition of conjugate symmetry priors that reduce blurring and preserves the high-resolution details from partial Fourier acquisitions. Conclusion: The proposed method is shown to be computationally efficient to enable routine high-resolution studies. The computational complexity matches the traditional msDWI reconstruction methods and provides improved reconstruction results.

physics.med-ph↗

arXiv2019

MoDL: Model Based Deep Learning Architecture for Inverse Problems

We introduce a model-based image reconstruction framework with a convolution neural network (CNN) based regularization prior. The proposed formulation provides a systematic approach for deriving deep architectures for inverse problems with the arbitrary structure. Since the forward model is explicitly accounted for, a smaller network with fewer parameters is sufficient to capture the image information compared to black-box deep learning approaches, thus reducing the demand for training data and training time. Since we rely on end-to-end training, the CNN weights are customized to the forward model, thus offering improved performance over approaches that rely on pre-trained denoisers. The main difference of the framework from existing end-to-end training strategies is the sharing of the network weights across iterations and channels. Our experiments show that the decoupling of the number of iterations from the network complexity offered by this approach provides benefits including lower demand for training data, reduced risk of overfitting, and implementations with significantly reduced memory footprint. We propose to enforce data-consistency by using numerical optimization blocks such as conjugate gradients algorithm within the network; this approach offers faster convergence per iteration, compared to methods that rely on proximal gradients steps to enforce data consistency. Our experiments show that the faster convergence translates to improved performance, especially when the available GPU memory restricts the number of iterations.

cs.CV↗

arXiv2019

Sampling of surfaces and functions in high dimensional spaces

We introduce a sampling theoretic framework for the recovery of smooth surfaces and functions living on smooth surfaces from few samples. The proposed approach can be thought of as a nonlinear generalization of union of subspace models widely used in signal processing. This scheme relies on an exponential lifting of the original data points to feature space, where the features live on union of subspaces. The low-rank property of the features are used to recover the surfaces as well as to determine the number of measurements needed to recover the surface. The low-rank property of the features also provides an efficient approach which resembles a neural network for the local representation of multidimensional functions on the surface; the significantly reduced number of parameters make the computational structure attractive for learning inference from limited labeled training data.

eess.SP↗

arXiv2019

SMS MUSSELS: A Navigator-free Reconstruction for Simultaneous MultiSlice Accelerated MultiShot Diffusion Weighted Imaging

Purpose: To introduce a novel reconstruction method for simultaneous multi-slice (SMS) accelerated multi shot diffusion weighted imaging (ms-DWI). Methods: SMS acceleration using blipped CAIPI schemes have been proposed to speed up the acquisition of ms-DWIs. The reconstruction of the above data requires (i) phase compensation to combine data from different shots and (ii) slice unfolding to separate the data of different slices. The traditional approach is to first estimate the phase maps corresponding to each shot from a navigator or from the slice-aliased individual shot data. The phase maps are subsequently fed to a iterative reconstruction scheme to recover the slice unfolded DWIs. We propose a novel reconstruction method to jointly recover the slice-unfolded k-space data of the multiple shots. The proposed reconstruction is enabled by the low-rank property inherent in the k-space samples of a ms-DW acquisition. Specifically, we recover the missing samples of the multi-shot acquisition by enforcing a low-rank penalty on the block-Hankel matrix formed by the k-space data of each shot for each slice. The joint recovery of the slice-unfolded k-space data is then performed using a SENSE-based slice-unfolding subject to the low-rank constraint. The proposed joint recovery scheme is tested on simulated and in-vivo data and compared to similar un-navigated methods at slice acceleration factors of 2 and 3. Results: Our experiments show effective slice unaliasing and successful recovery of DWIs with minimal phase artifacts using the proposed method. The performance is comparable to existing methods at low acceleration factors and better than existing methods as the acceleration factor increase. Conclusion: For the slice acceleration factors considered in this study, the proposed method can successfully recover DWIs from SMS-accelerated ms-DWI acquisitions.

physics.med-ph↗

arXiv2018

Off-the-grid model based deep learning (O-MODL)

We introduce a model based off-the-grid image reconstruction algorithm using deep learned priors. The main difference of the proposed scheme with current deep learning strategies is the learning of non-linear annihilation relations in Fourier space. We rely on a model based framework, which allows us to use a significantly smaller deep network, compared to direct approaches that also learn how to invert the forward model. Preliminary comparisons against image domain MoDL approach demonstrates the potential of the off-the-grid formulation. The main benefit of the proposed scheme compared to structured low-rank methods is the quite significant reduction in computational complexity.

cs.LG↗

arXiv2018

A Generalized Structured Low-Rank Matrix Completion Algorithm for MR Image Recovery

Recent theory of mapping an image into a structured low-rank Toeplitz or Hankel matrix has become an effective method to restore images. In this paper, we introduce a generalized structured low-rank algorithm to recover images from their undersampled Fourier coefficients using infimal convolution regularizations. The image is modeled as the superposition of a piecewise constant component and a piecewise linear component. The Fourier coefficients of each component satisfy an annihilation relation, which results in a structured Toeplitz matrix, respectively. We exploit the low-rank property of the matrices to formulate a combined regularized optimization problem. In order to solve the problem efficiently and to avoid the high memory demand resulting from the large-scale Toeplitz matrices, we introduce a fast and memory efficient algorithm based on the half-circulant approximation of the Toeplitz matrix. We demonstrate our algorithm in the context of single and multi-channel MR images recovery. Numerical experiments indicate that the proposed algorithm provides improved recovery performance over the state-of-the-art approaches.

eess.IV↗

arXiv2018

Model-based free-breathing cardiac MRI reconstruction using deep learned \& STORM priors: MoDL-STORM

We introduce a model-based reconstruction framework with deep learned (DL) and smoothness regularization on manifolds (STORM) priors to recover free breathing and ungated (FBU) cardiac MRI from highly undersampled measurements. The DL priors enable us to exploit the local correlations, while the STORM prior enables us to make use of the extensive non-local similarities that are subject dependent. We introduce a novel model-based formulation that allows the seamless integration of deep learning methods with available prior information, which current deep learning algorithms are not capable of. The experimental results demonstrate the preliminary potential of this work in accelerating FBU cardiac MRI.

cs.LG↗

arXiv2018

Adaptive structured low rank algorithm for MR image recovery

We introduce an adaptive structured low rank algorithm to recover MR images from their undersampled Fourier coefficients. The image is modeled as a combination of a piecewise constant component and a piecewise linear component. The Fourier coefficients of each component satisfy an annihilation relation, which results in a structured Toeplitz matrix. We exploit the low rank property of the matrices to formulate a combined regularized optimization problem, which can be solved efficiently. Numerical experiments indicate that the proposed algorithm provides improved recovery performance over the previously proposed algorithms.

eess.IV↗

arXiv2018

Calibration-free B0 correction of EPI data using structured low rank matrix recovery

We introduce a structured low rank algorithm for the calibration-free compensation of field inhomogeneity artifacts in Echo Planar Imaging (EPI) MRI data. We acquire the data using two EPI readouts that differ in echo-time (TE). Using time segmentation, we reformulate the field inhomogeneity compensation problem as the recovery of an image time series from highly undersampled Fourier measurements. The temporal profile at each pixel is modeled as a single exponential, which is exploited to fill in the missing entries. We show that the exponential behavior at each pixel, along with the spatial smoothness of the exponential parameters, can be exploited to derive a 3D annihilation relation in the Fourier domain. This relation translates to a low rank property on a structured multi-fold Toeplitz matrix, whose entries correspond to the measured k-space samples. We introduce a fast two-step algorithm for the completion of the Toeplitz matrix from the available samples. In the first step, we estimate the null space vectors of the Toeplitz matrix using only its fully sampled rows. The null space is then used to estimate the signal subspace, which facilitates the efficient recovery of the time series of images. We finally demonstrate the proposed approach on spherical MR phantom data and human data and show that the artifacts are significantly reduced. The proposed approach could potentially be used to compensate for time varying field map variations in dynamic applications such as functional MRI.

cs.CV↗