Fast Data-Driven Learning of MRI Sampling Pattern for Large Scale Problems
Purpose: A fast data-driven optimization approach, named bias-accelerated subset selection (BASS), is proposed for learning efficacious sampling patterns (SPs) with the purpose of reducing scan time in large-dimensional parallel MRI. Methods: BASS is applicable when Cartesian fully-sampled k-space data of specific anatomy is available for training and the reconstruction method is specified, learning which k-space points are more relevant for the specific anatomy and reconstruction in recovering the non-sampled points. BASS was tested with four reconstruction methods for parallel MRI based on low-rankness and sparsity that allow a free choice of the SP. Two datasets were tested, one of the brain images for high-resolution imaging and another of knee images for quantitative mapping of the cartilage. Results: BASS, with its low computational cost and fast convergence, obtained SPs 100 times faster than the current best greedy approaches. Reconstruction quality increased up to 45\% with our learned SP over that provided by variable density and Poisson disk SPs, considering the same scan time. Optionally, the scan time can be nearly halved without loss of reconstruction quality. Conclusion: Compared with current approaches, BASS can be used to rapidly learn effective SPs for various reconstruction methods, using larger SP and larger datasets. This enables a better selection of efficacious sampling-reconstruction pairs for specific MRI problems.
Code (0)
등록된 구현이 없습니다.
Tasks
AnatomySimilar Papers 제목 키워드 기반
AutoSamp: Autoencoding k-space Sampling via Variational Information Maximization for 3D MRI
Accelerated MRI protocols routinely involve a predefined sampling pattern that undersamples the k-space. Finding an optimal pattern can enhance the reconstruction quality, however this optimization is a challenging task.…
Anatomycompressed sensingDecoderLearning to Sample MRI via Variational Information Maximization
Accelerating MRI scans requires optimal sampling of k-space data. This is however a daunting task due to the discrete and non-convex nature of sampling optimization. To cope with this challenge, we put forth a novel deep…
DecoderEfficient approximation of Jacobian matrices involving a non-uniform fast Fourier transform (NUFFT)
There is growing interest in learning Fourier domain sampling strategies (particularly for magnetic resonance imaging, MRI) using optimization approaches. For non-Cartesian sampling patterns, the system models typically …
compressed sensingImage ReconstructionStochastic OptimizationModel-free data driven Methods in Mechanics: Material data Identification and solvers
This paper presents an integrated model-free data-driven approach to solid mechanics, allowing to perform numerical simuulations on structures on the basis of measures of displacement fields on representative samples, wi…
Single-pass Object-adaptive Data Undersampling and Reconstruction for MRI
There is much recent interest in techniques to accelerate the data acquisition process in MRI by acquiring limited measurements. Often sophisticated reconstruction algorithms are deployed to maintain high image quality i…
Image ReconstructionObject