Meeting Banner
Abstract #3380

Optimality of Equally-Spaced Phase Increments for Banding Removal in BSSFP

Marcus Bjrk1, R. Reeve Ingle2, Jolle K. Barral3, Erik Gudmundson4, 5, Dwight G. Nishimura2, Petre Stoica1

1Department of Information Technology, Uppsala University, Uppsala, Sweden; 2Electrical Engineering, Stanford University, Stanford, CA, United States; 3HeartVista, Inc., Los Altos, CA, United States; 4Centre for Mathematical Sciences, Lund University, Lund, Sweden; 5Signal Processing Lab, ACCESS Linnaeus Center, KTH Royal Institute of Technology, Stockholm, Sweden

Banding artifacts are a major issue in bSSFP. Several images with equally spaced phase increments are typically acquired to mitigate this issue. However, to the best of our knowledge, no theoretical justification exists for such a distribution of phase increments. We derived the Cramr-Rao bound (CRB) from the bSSFP signal model and optimized the phase increments distribution to minimize the maximum CRB over all possible off-resonances. We show that the worst-case CRB is minimized when using equally spaced phases, and that the resulting performance is relatively close to the optimal, had the off-resonance been known a priori.

Abstract PDF E-Poster Video

Keywords

access acquisition addition allowable although altos analytical application artifacts assuming available balanced banding bands blue bottom bound capable choice choices close combination common commonly complexity conducted consider constant corresponds cram cycling dashed depend dependent distance distributed distribution dotted electrical eliminating empirically engineering equally equation equations estimation estimator evaluation exhaustive experimental expression finding fitted formulate free freeman function gain general gives goal green grid gridded important increments independent institute intuitive investigation involve known lead likely local magnitude many mathematical maximizes measured minimax minimize minimized minimizes model need normalized noted nulls numerical offsets optimal optimality optimization optimum performance periodic power prior probability problem profiles reducing reeve regarding relatively remaining removal resort restrict sampling scenario search seem sense sensitivity setup short since solid solution spaced special spectral steady subsequent sufficient suggest support technology terms theoretical theory together translation true unbiased undesirable uniform uniformly unknown utilize variance variations varying vector view virtually worst yellow yields