Fast Acquisition for Quantitative MRI Maps: Sparse Recovery from Non-linear Measurements
원문 초록
This work addresses the problem of estimating proton density and T1 maps from two partially sampled K-space scans such that the total acquisition time remains approximately the same as a single scan. Existing multi parametric non linear curve fitting techniques require a large number (8 or more) of echoes to estimate the maps resulting in prolonged (clinically infeasible) acquisition times. Our simulation results show that our method yields very accurate and robust results from only two partially sampled scans (total scan time being the same as a single echo MRI). We model PD and T1 maps to be sparse in some transform domain. The PD map is recovered via standard Compressed Sensing based recovery technique. Estimating the T1 map requires solving an analysis prior sparse recovery problem from non linear measurements, since the relationship between T1 values and intensity values or K space samples is not linear. For the first time in this work, we propose an algorithm for analysis prior sparse recovery for non linear measurements. We have compared our approach with the only existing technique based on matrix factorization from non linear measurements; our method yields considerably superior results.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Denoising Diffusion Probabilistic Models for Magnetic Resonance Fingerprinting
Cross-organ all-in-one parallel compressed sensing magnetic resonance imaging
Convergent Complex Quasi-Newton Proximal Methods for Gradient-Driven Denoisers in Compressed Sensing MRI Reconstruction
PLAIN: Scalable Estimation Architecture for Integrated Sensing and Communication
LeanVAE: An Ultra-Efficient Reconstruction VAE for Video Diffusion Models
Advancing MRI Reconstruction: A Systematic Review of Deep Learning and Compressed Sensing Integration
토론
이 논문과 연결된 포럼 글이 아직 없습니다.