Three dimensional k-space trajectory design using genetic algorithms

Sabat, S; Miró R.; Guarini, M.; Guesalaga A.; Irarrázaval P.

Abstract

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. © 2003 Elsevier Inc. All rights reserved.

Más información

Título según WOS: Three dimensional k-space trajectory design using genetic algorithms
Título según SCOPUS: Three dimensional k-space trajectory design using genetic algorithms
Título de la Revista: MAGNETIC RESONANCE IMAGING
Volumen: 21
Número: 7
Editorial: Elsevier Science Inc.
Fecha de publicación: 2003
Página de inicio: 755
Página final: 764
Idioma: English
URL: http://linkinghub.elsevier.com/retrieve/pii/S0730725X03001747
DOI:

10.1016/S0730-725X(03)00174-7

Notas: ISI, SCOPUS