Compressed sensing for longitudinal MRI: An adaptive-weighted approach
Purpose: Repeated brain MRI scans are performed in many clinical scenarios, such as follow up of patients with tumors and therapy response assessment. In this paper, the authors show an approach to utilize former scans of the patient for the acceleration of repeated MRI scans. Methods: The proposed approach utilizes the possible similarity of the repeated scans in longitudinal MRI studies. Since similarity is not guaranteed, sampling and reconstruction are adjusted during acquisition to match the actual similarity between the scans. The baseline MR scan is utilized both in the sampling stage, via adaptive sampling, and in the reconstruction stage, with weighted reconstruction. In adaptive sampling, k-space sampling locations are optimized during acquisition. Weighted reconstruction uses the locations of the nonzero coefficients in the sparse domains as a prior in the recovery process. The approach was tested on 2D and 3D MRI scans of patients with brain tumors. Results: The longitudinal adaptive CS MRI (LACS-MRI) scheme provides reconstruction quality which outperforms other CS-based approaches for rapid MRI. Examples are shown on patients with brain tumors and demonstrate improved spatial resolution. Compared with data sampled at Nyquist rate, LACS-MRI exhibits Signal-to-Error Ratio (SER) of 24.8dB with undersampling factor of 16.6 in 3D MRI. Conclusions: The authors have presented a novel method for image reconstruction utilizing similarity of scans in longitudinal MRI studies, where possible. The proposed approach can play a major part and significantly reduce scanning time in many applications that consist of disease follow-up and monitoring of longitudinal changes in brain MRI.
Code (0)
등록된 구현이 없습니다.
Tasks
compressed sensingImage ReconstructionSimilar Papers 제목 키워드 기반
Multi-echo Reconstruction from Partial K-space Scans via Adaptively Learnt Basis
In multi echo imaging, multiple T1/T2 weighted images of the same cross section is acquired. Acquiring multiple scans is time consuming. In order to accelerate, compressed sensing based techniques have been proposed. In …
compressed sensingDictionary LearningNear-Optimal Adaptive Compressed Sensing
This paper proposes a simple adaptive sensing and group testing algorithm for sparse signal recovery. The algorithm, termed Compressive Adaptive Sense and Search (CASS), is shown to be near-optimal in that it succeeds at…
compressed sensingUniversally Elevating the Phase Transition Performance of Compressed Sensing: Non-Isometric Matrices are Not Necessarily Bad Matrices
In compressed sensing problems, $\ell_1$ minimization or Basis Pursuit was known to have the best provable phase transition performance of recoverable sparsity among polynomial-time algorithms. It is of great theoretical…
compressed sensingTraining Sparse Neural Networks using Compressed Sensing
Pruning the weights of neural networks is an effective and widely-used technique for reducing model size and inference complexity. We develop and test a novel method based on compressed sensing which combines the pruning…
compressed sensingRegularized Spherical Polar Fourier Diffusion MRI with Optimal Dictionary Learning
Compressed Sensing (CS) takes advantage of signal sparsity or compressibility and allows superb signal reconstruction from relatively few measurements. Based on CS theory, a suitable dictionary for sparse representation …
compressed sensingDictionary LearningDiffusion MRI