Gradient waveform design for variable density sampling in Magnetic Resonance Imaging

arXiv1412.4621MaRDI QIDQ6257293FDOQ6257293

Nicolas Chauffert, Philippe Ciuciu, Jonas Kahn, Pierre Weiss

Publication date: 15 December 2014

Abstract: Fast coverage of k-space is a major concern to speed up data acquisition in Magnetic Resonance Imaging (MRI) and limit image distortions due to long echo train durations. The hardware gradient constraints (magnitude, slew rate) must be taken into account to collect a sufficient amount of samples in a minimal amount of time. However, sampling strategies (e.g., Compressed Sensing) and optimal gradient waveform design have been developed separately so far. The major flaw of existing methods is that they do not take the sampling density into account, the latter being central in sampling theory. In particular, methods using optimal control tend to agglutinate samples in high curvature areas. In this paper, we develop an iterative algorithm to project any parameterization of k-space trajectories onto the set of feasible curves that fulfills the gradient constraints. We show that our projection algorithm provides a more efficient alternative than existinf approaches and that it can be a way of reducing acquisition time while maintaining sampling density for piece-wise linear trajectories.

This page was built for publication: Gradient waveform design for variable density sampling in Magnetic Resonance Imaging

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6257293)