Publication | Closed Access
Durga: A heuristically-optimized data collection strategy for volumetric magnetic resonance imaging
13
Citations
18
References
2008
Year
Image ReconstructionData Collection TrajectoryEngineeringAdvanced ImagingBiomedical EngineeringSparse ImagingDiagnostic ImagingMagnetic Resonance ImagingImage AnalysisData ScienceData CollectionComputational ImagingDance ImagesTranslational ImagingData ManagementRadiologyHealth SciencesReconstruction TechniqueMedical ImagingNeuroimagingInverse ProblemsMedical Image ComputingData Acquisition TrajectoriesBiomedical ImagingClinical ImageImagingMedical Image Analysis
Abstract A heuristic design method for rapid volumetric magnetic resonance imaging data acquisition trajectories is presented, using a series of second-order cone optimization subproblems. Other researchers have considered non-raster data collection trajectories and under-sampled data patterns. This work demonstrates that much higher rates of under-sampling are possible with an asymmetric set of trajectories, with very little loss in resolution, but the addition of noise-like artefacts. The proposed data collection trajectory, Durga, further minimizes collection time by incorporating short un-refocused excitation pulses, resulting in above 98% collection efficiency for balanced steady state free precession imaging. The optimization subproblems are novel, in that they incorporate all requirements, including data collection (coverage), physicality (device limits), and signal generation (zeroth- and higher- moment properties) in a single convex problem, which allows the resulting trajectories to exhibit a higher collection efficiency than any existing trajectory design. Keywords: nonuniform Fourier transformmagnetic resonance imagingvolumetric imagingSOCP k-space trajectory optimization Acknowledgements The authors thank Mark Haacke, Paul Margosian, Michael Noseworthy, Michael Thompson, Dee Wu, Ian Young and Yuri Zinchenko for research suggestions and comments on the manuscript. Additionally, the authors thank NSERC, CFI, and OIT for research support.
| Year | Citations | |
|---|---|---|
Page 1
Page 1