Augmented Lagrangian with Variable Splitting for Faster Non-Cartesian L 1 -SPIRiT MR Image Reconstruction: Supplementary Material

Similar documents
MORE sophisticated magnetic resonance image acquisition

Splitting-Based Statistical X-Ray CT Image Reconstruction with Blind Gain Correction

Institute of Cardiovascular Science, UCL Centre for Cardiovascular Imaging, London, United Kingdom, 2

Reduced memory augmented Lagrangian algorithm for 3D iterative X-ray CT image reconstruction

THE STEP BY STEP INTERACTIVE GUIDE

Parallel MR Image Reconstruction Using Augmented Lagrangian Methods Sathish Ramani*, Member, IEEE, and Jeffrey A. Fessler, Fellow, IEEE

Simplified statistical image reconstruction algorithm for polyenergetic X-ray CT. y i Poisson I i (E)e R } where, b i

Axial block coordinate descent (ABCD) algorithm for X-ray CT image reconstruction

Role of Parallel Imaging in High Field Functional MRI

TITLE: Regularized Reconstruction of Dynamic Contrast-Enhanced MR Images for Evaluation of Breast Lesions

Low-Rank and Adaptive Sparse Signal (LASSI) Models for Highly Accelerated Dynamic Imaging

REGULARIZATION PARAMETER TRIMMING FOR ITERATIVE IMAGE RECONSTRUCTION

Iterative SPECT reconstruction with 3D detector response

Separate Magnitude and Phase Regularization via Compressed Sensing

Nuts & Bolts of Advanced Imaging. Image Reconstruction Parallel Imaging

Compressed Sensing Reconstructions for Dynamic Contrast Enhanced MRI

A Fast GPU-Based Approach to Branchless Distance-Driven Projection and Back-Projection in Cone Beam CT

Tradeoffs and complexities in model-based MR image reconstruction

IEEE TRANSACTIONS ON MEDICAL IMAGING, VOL. 31, NO. 3, MARCH Sathish Ramani*, Member, IEEE, and Jeffrey A. Fessler, Fellow, IEEE

Efficient MR Image Reconstruction for Compressed MR Imaging

CHAPTER 9 INPAINTING USING SPARSE REPRESENTATION AND INVERSE DCT

Advanced phase retrieval: maximum likelihood technique with sparse regularization of phase and amplitude

Estimating 3D Respiratory Motion from Orbiting Views

Compressed Sensing for Rapid MR Imaging

Accelerating CT Iterative Reconstruction Using ADMM and Nesterov s Methods

Super-resolution Reconstruction of Fetal Brain MRI

Adaptive Robotics - Final Report Extending Q-Learning to Infinite Spaces

Image Compression: An Artificial Neural Network Approach

Compressed Sensing from Several Sets of Downsampled Fourier Values using Only FFTs

MRI Physics II: Gradients, Imaging

Ensemble registration: Combining groupwise registration and segmentation

Computational Acceleration for MR Image Reconstruction in Partially Parallel Imaging Xiaojing Ye*, Yunmei Chen, and Feng Huang

Simultaneous Estimation of Attenuation and Activity Images Using Optimization Transfer

Synthetic Aperture Imaging Using a Randomly Steered Spotlight

I How does the formulation (5) serve the purpose of the composite parameterization

Union of Learned Sparsifying Transforms Based Low-Dose 3D CT Image Reconstruction

FOV. ] are the gradient waveforms. The reconstruction of this signal proceeds by an inverse Fourier Transform as:. [2] ( ) ( )

6 credits. BMSC-GA Practical Magnetic Resonance Imaging II

Optimal Sampling Geometries for TV-Norm Reconstruction of fmri Data

Image reconstruction using compressed sensing for individual and collective coil methods.

Higher Degree Total Variation for 3-D Image Recovery

Fast Imaging Trajectories: Non-Cartesian Sampling (1)

PERFORMANCE ANALYSIS BETWEEN TWO SPARSITY-CONSTRAINED MRI METHODS: HIGHLY CONSTRAINED BACKPROJECTION (HYPR) AND

Spread Spectrum Using Chirp Modulated RF Pulses for Incoherent Sampling Compressive Sensing MRI

AN ALGORITHM FOR BLIND RESTORATION OF BLURRED AND NOISY IMAGES

Iterative methods for use with the Fast Multipole Method

Fast, Iterative Image Reconstruction for MRI in the Presence of Field Inhomogeneities

IMAGE reconstruction in conventional magnetic resonance

NIH Public Access Author Manuscript Proc Int Conf Image Proc. Author manuscript; available in PMC 2013 May 03.

P-LORAKS: Low-Rank Modeling of Local k-space Neighborhoods with Parallel Imaging Data

Partial k-space Reconstruction

Image Denoising Based on Hybrid Fourier and Neighborhood Wavelet Coefficients Jun Cheng, Songli Lei

Partial k-space Recconstruction

Graph-Shifts Anatomic 3D Segmentation by Dynamic Hierarchical Minimization

G Practical Magnetic Resonance Imaging II Sackler Institute of Biomedical Sciences New York University School of Medicine. Compressed Sensing

Motion Correction in fmri by Mapping Slice-to-Volume with Concurrent Field-Inhomogeneity Correction

Inverse problem regularization using adaptive signal models

Information about presenter

Spiral keyhole imaging for MR fingerprinting

Improved Version of Kernelized Fuzzy C-Means using Credibility

Data dependent parameterization and covariance calculation for inversion of focusing operators

Constrained and Unconstrained Optimization

Alternating Direction Method of Multiplier for Tomography With Nonlocal Regularizers

Sparse sampling in MRI: From basic theory to clinical application. R. Marc Lebel, PhD Department of Electrical Engineering Department of Radiology

Registration by continuous optimisation. Stefan Klein Erasmus MC, the Netherlands Biomedical Imaging Group Rotterdam (BIGR)

Combination of Parallel Imaging and Compressed Sensing for high acceleration factor at 7T

Binary Representations of Integers and the Performance of Selectorecombinative Genetic Algorithms

A Convex Optimization Approach to pmri Reconstruction

Collaborative Sparsity and Compressive MRI

Detecting Burnscar from Hyperspectral Imagery via Sparse Representation with Low-Rank Interference

Algebraic Iterative Methods for Computed Tomography

Parallel Imaging. Marcin.

Hello, Thanks for the introduction

Parametric Texture Model based on Joint Statistics

Topology Correction for Brain Atlas Segmentation using a Multiscale Algorithm

IT has been known for a long time that direct Fourier. Iterative Tomographic Image Reconstruction Using Fourier-Based Forward and Back-Projectors

Figure 6.1: Truss topology optimization diagram.

PARALLEL OPTIMIZATION

CT NOISE POWER SPECTRUM FOR FILTERED BACKPROJECTION AND ITERATIVE RECONSTRUCTION

A MULTI-RESOLUTION APPROACH TO DEPTH FIELD ESTIMATION IN DENSE IMAGE ARRAYS F. Battisti, M. Brizzi, M. Carli, A. Neri

Divide and Conquer Kernel Ridge Regression

Total Variation Regularization Method for 3D Rotational Coronary Angiography

Fast reconstruction for multichannel compressed sensing using a hierarchically semiseparable solver

Colored Point Cloud Registration Revisited Supplementary Material

Off-the-Grid Compressive Imaging: Recovery of Piecewise Constant Images from Few Fourier Samples

STATISTICAL image reconstruction methods for X-ray

Image registration for motion estimation in cardiac CT

MODEL-based recovery of images from noisy and sparse. MoDL: Model Based Deep Learning Architecture for Inverse Problems

Neural Network Weight Selection Using Genetic Algorithms

Steen Moeller Center for Magnetic Resonance research University of Minnesota

Random Forests and Boosting

Conditioning of and Algorithms for Image Reconstruction from Irregular Frequency Domain Samples

6.1 The Rectangular Coordinate System

Example 24 Spring-back

Module 4. K-Space Symmetry. Review. K-Space Review. K-Space Symmetry. Partial or Fractional Echo. Half or Partial Fourier HASTE

PET Image Reconstruction using Anatomical Information through Mutual Information Based Priors

Field Maps. 1 Field Map Acquisition. John Pauly. October 5, 2005

Zigzag Sampling for Improved Parallel Imaging

Two-phase matrix splitting methods for asymmetric and symmetric LCP

arxiv: v2 [physics.med-ph] 22 Jul 2014

Transcription:

IEEE TRANSACTIONS ON MEDICAL IMAGING: SUPPLEMENTARY MATERIAL 1 Augmented Lagrangian with Variable Splitting for Faster Non-Cartesian L 1 -SPIRiT MR Image Reconstruction: Supplementary Material Daniel S. Weller, Member, IEEE, Sathish Ramani, Member, IEEE, and Jeffrey A. Fessler, Fellow, IEEE Here, we provide additional results supporting the use of our implementation of non-cartesian L 1 -SPIRiT, using a combination of variable splitting, an augmented Lagrangian formulation, and preconditioned conjugate gradients. I. DATA ACQUISITION In the paper [1], we described both simulated and real data sets. Figure 1, reprinted from [1], portrays ground truth images for all data sets. To save space, we focused on convergence plots and reconstructed images resulting from our real data experiments only. Additional convergence plots and reconstructions featuring our simulated data sets with eight and 16 channels of T 1 -weighted spiral data are included in this supplement. The eight-channel simulated data was undersampled by a factor of three, while the 16-channel simulated k-space was undersampled by a factor of four to leverage the increased number of coils. In the experiments that follow, our reconstructions use the same methods and parameter choices described in the original paper. In particular, we used the same sparsifying transforms, regularization parameters, penalty parameter selections, and conjugate phase image initializations. To evaluate the convergence rates of the different algorithms, our baseline was the same preconditioned Split-Bregman method run for 2, iterations. Simulated data. Real data (T 1 -weighted). II. CONVERGENCE RATE COMPARISONS In the original paper, relative objective function values f(x) f opt are plotted for boththe real T 1 -weightedspiral 2D data and real T 2 -weighted radial 2D data. Here, we provide the same plots over a longer time scale, so that long-term convergence behavior of the different algorithms is evident. Since the objective function may vary relatively slowly in a neighborhood around its minimum, the reconstructed image X may actually be farther from its optimum X opt than a small relative objective function value would lead one to believe. Therefore, in this supplement, we also include plots of the normalized root mean squared difference (NRMSD), as introduced in the original text. To minimize the bias any This work was supported by the National Institutes of Health through grants F32 EB15914 and P1 CA87634 and by CPU donations from Intel. D. S. Weller and J. A. Fessler are with the Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, 4819 USA e-mail: ({wellerds, fessler}@umich.edu). S. Ramani is with GE Global Research, Niskayuna, NY, 1239 USA e-mail: (sathish.ramani@ge.com). (c) Real data (T 2 -weighted). Fig. 1. Fully-sampled multi-channel magnitude images formed using sum-ofsquares of T 1 -weighted simulated (Brainweb) data, T 1 -weighted real data, and (c) T 2 -weighted real data. The inset rectangular regions are enlarged to show fine details. This figure is reprinted from [1]. potential non-uniqueness of the optimal reconstruction may have on our conclusions, we used the Split-Bregman baseline image. The convergence plots for the real T 1 -weighted spiral 2D data are shown in Fig. 2. Our preconditioned based methods both converge more rapidly than preconditioned Split-Bregman iteration and both approaches without preconditioning, in terms of both objective function value and

2 IEEE TRANSACTIONS ON MEDICAL IMAGING: SUPPLEMENTARY MATERIAL - + precon (z-exact) + precon (z-cg) 2 4 6 8 1 12 2 4 6 8 1 12 Fig. 2. The and objective values f(x) f opt relative to the baseline image objective value f opt are plotted versus time for each of the compared algorithms for the real T 1 -weighted spiral data. NRMSD. This fast convergence occurs even though we use the condition numbers calibrated with the simulated data to tune our method s penalty parameters. Our proposed method also beats the method until the method experiences rapid convergence around 4 seconds into the experiment. The method flattens out, although the difference in final objective value or NRMSD appears relatively insignificant for this data set. The convergence rate improvements portrayed in Fig. 3 for the real T 2 -weighted radially sampled 2D data echo what were observed for the real T 1 -weighted spiral data. Again, our preconditioned -based methods converge faster than preconditioned Split-Bregman. The improvement over is significant in the initial minutes of run time, but the method ungoes a phase of rapid convergence around 3 seconds, before flattening out. The convergence plots for the 8-channel simulated spiral 2D data shown in Fig. 4 and the 16-channel simulated spiral 2D data in Fig 5 both depict far more substantial advantages in both NRMSD and objective function value. The preconditioned forms of the proposed method converge much more rapidly than either competing method for the simulated data. The non-preconditioned variants have the slowest convergence rates of all. This performance holds true when measuring convergence of either the image or the objective function value. We notice that the difference in convergence rates for using exact z-updates versus preconditioned z-updates in our proposed algorithm appears to grow noticeably with the larger number of channels. Reconstructed images from the 8-channel simulated spiral 2D data captured after seconds are displayed in Fig. 6 for and the preconditioned variants of the Split-Bregman and proposed -based methods. Figure 7 shows similar reconstructions from the 16-channel simulated spiral 2D data after 1 seconds of reconstruction time. Prominent spiral artifacts are visible in both the magnitude and difference images for the and Split-Bregman methods, in both sets of reconstructions. The proposed -based reconstructions contain no such visible artifacts. These images corroborate the substantial difference in reconstruction quality after a limited reconstruction time observed for the two real data sets in the original manuscript. Furthermore, we demonstrate the improvement carries over to larger receive array coils, even using the same condition numbers and shrinkage threshold fraction to tune our algorithm. III. DISCUSSION AND CONCLUSIONS The preconditioned variants of the proposed -based method clearly outperform conventional approaches for non- Cartesian L 1 -SPIRiT reconstruction, at least for a limited reconstruction time. The uniform quality of the reconstructions of all the data sets using the same condition numbers and sparse threshold fraction demonstrates the generality of both our proposed method and our approach for tuning the penalty parameters, which are known to impact the convergence rate of such algorithms. The importance of preconditioning is also evident here, as the un-preconditioned -based method converges relatively slowly, as does the un-preconditioned Split-Bregman iteration.

WELLER et al.: AUGMENTED LAGRANGIAN SPLITTING FOR NON-CARTESIAN L 1-SPIRIT 3 - + precon (z-exact) + precon (z-cg) 2 4 6 8 1 12 14 1-15 2 4 6 8 1 12 14 Fig. 3. The and objective values f(x) f opt relative to the baseline image objective value f opt are plotted versus time for each of the compared algorithms for the real T 2 -weighted radial data. - -2 2 4 6 8 1 12 14 16 + precon (z-cg) + precon (z-exact) 1-15 2 4 6 8 1 12 14 16 Fig. 4. The and objective values f(x) f opt relative to the baseline image objective value f opt are plotted versus time for each of the compared algorithms for the simulated 8-channel spiral data. REFERENCES [1] D. S. Weller, S. Ramani, and J. A. Fessler, Augmented Lagrangian with variable splitting for faster non-cartesian L1-SPIRiT MR image reconstruction, IEEE Trans. Med. Imag., to appear.

4 IEEE TRANSACTIONS ON MEDICAL IMAGING: SUPPLEMENTARY MATERIAL - -2 1 1 2 2 3 + precon (z-cg) + precon (z-exact) 1-15 1 1 2 2 3 Fig. 5. The and objective values f(x) f opt relative to the baseline image objective value f opt are plotted versus time for each of the compared algorithms for the simulated 16-channel spiral data.

WELLER et al.: AUGMENTED LAGRANGIAN SPLITTING FOR NON-CARTESIAN L 1-SPIRIT 5 recon. recon. Split-Bregman recon. Split-Bregman recon. (c) with PCG for z-update. (c) with PCG for z-update. (d) with exact z-update. Fig. 6. Sum-of-squared combined reconstructed and difference images for the simulated 8-channel data set after seconds of reconstruction time using, Split-Bregman with diagonal preconditioning, (c) with preconditioning both X and z-updates, and (d) with preconditioned X-updates and exact z-updates demonstrate the advantage of rapid convergence on image quality after a fixed amount of time. Zoomed images of the inset region show differences in fine details. The difference images in the right column, relative to the ground truth, are all scaled by. (d) with exact z-update. Fig. 7. Sum-of-squared combined reconstructed and difference images for the simulated 16-channel data set after 1 seconds of reconstruction time using, Split-Bregman with diagonal preconditioning, (c) with preconditioning both X and z-updates, and (d) with preconditioned X-updates and exact z-updates demonstrate the advantage of rapid convergence on image quality after a fixed amount of time. Zoomed images of the inset region show differences in fine details. The difference images in the right column, relative to the ground truth, are all scaled by.