4.4 Article

Three dimensional k-space trajectory design using genetic algorithms

期刊

MAGNETIC RESONANCE IMAGING
卷 21, 期 7, 页码 755-764

出版社

ELSEVIER SCIENCE INC
DOI: 10.1016/S0730-725X(03)00174-7

关键词

k-space; genetic algorithm; trajectory design

向作者/读者索取更多资源

Image quality and total scan time in MRI are determined in large part by the trajectory employed to sample the Fourier space. Each trajectory has different properties like coverage of k-space, scan time, sensitivity to off-resonance conditions, etc. These properties are often contradictory, therefore a universal optimal trajectory does not exist and ultimately, it will depend on the image characteristics sought. Most trajectories used today are designed based on intuition and k-space analysis more than with optimization methods. This work presents a 3D k-space trajectory design method based on Genetic Algorithm optimization. Genetic Algorithms have been chosen because they are particularly good for searching large solution spaces. They emulate the natural evolutionary process allowing better offsprings to survive. The objective function searches the maximum of the trajectory's k-space coverage subject to hardware constraints for a fixed scanning time using the trajectory's torsion as its optimization variable. The method proved to be effective for generating k-space trajectories. They are compared with well-established trajectories. The results of simulated experiments show that they can be appropriate for image acquisition under certain special conditions, like off-resonance and undersampling. This design method can be extended to include other objective functions for different behaviors. (C) 2003 Elsevier Inc. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.4
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据