Abstract #1542
A Chaotic K-space Trajectory for CS-MRI
Ya Li 1 , Ran Yang 1 , and Zhongping Zhang 2
1
Sun Yat-sen University, Guangzhou,
Guangdong, China,
2
GE
Healthcare, Guangzhou, Guangdong, China
In general, the CS-MRI process carries out two main
operations: undersampling in the k-space, which meets
the incoherence condition, and the reconstruction of the
image, which meets the sparsity or compressibility
condition. To meet the incoherence condition, the basic
theory of compressed sensing requires acquisition of
randomized set of measurements. For MRI scanner,
however, random sampling would yield longer sampling
trajectory because of the MR hardware constraints, and
requires bigger changes in amplitudes and polarity of MR
gradients those making it infeasible practically. Here
we introduce a chaotic k-space trajectory for CS-MRI,
which is a good candidate k-space trajectory of
incoherent-like sampling scheme.
This abstract and the presentation materials are available to members only;
a login is required.
Join Here
