Accelerating Non-Cartesian MRI Reconstruction Convergence using k-space Preconditioning

Abstract

We propose a k-space preconditioning formulation for accelerating the convergence of iterative Magnetic Resonance Imaging (MRI) reconstructions from non-uniformly sampled k-space data. Existing methods either use sampling density compensations which sacrifice reconstruction accuracy, or circulant preconditioners which increase per-iteration computation. Our approach overcomes both shortcomings. Concretely, we show that viewing the reconstruction problem in the dual formulation allows us to precondition in k-space using density-compensation-like operations. Using the primal-dual hybrid gradient method, the proposed preconditioning method does not have inner loops and are competitive in accelerating convergence compared to existing algorithms. We derive l2-optimized preconditioners, and demonstrate through experiments that the proposed method converges in about ten iterations in practice.

arXiv commentAccepted to IEEE Transaction on Medical Imaging

References in corpus (2)

• The NumPy array: a structure for efficient numerical computation
• Accelerating CS in Parallel Imaging Reconstructions Using an Efficient and Effective Circulant Preconditioner

Cited by in corpus (6)

• CG-SENSE revisited: Results from the first ISMRM reproducibility challenge
• An End-To-End-Trainable Iterative Network Architecture for Accelerated Radial Multi-Coil 2D Cine MR Image Reconstruction
• Data-Consistent Non-Cartesian Deep Subspace Learning for Efficient Dynamic MR Image Reconstruction
• Optimization methods for MR image reconstruction (long version)
• A Complex Quasi-Newton Proximal Method for Image Reconstruction in Compressed Sensing MRI
• Memory Efficient Model Based Deep Learning Reconstructions for High Spatial Resolution 3D Non-Cartesian Acquisitions