• DocumentCode
    617420
  • Title

    The fastest gradient waveforms for arbitrary and optimized k-space trajectories

  • Author

    Vaziri, S. ; Lustig, M.

  • Author_Institution
    Electr. Eng. & Comput. Sci, Univ. of California, Berkeley, Berkeley, CA, USA
  • fYear
    2013
  • fDate
    7-11 April 2013
  • Firstpage
    708
  • Lastpage
    711
  • Abstract
    A method for finding the fastest possible gradient waveforms for any given k-space trajectory is presented. It is an extension of our previously introduced solution. The original scheme provides an efficient and non-iterative method for designing the fastest freely rotatable gradient waveforms. Here, the hardware constraints are relaxed so that each axis is constrained independently. This produces the fastest possible non-rotatable waveforms that can be up to 10% faster than their previous counterparts. In addition, for circular trajectories we relax the path constraints. This results in new diamond-shaped trajectories, which are more optimized than circles for separable gradient sets, reducing the total travel time by up to an additional 11%. Analysis of performance for a variety of parameters including the sensitivity to field inhomogeneity compared to freely rotatable circle trajectories is presented.
  • Keywords
    biomedical MRI; gradient methods; medical image processing; optimisation; waveform analysis; diamond-shaped trajectories; field inhomogeneity; freely rotatable circle trajectories; gradient waveforms; k-space trajectories; magnetic resonance imaging; noniterative method; optimization; rotatable gradient waveforms; Algorithm design and analysis; Diamonds; Hardware; Magnetic resonance imaging; Optimization; Trajectory; Gradient waveform design; k-space trajectories; magnetic resonance imaging (MRI); optimization methods;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Biomedical Imaging (ISBI), 2013 IEEE 10th International Symposium on
  • Conference_Location
    San Francisco, CA
  • ISSN
    1945-7928
  • Print_ISBN
    978-1-4673-6456-0
  • Type

    conf

  • DOI
    10.1109/ISBI.2013.6556573
  • Filename
    6556573