Direct reconstruction of cardiac PET kinetic parametric images using a preconditioned conjugate gradient approach.
Ontology highlight
ABSTRACT:
SUBMITTER: Rakvongthai Y
PROVIDER: S-EPMC3779266 | biostudies-other | 2013 Oct
REPOSITORIES: biostudies-other
Similar Datasets
Project description:PurposeCardiac perfusion PET data can be reconstructed as a dynamic sequence and kinetic modeling performed to quantify myocardial blood flow, or reconstructed as static gated images to quantify function. Parametric images from dynamic PET are conventionally not gated, to allow use of all events with lower noise. An alternative method for dynamic PET is to incorporate the kinetic model into the reconstruction algorithm itself, bypassing the generation of a time series of emission images and directly producing parametric images. So-called "direct reconstruction" can produce parametric images with lower noise than the conventional method because the noise distribution is more easily modeled in projection space than in image space. In this work, we develop direct reconstruction of cardiac-gated parametric images for 82 Rb PET with an extension of the Parametric Motion compensation OSEM List mode Algorithm for Resolution-recovery reconstruction for the one tissue model (PMOLAR-1T).MethodsPMOLAR-1T was extended to accommodate model terms to account for spillover from the left and right ventricles into the myocardium. The algorithm was evaluated on a 4D simulated 82 Rb dataset, including a perfusion defect, as well as a human 82 Rb list mode acquisition. The simulated list mode was subsampled into replicates, each with counts comparable to one gate of a gated acquisition. Parametric images were produced by the indirect (separate reconstructions and modeling) and direct methods for each of eight low-count and eight normal-count replicates of the simulated data, and each of eight cardiac gates for the human data. For the direct method, two initialization schemes were tested: uniform initialization, and initialization with the filtered iteration 1 result of the indirect method. For the human dataset, event-by-event respiratory motion compensation was included. The indirect and direct methods were compared for the simulated dataset in terms of bias and coefficient of variation as a function of iteration.ResultsConvergence of direct reconstruction was slow with uniform initialization; lower bias was achieved in fewer iterations by initializing with the filtered indirect iteration 1 images. For most parameters and regions evaluated, the direct method achieved the same or lower absolute bias at matched iteration as the indirect method, with 23%-65% lower noise. Additionally, the direct method gave better contrast between the perfusion defect and surrounding normal tissue than the indirect method. Gated parametric images from the human dataset had comparable relative performance of indirect and direct, in terms of mean parameter values per iteration. Changes in myocardial wall thickness and blood pool size across gates were readily visible in the gated parametric images, with higher contrast between myocardium and left ventricle blood pool in parametric images than gated SUV images.ConclusionsDirect reconstruction can produce parametric images with less noise than the indirect method, opening the potential utility of gated parametric imaging for perfusion PET.
| S-EPMC5807225 | biostudies-literature
Project description:Receptor ligand-based dynamic Positron Emission Tomography (PET) permits the measurement of neurotransmitter release in the human brain. For single-scan paradigms, the conventional method of estimating changes in neurotransmitter levels relies on fitting a pharmacokinetic model to activity concentration histories extracted after PET image reconstruction. However, due to the statistical fluctuations of activity concentration data at the voxel scale, parametric images computed using this approach often exhibit low signal-to-noise ratio, impeding characterization of neurotransmitter release. Numerous studies have shown that direct parametric reconstruction (DPR) approaches, which combine image reconstruction and kinetic analysis in a unified framework, can improve the signal-to-noise ratio of parametric mapping. However, there is little experience with DPR in imaging of neurotransmission and the performance of the approach in this application has not been evaluated before in humans. In this report, we present and evaluate a DPR methodology that computes 3-D distributions of ligand transport, binding potential (BPND) and neurotransmitter release magnitude (γ) from a dynamic sequence of PET sinograms. The technique employs the linear simplified reference region model (LSRRM) of Alpert et al. (2003), which represents an extension of the simplified reference region model that incorporates time-varying binding parameters due to radioligand displacement by release of neurotransmitter. Estimation of parametric images is performed by gradient-based optimization of a Poisson log-likelihood function incorporating LSRRM kinetics and accounting for the effects of head movement, attenuation, detector sensitivity, random and scattered coincidences. A 11C-raclopride simulation study showed that the proposed approach substantially reduces the bias and variance of voxel-wise γ estimates as compared to standard methods. Moreover, simulations showed that detection of release could be made more reliable and/or conducted using a smaller sample size using the proposed DPR estimator. Likewise, images of BPND computed using DPR had substantially improved bias and variance properties. Application of the method in human subjects was demonstrated using 11C-raclopride dynamic scans and a reward task, confirming the improved quality of the estimated parametric images using the proposed approach.
| S-EPMC7800040 | biostudies-literature
Project description:Recently introduced stationary dedicated cardiac SPECT scanners provide new opportunities to quantify myocardial blood flow (MBF) using dynamic SPECT. However, comparing to PET, the low sensitivity of SPECT scanners affects MBF quantification due to the high noise level, especially for 201 Thallium (201Tl) due to its typically low injected dose. The conventional indirect method for generating parametric images typically starts by reconstructing a time series of frame images followed by fitting the time-activity curve (TAC) for each voxel or segment with an appropriate kinetic model. The indirect method is simple and easy to implement; however, it usually suffers from substantial image noise that could also lead to bias. In this paper, we developed a list mode direct parametric image reconstruction algorithm to substantially reduce noise in MBF quantification using dynamic SPECT and allow for patient radiation dose reduction. GPU-based parallel computing was used to achieve more than 2000-fold acceleration. The proposed method was evaluated in both simulation and in vivo canine studies. Compared with the indirect method, the proposed direct method achieved substantially lower image noise and variability, particularly at large number of iterations and at low-count levels.
| S-EPMC7030971 | biostudies-literature
Project description:Parametric images for dynamic positron emission tomography (PET) are typically generated by an indirect method, i.e. reconstructing a time series of emission images, then fitting a kinetic model to each voxel time activity curve. Alternatively, 'direct reconstruction', incorporates the kinetic model into the reconstruction algorithm itself, directly producing parametric images from projection data. Direct reconstruction has been shown to achieve parametric images with lower standard error than the indirect method. Here, we present direct reconstruction for brain PET using event-by-event motion correction of list-mode data, applied to two tracers. Event-by-event motion correction was implemented for direct reconstruction in the Parametric Motion-compensation OSEM List-mode Algorithm for Resolution-recovery reconstruction. The direct implementation was tested on simulated and human datasets with tracers [11C]AFM (serotonin transporter) and [11C]UCB-J (synaptic density), which follow the 1-tissue compartment model. Rigid head motion was tracked with the Vicra system. Parametric images of K 1 and distribution volume (V T??=??K 1/k 2) were compared to those generated by the indirect method by regional coefficient of variation (CoV). Performance across count levels was assessed using sub-sampled datasets. For simulated and real datasets at high counts, the two methods estimated K 1 and V T with comparable accuracy. At lower count levels, the direct method was substantially more robust to outliers than the indirect method. Compared to the indirect method, direct reconstruction reduced regional K 1 CoV by 35-48% (simulated dataset), 39-43% ([11C]AFM dataset) and 30-36% ([11C]UCB-J dataset) across count levels (averaged over regions at matched iteration); V T CoV was reduced by 51-58%, 54-60% and 30-46%, respectively. Motion correction played an important role in the dataset with larger motion: correction increased regional V T by 51% on average in the [11C]UCB-J dataset. Direct reconstruction of dynamic brain PET with event-by-event motion correction is achievable and dramatically more robust to noise in V T images than the indirect method.
| S-EPMC5783541 | biostudies-literature
Project description:The linear parametric neurotransmitter positron emission tomography (lp-ntPET) kinetic model can be used to detect transient changes (activation) in endogenous neurotransmitter levels. Preclinical PET scans in awake animals can be performed to investigate neurotransmitter transient changes. Here we use the spatiotemporal kernel reconstruction (Kernel) for noise reduction in dynamic PET, and lp-ntPET kinetic modeling. Kernel is adapted for motion correction reconstruction, applied in awake rat PET scans. We performed 2D rat brain phantom simulation using the ntPET model at 3 different noise levels. Data was reconstructed with independent frame reconstruction (IFR), IFR with HYPR denoising, and Kernel, and lp-ntPET kinetic parameters (k 2a : efflux rate, γ: activation magnitude, t d : activation onset time, and t p : activation peak time) were calculated. Additionally, significant activation magnitude (γ) difference with respect to a region with no activation (rest) was calculated. Finally, [11C]raclopride experiments were performed in anesthetized and awake rats, injecting cold raclopride at 20 min after scan start to simulate endogenous neurotransmitter release. For simulated data at the regional level, IFR coefficient of variation (COV) of k 2a , γ, t d and t p was reduced with HYPR denoising, but Kernel showed the lowest COV (2 fold reduction compared with IFR). At the pixel level the same trend is observed for k 2a , γ, t d and t p COV, but reduction is larger with Kernel compared with IFR (10-14 fold). Bias in γ with respect with noise-free values was additionally reduced using Kernel (difference of 292, 72.4, and -6.92% for IFR, IFR+KYPR, and Kernel, respectively). Significant difference in activation between the rest and active region could be detected at a simulated activation of 160% for IFR and IFR+HYPR, and of 120% for Kernel. In rat experiments, lp-ntPET parameters have better confidence intervals using Kernel. In the γ, and t d parametric maps, the striatum structure can be identified with Kernel but not with IFR. Striatum voxel-wise γ, t d and t p values have lower variability using Kernel compared with IFR and IFR+HYPR. The spatiotemporal kernel reconstruction adapted for motion correction reconstruction allows to improve lp-ntPET kinetic modeling noise in awake rat studies, as well as detection of subtle neurotransmitter activations.
| S-EPMC9133502 | biostudies-literature
Project description:BackgroundThe single-step single nucleotide polymorphism best linear unbiased prediction (ssSNPBLUP) method, such as single-step genomic BLUP (ssGBLUP), simultaneously analyses phenotypic, pedigree, and genomic information of genotyped and non-genotyped animals. In contrast to ssGBLUP, SNP effects are fitted explicitly as random effects in the ssSNPBLUP model. Similarly, principal components associated with the genomic information can be fitted explicitly as random effects in a single-step principal component BLUP (ssPCBLUP) model to remove noise in genomic information. Single-step genomic BLUP is solved efficiently by using the preconditioned conjugate gradient (PCG) method. Unfortunately, convergence issues have been reported when solving ssSNPBLUP by using PCG. Poor convergence may be linked with poor spectral condition numbers of the preconditioned coefficient matrices of ssSNPBLUP. These condition numbers, and thus convergence, could be improved through the deflated PCG (DPCG) method, which is a two-level PCG method for ill-conditioned linear systems. Therefore, the first aim of this study was to compare the properties of the preconditioned coefficient matrices of ssGBLUP and ssSNPBLUP, and to document convergence patterns that are obtained with the PCG method. The second aim was to implement and test the efficiency of a DPCG method for solving ssSNPBLUP and ssPCBLUP.ResultsFor two dairy cattle datasets, the smallest eigenvalues obtained for ssSNPBLUP (ssPCBLUP) and ssGBLUP, both solved with the PCG method, were similar. However, the largest eigenvalues obtained for ssSNPBLUP and ssPCBLUP were larger than those for ssGBLUP, which resulted in larger condition numbers and in slow convergence for both systems solved by the PCG method. Different implementations of the DPCG method led to smaller condition numbers, and faster convergence for ssSNPBLUP and for ssPCBLUP, by deflating the largest unfavourable eigenvalues.ConclusionsPoor convergence of ssSNPBLUP and ssPCBLUP when solved by the PCG method are related to larger eigenvalues and larger condition numbers in comparison to ssGBLUP. These convergence issues were solved with a DPCG method that annihilates the effect of the largest unfavourable eigenvalues of the preconditioned coefficient matrix of ssSNPBLUP and of ssPCBLUP on the convergence of the PCG method. It resulted in a convergence pattern, at least, similar to that of ssGBLUP.
| S-EPMC6215606 | biostudies-literature
Project description:Cardiosphere-derived cells (CDCs) are progenitor cells derived from heart tissue and have shown promising results in preclinical models. APOSEC, the secretome of irradiated peripheral blood mononuclear cells, has decreased infarct size in acute and chronic experimental myocardial infarction (MI). We enhanced the effect of CDCs with APOSEC preconditioning (apoCDC) and investigated the reparative effect in a translational pig model of reperfused MI. Supernatants of CDCs, assessed by proteomic analysis, revealed reduced production of extracellular matrix proteins after in vitro APOSEC preconditioning. In a porcine model of catheter-based reperfused anterior acute MI (AMI), CDCs with (apoCDC, n = 8) or without APOSEC preconditioning (CDC, n = 6) were infused intracoronary, 15 min after the start of reperfusion. Untreated AMI animals (n = 7) and sham procedures (n = 5) functioned as controls. 2-deoxy-2-(18 F)-fluoro-D-glucose-positron emission tomography-magnetic resonance imaging ([18F]FDG-PET-MRI), with late enhancement after 1 month, showed reduced scar volume and lower transmurality of the infarcted area in CDC and apoCDC compared to AMI controls. Segmental quantitative PET images displayed indicated more residual viability in apoCDC. The left-ventricle (LV) ejection fraction was improved nonsignificantly to 45.8% ± 8.6% for apoCDC and 43.5% ± 7.1% for CDCs compared to 38.5% ± 4.4% for untreated AMI. Quantitative hybrid [18F]FDG-PET-MRI demonstrated improved metabolic and functional recovery after CDC administration, whereas apoCDCs induced preservation of viability of the infarcted area.
| S-EPMC7341058 | biostudies-literature
Project description:BackgroundThe single-step single nucleotide polymorphism best linear unbiased prediction (ssSNPBLUP) is one of the single-step evaluations that enable a simultaneous analysis of phenotypic and pedigree information of genotyped and non-genotyped animals with a large number of genotypes. The aim of this study was to develop and illustrate several computational strategies to efficiently solve different ssSNPBLUP systems with a large number of genotypes on current computers.ResultsThe different developed strategies were based on simplified computations of some terms of the preconditioner, and on splitting the coefficient matrix of the different ssSNPBLUP systems into multiple parts to perform its multiplication by a vector more efficiently. Some matrices were computed explicitly and stored in memory (e.g. the inverse of the pedigree relationship matrix), or were stored using a compressed form (e.g. the Plink 1 binary form for the genotype matrix), to permit the use of efficient parallel procedures while limiting the required amount of memory. The developed strategies were tested on a bivariate genetic evaluation for livability of calves for the Netherlands and the Flemish region in Belgium. There were 29,885,286 animals in the pedigree, 25,184,654 calf records, and 131,189 genotyped animals. The ssSNPBLUP system required around 18 GB Random Access Memory and 12 h to be solved with the most performing implementation.ConclusionsBased on our proposed approaches and results, we showed that ssSNPBLUP provides a feasible approach in terms of memory and time requirements to estimate genomic breeding values using current computers.
| S-EPMC7222437 | biostudies-literature
Project description:In a modern observational study based on healthcare databases, the number of observations and of predictors typically range in the order of 105-106 and of 104-105. Despite the large sample size, data rarely provide sufficient information to reliably estimate such a large number of parameters. Sparse regression techniques provide potential solutions, one notable approach being the Bayesian method based on shrinkage priors. In the "large n and large p" setting, however, the required posterior computation encounters a bottleneck at repeated sampling from a high-dimensional Gaussian distribution, whose precision matrix Φ is expensive to compute and factorize. In this article, we present a novel algorithm to speed up this bottleneck based on the following observation: We can cheaply generate a random vector b such that the solution to the linear system Φβ = b has the desired Gaussian distribution. We can then solve the linear system by the conjugate gradient (CG) algorithm through matrix-vector multiplications by Φ; this involves no explicit factorization or calculation of Φ itself. Rapid convergence of CG in this context is guaranteed by the theory of prior-preconditioning we develop. We apply our algorithm to a clinically relevant large-scale observational study with n = 72,489 patients and p = 22,175 clinical covariates, designed to assess the relative risk of adverse events from two alternative blood anti-coagulants. Our algorithm demonstrates an order of magnitude speed-up in posterior inference, in our case cutting the computation time from two weeks to less than a day. Supplementary materials for this article are available online.
| S-EPMC10977663 | biostudies-literature
Project description:BACKGROUND:Reverse engineering of gene regulatory networks from time series gene-expression data is a challenging problem, not only because of the vast sets of candidate interactions but also due to the stochastic nature of gene expression. We limit our analysis to nonlinear differential equation based inference methods. In order to avoid the computational cost of large-scale simulations, a two-step Gaussian process interpolation based gradient matching approach has been proposed to solve differential equations approximately. RESULTS:We apply a gradient matching inference approach to a large number of candidate models, including parametric differential equations or their corresponding non-parametric representations, we evaluate the network inference performance under various settings for different inference objectives. We use model averaging, based on the Bayesian Information Criterion (BIC), to combine the different inferences. The performance of different inference approaches is evaluated using area under the precision-recall curves. CONCLUSIONS:We found that parametric methods can provide comparable, and often improved inference compared to non-parametric methods; the latter, however, require no kinetic information and are computationally more efficient.
| S-EPMC6346534 | biostudies-literature