A Machine Learning Approach to Perfusion Imaging With Dynamic Susceptibility Contrast MR
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 52879454X | ||
| 005 | 20181001030218.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 180925s2018 xx s 000 0 eng | ||
| 022 | |a 1664-2295 | ||
| 024 | 7 | 0 | |a 10.3389/fneur.2018.00717 |2 doi |
| 035 | |a (BORIS)oai:boris.unibe.ch:120084 | ||
| 084 | |a 610 |2 ddc | ||
| 091 | |a 30233482 |b pmid | ||
| 245 | 0 | 2 | |a A Machine Learning Approach to Perfusion Imaging With Dynamic Susceptibility Contrast MR |h [Elektronische Daten] |c [Richard McKinley, Fan Hung, Roland Wiest, David S Liebeskind, Fabien Scalzo] |
| 500 | |a publishedVersion | ||
| 506 | |a openAccess |2 eu-repo | ||
| 520 | 3 | |a Dynamic susceptibility contrast (DSC) MR perfusion is a frequently-used technique for neurovascular imaging. The progress of a bolus of contrast agent through the tissue of the brain is imaged via a series of T2-weighted MRI scans. Clinically relevant parameters such as blood flow and Tmax can be calculated by deconvolving the contrast-time curves with the bolus shape (arterial input function). In acute stroke, for instance, these parameters may help distinguish between the likely salvageable tissue and irreversibly damaged infarct core. Deconvolution typically relies on singular value decomposition (SVD): however, studies have shown that these algorithms are very sensitive to noise and artifacts present in the image and therefore may introduce distortions that influence the estimated output parameters. In this work, we present a machine learning approach to the estimation of perfusion parameters in DSC-MRI. Various machine learning models using as input the raw MR source data were trained to reproduce the output of an FDA approved commercial implementation of the SVD deconvolution algorithm. Experiments were conducted to determine the effect of training set size, optimal patch size, and the effect of using different machine-learning models for regression. Model performance increased with training set size, but after 5,000 samples (voxels) this effect was minimal. Models inferring perfusion maps from a 5 by 5 voxel patch outperformed models able to use the information in a single voxel, but larger patches led to worse performance. Random Forest models produced had the lowest root mean squared error, with neural networks performing second best: however, a phantom study revealed that the random forest was highly susceptible to noise levels, while the neural network was more robust. The machine learning-based approach produces estimates of the perfusion parameters invariant to the noise and artifacts that commonly occur as part of MR acquisition. As a result, better robustness to noise is obtained, when evaluated against the FDA approved software on acute stroke patients and simulated phantom data. | |
| 700 | 1 | |a McKinley |D Richard |e joint author | |
| 700 | 1 | |a Hung |D Fan |e joint author | |
| 700 | 1 | |a Wiest |D Roland |e joint author | |
| 700 | 1 | |a Liebeskind |D David S. |e joint author | |
| 700 | 1 | |a Scalzo |D Fabien |e joint author | |
| 773 | 0 | |t Frontiers in neurology |g 9(717), p. 717 |x 1664-2295 | |
| 856 | 4 | 0 | |u https://boris.unibe.ch/120084/1/fneur-09-00717.pdf |q text/html |z WWW-Backlink auf das Repository |
| 908 | |D 1 |a info:eu-repo/semantics/article |2 boris | ||
| 909 | 7 | |a PeerReviewed |2 boris peerstatus | |
| 950 | |B BORIS |P 856 |E 40 |u https://boris.unibe.ch/120084/1/fneur-09-00717.pdf |q text/html |z WWW-Backlink auf das Repository | ||
| 950 | |B BORIS |P 700 |E 1- |a McKinley |D Richard |e joint author | ||
| 950 | |B BORIS |P 700 |E 1- |a Hung |D Fan |e joint author | ||
| 950 | |B BORIS |P 700 |E 1- |a Wiest |D Roland |e joint author | ||
| 950 | |B BORIS |P 700 |E 1- |a Liebeskind |D David S. |e joint author | ||
| 950 | |B BORIS |P 700 |E 1- |a Scalzo |D Fabien |e joint author | ||
| 950 | |B BORIS |P 773 |E 0- |t Frontiers in neurology |g 9(717), p. 717 |x 1664-2295 | ||
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 949 | |B BORIS |F BORIS |b BORIS |j info:eu-repo/semantics/article |c openAccess | ||