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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.