Spoke pulse design in magnetic resonance imaging using greedy minimax algorithm
Lists
Only you see this
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 l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> norm of the excitation error, which can be approximately solved using the orthogonal matching pursuit (OMP) algorithm. However, l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> 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 <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> 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 l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> optimization.
BibTeX
@inproceedings{sun2013spoke,
author = {Hao Sun and Daniel S. Weller and Alan Chu and Sathish Ramani and Daehyun Yoon and Jon-Fredrik Nielsen and Jeffrey A. Fessler},
title = {{Spoke pulse design in magnetic resonance imaging using greedy minimax algorithm}},
booktitle = {ISBI},
year = {2013},
url = {https://openreview.net/forum?id=E0MO8cYnGzO},
}Loading related content...