Abstract

Parallel magnetic resonance imaging (MRI) reconstruction problem can be formulated as a multichannel sampling problem where solutions can be sought analytically. However, the channel functions given by the coil sensitivities in parallel imaging are not known exactly and the estimation error usually leads to artifacts or degraded SNR. In the context of parallel MRI, this work investigates the blind multichannel under-sampling problem where both the channel functions and signal are reconstructed simultaneously under sparseness constraints. We propose a novel algorithm to reconstruct both the coil sensitivities and image simultaneously from randomly undersampled, multichannel k-space data. The algorithm effectively applies the concept of compressed sensing (CS) to solve an underdetermined nonlinear problem, but is different from the conventional CS in that the sensing matrix is not known exactly. The proposed algorithm is shown to improve the reconstruction accuracy of SparseSENSE and L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> -SPIRiT when the same number of measurements is used.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.