- Poster presentation
L1 k-t ESPIRiT: Accelerating Dynamic MRI Using Efficient Auto-Calibrated Parallel Imaging and Compressed Sensing Reconstruction
Journal of Cardiovascular Magnetic Resonancevolume 18, Article number: P302 (2016)
Iterative self-consistent parallel imaging (PI) reconstruction (SPIRiT) [1, Lustig M, MRM 64:457-71,2010] has been extended for dynamic imaging by exploiting temporal correlations in k-t space (k-t SPIRiT) [2,Santelli C, MRM 72:1233-45, 2014]. Using eigendecomposition of a modified SPIRiT operator, computationally optimized reconstruction formally translates into auto-calibrated SENSE (ESPIRiT) [3, Uecker, MRM 71:990-1001, 2014]. In this work, this principle is applied to a k-t SPIRiT operator resulting in SENSE-like reconstruction of a coil-combined x-f space object. The method is tested on dynamic cardiac short-axis view data and compared to standard L1-regularized k-t SPIRiT.
L1 k-t SPIRiT reconstructs a multi-coil x-f image series ρ by solving the optimization problem (1) (Figure 1a). For each x-f voxel, the PI-operator G reduces to a matrix-vector multiplication resulting into a computational complexity of O(N c xN c ) (N c : No. of coils). Following , eigenvectors and eigenvalues of G assemble the matrix S x,f (composed of stacked diagonal matrices) directly transforming an x-f object into its multi-coil sensitivity-weighted representation. Thereby, the PI matrix G in (1) can be replaced by S x,f in the modified data-consistency term in (2) (Figure 1a). Solving (2), termed as L1 k-t ESPIRiT, then results in a computationally optimized equivalent of (1) with an O(N c ) PI operator and a sparsifying transform Ψ acting on a coil-combined image ρ. Similar to [4, Lai P, ISMRM:345, 2010], an algorithm to solve (2) for Cartesian random variable-density undersampling is given in Figure 1b.
Breath-held fully sampled cine 2D balanced SSFP short axis view data were acquired from a healthy subject on a 3T scanner (Philips Ingenia, Philips Healthcare, Best, The Netherlands). 28-channel data was compressed to 12 virtual channels [5, Buehrer M, MRM(57):1131-39, 2007]. G and S x,f were derived from the central k-space profiles of the 5-fold retrospectively decimated data. Due to the sparse x-f support, Ψ was set to identity I. k-t SPIRiT and k-t ESPIRiT reconstructions were both performed using POCS-like algorithms as described in  and Figure 1b, respectively (K = 30 iterations each).
Eigendecomposition of the k-t SPIRiT operator has been proposed and implemented to reduce computational costs. In-vivo experiments showed equivalence of k-t SPIRiT and k-t ESPIRiT, and up to 3-fold reconstruction time savings of the proposed relative to the standard method. Thus, further advances towards feasible reconstruction times for iterative solvers for combined PI and compressed sensing have been provided.