PubMed Health⌕ Search

PubMed · 11969330

Image distortion correction in fMRI: A quantitative evaluation.

Abstract

A well-recognized problem with the echo-planar imaging (EPI) technique most commonly used for functional magnetic resonance imaging (fMRI) studies is geometric distortion caused by magnetic field inhomogeneity. This makes it difficult to achieve an accurate registration between a functional activation map calculated from an EPI time series and an undistorted, high resolution anatomical image. A correction method based on mapping the spatial distribution of field inhomogeneities can be used to reduce these distortions. This approach is attractive in its simplicity but requires postprocessing to improve the robustness of the acquired field map and reduce any secondary artifacts. Furthermore, the distribution of the internal magnetic field throughout the head is position dependent resulting in an interaction between distortion and head motion. Therefore, a single field map may not be sufficient to correct for the distortions throughout a whole fMRI time series. In this paper we present a quantitative evaluation of image distortion correction for fMRI at 2T. We assess (i) methods for the acquisition and calculation of field maps, (ii) the effect of image distortion correction on the coregistration between anatomical and functional images, and (iii) the interaction between distortion and head motion, assessing the feasibility of using field maps to reduce this effect. We propose that field maps with acceptable noise levels can be generated easily using a dual echo-time EPI sequence and demonstrate the importance of distortion correction for anatomical coregistration, even for small distortions. Using a dual echo-time series to generate a unique field map at each time point, we characterize the interaction between head motion and geometric distortion. However, we suggest that the variance between successively measured field maps introduces additional unwanted variance in the voxel time-series and is therefore not adequate to correct for time-varying distortions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chloe Hutton, Andreas Bork, Oliver Josephs, Ralf Deichmann, John Ashburner, Robert Turner. 2002. Image distortion correction in fMRI: A quantitative evaluation.. https://doi.org/10.1006/nimg.2001.1054

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↗