• DocumentCode
    617417
  • Title

    Spoke pulse design in magnetic resonance imaging using greedy minimax algorithm

  • Author

    Hao Sun ; Weller, Daniel S. ; Chu, A. ; Ramani, S. ; Daehyun Yoon ; Nielsen, Jon-Fredrik ; Fessler, Jeffrey A.

  • Author_Institution
    Dept. of Electr. & Electron. Eng., Univ. of Michigan-Ann Arbor, Ann Arbor, MI, USA
  • fYear
    2013
  • fDate
    7-11 April 2013
  • Firstpage
    696
  • Lastpage
    699
  • Abstract
    Spoke RF pulse design in MRI requires joint optimization of the k-space trajectory and RF pulse weights. This design task is often modelled as a sparse approximation problem with a cost function evaluating the l2 norm of the excitation error, which can be approximately solved using the orthogonal matching pursuit (OMP) algorithm. However, l2 optimization does not strictly regulate a maximum deviation between excitation and desired patterns, and may leave bright or dark spots in the image. In this paper, we model the pulse design problem as a sparse approximation problem with an l norm cost function, and propose a greedy algorithm for solving this new problem. Simulation results demonstrate that our algorithm can produce improved spoke RF pulses (reduced maximum error) compared to l2 optimization.
  • Keywords
    approximation theory; biomedical MRI; greedy algorithms; minimisation; OMP algorithm; RF pulse weights; cost function evaluation; greedy minimax algorithm; joint l2 optimization; k-space trajectory; magnetic resonance imaging; orthogonal matching pursuit algorithm; sparse approximation problem; spoke RF pulse design; spoke pulse design; Algorithm design and analysis; Approximation algorithms; Approximation methods; Cost function; Matching pursuit algorithms; Minimization; Radio frequency; OMP; RF shimming; l norm; minimax; spoke pulse;
  • 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.6556570
  • Filename
    6556570