A Chaotic K-space Trajectory for CS-MRI

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.

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.