Abstract #1807

Minimizing the error in finding peak orientations of fiber ODF in diffusion MRI using Nelder-Mead simplex method

Kuan-Hung Cho¹, Chun-Hung Yeh², Yi-Ping Chao^3,4, Ching-Po Lin⁵, and Li-Wei Kuo^1,6

¹Institute of Biomedical Engineering and Nanomedicine, National Health Research Institutes, Miaoli, Taiwan, ²The Florey Institute of Neuroscience and Mental Health, Melbourne, Australia, ³Department of Computer Science and Information Engineering, Chang Gung University, Taoyuan, Taiwan, ⁴Department of Neurology, Chang Gung Memorial Hospital at Linkou, Taoyuan, Taiwan, ⁵Institute of neuroscience, National Yang-Ming University, Taipei, Taiwan, ⁶Institute of Medical Device and Imaging, National Taiwan University College of Medicine, Taipei, Taiwan

Discrete mesh search method is commonly used to determine fiber orientations by searching orientations corresponding local maxima of orientation distribution function (ODF). However, this method may produce extra errors relating to the number of sampling points of ODF in fiber orientation estimate. We address this problem and minimize the error of fiber orientation estimate by using Nelder-Mead simplex method. The results from computer simulation and phantom experiment show that Nelder-Mead simplex method gives accurate fiber orientation estimation better than discrete mesh search method with ODF sampling points less than 163,842.

How to access this content:

For one year after publication, abstracts and videos are only open to registrants of this annual meeting. Registrants should use their existing login information. Non-registrant access can be purchased via the ISMRM E-Library.

After one year, current ISMRM & ISMRT members get free access to both the abstracts and videos. Non-members and non-registrants must purchase access via the ISMRM E-Library.

After two years, the meeting proceedings (abstracts) are opened to the public and require no login information. Videos remain behind password for access by members, registrants and E-Library customers.

Click here for more information on becoming a member.