Optimizing three‐dimensional (3D) k‐space sampling trajectories is important for efficient MRI yet presents a challenging computational problem. This work proposes a generalized framework for optimizing 3D non‐Cartesian sampling patterns via… Click to show full abstract
Optimizing three‐dimensional (3D) k‐space sampling trajectories is important for efficient MRI yet presents a challenging computational problem. This work proposes a generalized framework for optimizing 3D non‐Cartesian sampling patterns via data‐driven optimization.
               
Click one of the above tabs to view related content.