Dataset Information

Performance Comparison of Compressed Sensing Algorithms for Accelerating T_1ρ Mapping of Human Brain.

ABSTRACT:

Background

3D-T_1ρ mapping is useful to quantify various neurologic disorders, but data are currently time-consuming to acquire.

Purpose

To compare the performance of five compressed sensing (CS) algorithms-spatiotemporal finite differences (STFD), exponential dictionary (EXP), 3D-wavelet transform (WAV), low-rank (LOW) and low-rank plus sparse model with spatial finite differences (L + S SFD)-for 3D-T_1ρ mapping of the human brain with acceleration factors (AFs) of 2, 5, and 10.

Study type

Retrospective.

Subjects

Eight healthy volunteers underwent T_1ρ imaging of the whole brain.

Field strength/sequence

The sequence was fully sampled 3D Cartesian ultrafast gradient echo sequence with a customized T_1ρ preparation module on a clinical 3T scanner.

Assessment

The fully sampled data was undersampled by factors of 2, 5, and 10 and reconstructed with the five CS algorithms. Image reconstruction quality was evaluated and compared to the SENSE reconstruction of the fully sampled data (reference) and T_1ρ estimation errors were assessed as a function of AF.

Statistical tests

Normalized root mean squared errors (nRMSE) and median normalized absolute deviation (MNAD) errors were calculated to compare image reconstruction errors and T_1ρ estimation errors, respectively. Linear regression plots, Bland-Altman plots, and Pearson correlation coefficients (CC) are shown.

Results

For image reconstruction quality, at AF = 2, EXP transforms had the lowest mRMSE (1.56%). At higher AF values, STFD performed better, with the smallest errors (3.16% at AF = 5, 4.32% at AF = 10). For whole-brain quantitative T_1ρ mapping, at AF = 2, EXP performed best (MNAD error = 1.62%). At higher AF values (AF = 5, 10), the STFD technique had the least errors (2.96% at AF = 5, 4.24% at AF = 10) and the smallest variance from the reference T_1ρ estimates.

Data conclusion

This study demonstrates the use of different CS algorithms that may be useful in reducing the scan time required to perform volumetric T_1ρ mapping of the brain.

Level of evidence

Technical efficacy stage

SUBMITTER: Menon RG

PROVIDER: S-EPMC8204726 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Similar Datasets

Project description:BackgroundFast and accurate T1ρ mapping in myocardium is still a major challenge, particularly in small animal models. The complex sequence design owing to electrocardiogram and respiratory gating leads to quantification errors in in vivo experiments, due to variations of the T1ρ relaxation pathway. In this study, we present an improved quantification method for T1ρ using a newly derived formalism of a T1ρ* relaxation pathway.MethodsThe new signal equation was derived by solving a recursion problem for spin-lock prepared fast gradient echo readouts. Based on Bloch simulations, we compared quantification errors using the common monoexponential model and our corrected model. The method was validated in phantom experiments and tested in vivo for myocardial T1ρ mapping in mice. Here, the impact of the breath dependent spin recovery time Trec on the quantification results was examined in detail.ResultsSimulations indicate that a correction is necessary, since systematically underestimated values are measured under in vivo conditions. In the phantom study, the mean quantification error could be reduced from - 7.4% to - 0.97%. In vivo, a correlation of uncorrected T1ρ with the respiratory cycle was observed. Using the newly derived correction method, this correlation was significantly reduced from r = 0.708 (p < 0.001) to r = 0.204 and the standard deviation of left ventricular T1ρ values in different animals was reduced by at least 39%.ConclusionThe suggested quantification formalism enables fast and precise myocardial T1ρ quantification for small animals during free breathing and can improve the comparability of study results. Our new technique offers a reasonable tool for assessing myocardial diseases, since pathologies that cause a change in heart or breathing rates do not lead to systematic misinterpretations. Besides, the derived signal equation can be used for sequence optimization or for subsequent correction of prior study results.

Project description:Prior image constrained compressed sensing (PICCS) is an image reconstruction framework which incorporates an often available prior image into the compressed sensing objective function. The images are reconstructed using an optimization procedure. In this paper, several alternative unconstrained minimization methods are used to implement PICCS. The purpose is to study and compare the performance of each implementation, as well as to evaluate the performance of the PICCS objective function with respect to image quality.Six different minimization methods are investigated with respect to convergence speed and reconstruction accuracy. These minimization methods include the steepest descent (SD) method and the conjugate gradient (CG) method. These algorithms require a line search to be performed. Thus, for each minimization algorithm, two line searching algorithms are evaluated: a backtracking (BT) line search and a fast Newton-Raphson (NR) line search. The relative root mean square error is used to evaluate the reconstruction accuracy. The algorithm that offers the best convergence speed is used to study the performance of PICCS with respect to the prior image parameter α and the data consistency parameter λ. PICCS is studied in terms of reconstruction accuracy, low-contrast spatial resolution, and noise characteristics. A numerical phantom was simulated and an animal model was scanned using a multirow detector computed tomography (CT) scanner to yield the projection datasets used in this study.For λ within a broad range, the CG method with Fletcher-Reeves formula and NR line search offers the fastest convergence for an equal level of reconstruction accuracy. Using this minimization method, the reconstruction accuracy of PICCS was studied with respect to variations in α and λ. When the number of view angles is varied between 107, 80, 64, 40, 20, and 16, the relative root mean square error reaches a minimum value for α ≈ 0.5. For values of α near the optimal value, the spatial resolution of the reconstructed image remains relatively constant and the noise texture is very similar to that of the prior image, which was reconstructed using the filtered backprojection (FBP) algorithm.Regarding the performance of the minimization methods, the nonlinear CG method with NR line search yields the best convergence speed. Regarding the performance of the PICCS image reconstruction, three main conclusions can be reached. (1) The performance of PICCS is optimal when the weighting parameter of the prior image parameter is selected to be near α = 0.5. (2) The spatial resolution measured for static objects in images reconstructed using PICCS from undersampled datasets is not degraded with respect to the fully-sampled reconstruction for α near its optimal value. (3) The noise texture of PICCS reconstructions is similar to that of the prior image, which was reconstructed using the conventional FBP method.

Dataset Information

Performance Comparison of Compressed Sensing Algorithms for Accelerating T_1ρ Mapping of Human Brain.

Background

Purpose

Study type

Subjects

Field strength/sequence

Assessment

Statistical tests

Results

Data conclusion

Level of evidence

Technical efficacy stage

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets

Dataset Information

Performance Comparison of Compressed Sensing Algorithms for Accelerating T1ρ Mapping of Human Brain.

Background

Purpose

Study type

Subjects

Field strength/sequence

Assessment

Statistical tests

Results

Data conclusion

Level of evidence

Technical efficacy stage

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets

Performance Comparison of Compressed Sensing Algorithms for Accelerating T_1ρ Mapping of Human Brain.