PubMed Health⌕ Search

PubMed · 9591599

Correction for partial volume effects in PET: principle and validation.

Abstract

UNLABELLED: The accuracy of PET for measuring regional radiotracer concentrations in the human brain is limited by the finite resolution capability of the scanner and the resulting partial volume effects (PVEs). We designed a new algorithm to correct for PVEs by characterizing the geometric interaction between the PET system and the brain activity distribution. METHODS: The partial volume correction (PVC) algorithm uses high-resolution volumetric MR images correlated with the PET volume. We used a PET simulator to calculate recovery and cross-contamination factors of identified tissue components in the brain model. These geometry-dependent transfer coefficients form a matrix representing the fraction of true activity from each distinct brain region observed in any given set of regions of interest. This matrix can be inverted to correct for PVEs, independent of the tracer concentrations in each tissue component. A sphere phantom was used to validate the simulated point-spread function of the PET scanner. Accuracy and precision of the PVC method were assessed using a human basal ganglia phantom. A constant contrast experiment was performed to explore the recovery capability and statistic error propagation of PVC in various noise conditions. In addition, a dual-isotope experiment was used to evaluate the ability of the PVC algorithm to recover activity concentrations in small structures surrounded by background activity with a different radioactive half-life. This models the time-variable contrast between regions that is often seen in neuroreceptor studies. RESULTS: Data from the three-dimensional brain phantom demonstrated a full recovery capability of PVC with less than 10% root mean-square error in terms of absolute values, which decreased to less than 2% when results from four PET slices were averaged. Inaccuracy in the estimation of 18F tracer half-life in the presence of 11C background activity was in the range of 25%-50% before PVC and 0%-6% after PVC, for resolution varying from 6 to 14 mm FWHM. In terms of noise propagation, the degradation of the coefficient of variation after PVC was found to be easily predictable and typically on the order of 25%. CONCLUSION: The PVC algorithm allows the correction for PVEs simultaneously in all identified brain regions, independent of tracer levels.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

O G Rousset, Y Ma, A C Evans. 1998. Correction for partial volume effects in PET: principle and validation.. https://pubmed.ncbi.nlm.nih.gov/9591599/

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

A note on a generalized single step theory for any number of hierarchical genomic matrices.

BACKGROUND: The Single Step algorithm allows combining information from genotyped and un-genotyped individuals, provided they are connected by a pedigree. However, current single step theory is limited to a single list of markers. RESULTS: We present a generalized single step (GSS) method that can accommodate any number of hierarchical molecular datasets (e.g. sequence, high and low density arrays) and pedigree, avoiding imputation. We prove that a similar efficient inversion algorithm exists. The method is recursive, starting with the highest marker density scenario. We illustrate the method with simulation and show that GSS can increase predictive accuracy compared to standard single step. R code is provided so that custom scenarios can be easily compared, either with simulated or real data. CONCLUSION: The method developed generalizes extant single step theory to any number of hierarchical molecular relationship matrices, broadening the scenarios where single step can be applied. A topic of particular interest can be ecology field data or human populations where pedigree is not available, but where samples sequenced and genotyped at different densities can exist. GSS can also be a useful tool to optimize allocation of genotyping and / or sequencing resources.

Algorithms↗

cgDist: Nucleotide-level distance calculation from cgMLST allelic profiles.

Bacterial genomic surveillance requires balancing computational efficiency with genetic resolution for effective cluster investigation. cgMLST distance calculations treat all allelic differences as equivalent units, obscuring nucleotide-level variation. Furthermore, single nucleotide polymorphism-based pipelines provide finer resolution at substantially higher computational cost, which limits their routine deployment in surveillance laboratories. We present cgDist, an algorithm that calculates nucleotide-level distances directly from cgMLST allelic profiles, providing finer resolution than allele-count distances by leveraging within-allele nucleotide variation. The cache architecture stores alignment statistics, enabling distance calculation modes without computation and supporting both dataset-specific and schema-complete cache generation. This design enables incremental surveillance analysis, with performance benefits as laboratories accumulate alignment data. cgDist functions as a precision 'zoom lens' for the investigation of clusters identified through initial cgMLST screening. Rather than restructuring population relationships, this targeted approach concentrates enhanced resolution where it is most informative. The algorithm ensures that cgDist distances are greater than or equal to corresponding cgMLST distances, preserving epidemiological interpretability while adding genetic discrimination. By increasing resolution within identified clusters, cgDist may also support outbreak investigation, a potential application that remains to be evaluated on outbreak-derived data.

Algorithms↗

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6× to 17.6× faster than POASTA, and 7.3× faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms↗