PubMed Health⌕ Search

Biomedical subjects

Marcelo Guarini

Publications and source records attributed to Marcelo Guarini.

3 recordsLinked to original sources

Three dimensional k-space trajectory design using genetic algorithms.

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.

Algorithms↗

A correction algorithm for undersampled images using dynamic segmentation and entropy based focus criterion.

A post-processing technique is presented for correcting images undersampled in k-space. The method works by taking advantage of the image's background zeros (dynamically segmented through the application of a threshold) to extrapolate the missing k-space samples. The algorithm can produce good quality images from a small set of k-space frequencies with only a few iterations of simple matrix operations, using the image entropy as the focus criterion. It does not require any special patient preparation, extra pulse sequences, complex gradient programming or specialized hardware. This makes it a good candidate for any application that requires short scan times or where only few frequencies can be sampled.

Algorithms↗

MRI fast tree log scanning with helical undersampled projection acquisitions.

Magnetic Resonance Imaging opens an alternative way to analyze wood structures using a non-destructive technology. It provides high resolution, compound-based contrast manipulation and increased data acquisition flexibility. The technique is particularly useful for tree logs, since they present several characteristics that can be used to reduce the long scan time. This study proposes a method that takes advantage of the log cylindrical symmetry, acquiring transverse 1-D projections with a helical and undersampled pattern. Linear interpolation is used to estimate the skipped data and slice images are reconstructed by filtered backprojection. The sequence is improved using selective multi-pass scanning, without major variations of the scan time. Computer simulations and experimental results show that the proposed technique can increase the scan speed by a factor of 6, while maintaining the ability to identify typical tree log characteristics.

Computer Simulation↗