Distortion correction using topup algorithm by single k-space (TASK) for echo planar imaging

Abstract Distortion of echo planar imaging (EPI) can be corrected using B0 field maps, which can be estimated with the topup algorithm that requires two EPI images with opposite distortions. In this study, we propose a new algorithm, termed topup algorithm by single K-space (TASK), to generate two i...

Full description

Bibliographic Details
Main Authors: Seon-Ha Hwang, Hyun-Soo Lee, Seung Hong Choi, Sung-Hong Park
Format: Article
Language:English
Published: Nature Portfolio 2023-10-01
Series:Scientific Reports
Online Access:https://doi.org/10.1038/s41598-023-46163-3
Description
Summary:Abstract Distortion of echo planar imaging (EPI) can be corrected using B0 field maps, which can be estimated with the topup algorithm that requires two EPI images with opposite distortions. In this study, we propose a new algorithm, termed topup algorithm by single K-space (TASK), to generate two input images from a single k-space for the topup algorithm to correct EPI distortions. The centric EPI contains the opposite phase-encoding polarities in one k-space, which can be divided into two halves with opposite distortions. Therefore, two inputs could be extracted by dividing the k-space into halves and processing them using the proposed procedure including an iterative procedure of automatic brain masking and uniformity correction. The efficiency of TASK was evaluated using 3D EPI. Quantitative evaluations showed that TASK corrected EPI distortion at a similar level to the traditional methods. The estimated field maps from the conventional topup and TASK showed a high correlation ( $$r=0.80\pm 0.05$$ r = 0.80 ± 0.05 ). An ablation study showed the validity of every suggested step. Furthermore, it was confirmed that TASK was effective for distortion correction of two-shot centric EPI as well, demonstrating its wider applicability. In conclusion, TASK can correct EPI distortions by its own single k-space information with no additional scan.
ISSN:2045-2322