SearcharxivSearch

arXiv subjects

Aaron T Hess

Publications and source records attributed to Aaron T Hess.

3 recordsLinked to original sources

Accelerated calibrationless parallel transmit mapping using joint transmit and receive low-rank tensor completion

Purpose: To evaluate an algorithm for calibrationless parallel imaging to reconstruct undersampled parallel transmit field maps for the body and brain. Methods: Using synthetic data, body, and brain measurements of relative transmit maps, three different approaches to a joint transmit-receive low-rank tensor completion algorithm are evaluated. These methods included: (i) virtual coils using the product of receive and transmit sensitivities, (ii) joint-receiver coils that enforces a low rank structure across receive coils of all transmit modes, and (iii) transmit low rank (TxLR) that uses a low rank structure for both receive and transmit modes simultaneously. The performance of each are investigated for different noise levels and different acceleration rates on an 8-channel parallel transmit 7T system. Results: The virtual coils method broke down with increasing noise levels or acceleration rates greater than two producing RMS error greater than 0.1. The joint receiver coils method worked well up to acceleration factors of four, beyond which the RMS error exceeded 0.1. While TxLR enabled an eight-fold acceleration with most RMS errors remaining below 0.1. Conclusion: This work demonstrates that under-sampling factors of up to eight-fold are feasible for transmit array mapping and can be reconstructed using calibrationless parallel imaging methods.

eess.IV

An Approximate Message Passing Algorithm for Rapid Parameter-Free Compressed Sensing MRI

For certain sensing matrices, the Approximate Message Passing (AMP) algorithm efficiently reconstructs undersampled signals. However, in Magnetic Resonance Imaging (MRI), where Fourier coefficients of a natural image are sampled with variable density, AMP encounters convergence problems. In response we present an algorithm based on Orthogonal AMP constructed specifically for variable density partial Fourier sensing matrices. For the first time in this setting a state evolution has been observed. A practical advantage of state evolution is that Stein's Unbiased Risk Estimate (SURE) can be effectively implemented, yielding an algorithm with no free parameters. We empirically evaluate the effectiveness of the parameter-free algorithm on simulated data and find that it converges over 5x faster and to a lower mean-squared error solution than Fast Iterative Shrinkage-Thresholding (FISTA).

eess.SP

Approximate Message Passing with a Colored Aliasing Model for Variable Density Fourier Sampled Images

The Approximate Message Passing (AMP) algorithm efficiently reconstructs signals which have been sampled with large i.i.d. sub-Gaussian sensing matrices. Central to AMP is its "state evolution", which guarantees that the difference between the current estimate and ground truth (the "aliasing") at every iteration obeys a Gaussian distribution that can be fully characterized by a scalar. However, when Fourier coefficients of a signal with non-uniform spectral density are sampled, such as in Magnetic Resonance Imaging (MRI), the aliasing is intrinsically colored, AMP's scalar state evolution is no longer accurate and the algorithm encounters convergence problems. In response, we propose the Variable Density Approximate Message Passing (VDAMP) algorithm, which uses the wavelet domain to model the colored aliasing. We present empirical evidence that VDAMP obeys a "colored state evolution", where the aliasing obeys a Gaussian distribution that can be fully characterized with one scalar per wavelet subband. A benefit of state evolution is that Stein's Unbiased Risk Estimate (SURE) can be effectively implemented, yielding an algorithm with subband-dependent thresholding that has no free parameters. We empirically evaluate the effectiveness of VDAMP on three variations of Fast Iterative Shrinkage-Thresholding (FISTA) and find that it converges in around 10 times fewer iterations on average than the next-fastest method, and to a comparable mean-squared-error.

eess.SP