Auto-calibrated parallel imaging reconstruction for arbitrary trajectories using k-space sparse matrices (kSPA).
Image acquisition of magnetic resonance imaging (MRI) can be accelerated by using multiple receiving coils simultaneously. The problem of reconstructing an unaliased image from partially sampled k-space data can be formulated as a large system of sparse linear equations. The k-space sparse matrix (kSPA) algorithm proposes to solve the system of equations by finding a sparse approximate inverse. This algorithm has been shown to accelerate the image reconstruction for a large number of coils. The original kSPA algorithm requires knowledge of coil sensitivities. Here, we propose and demonstrate an auto-calibrated kSPA algorithm that does not require the explicit computation of the coil sensitivity maps. We have also shown that calibration data, in principle, can be acquired at any region of k-space. This property applies to arbitrary sampling trajectories and all reconstruction algorithms based on k-space. In practice, because of its higher SNR, calibration data acquired at the center of k-space performed more favorably. Such auto-calibration can be advantageous in cases where an accurate sensitivity map is difficult to obtain.
Liu
Chunlei
C
Brain Imaging and Analysis Center, School of Medicine, Duke University, Durham, NC 27705, USA. chunlei.liu@duke.edu
Zhang
Jian
J
Moseley
Michael E
ME
D000465:Algorithms; D001921:Brain / Q000033:anatomy & histology; D003198:Computer Simulation; D006801:Humans; D007091:Image Processing, Computer-Assisted / Q000379:methods*; D008279:Magnetic Resonance Imaging / Q000379:methods*; D015233:Models, Statistical