Skip to content
naulon
Not checkedNot checked for notices yet.

Cross-Dataset Multiple Organ Segmentation From CT Imagery Using FBP-Derived Domain Adaptation

Jun Huang, Xue Li, Jing Wang and 5 more

IEEE Access · 2021

doi:10.1109/access.2021.3055803 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Multi-organ segmentation from whole-body computed tomography (CT) scans has gained increasing research interest over recent years. While the learning-based segmentation algorithm has lately achieved tremendous success, the need for detailed annotation of multiple organs further increases the manual burden. With a limited number of annotated volumetric datasets, it would be beneficial to apply the trained model from such a set to CT images acquired from other sites with different scanners. Nevertheless, the discrepancy among training and testing images significantly deteriorates segmentation performance. While there are many domain adaptation efforts, in this work we proposed a filtered back-projection based algorithm for performing domain adaptation for CT imagery. An optimal CT reconstruction kernel was obtained by minimizing the disparity between two images. Furthermore, since the Gaussian kernel is an eigen-function of the Fourier transformation, the adaptation computation was proven to be simple linear filtering. The proposed method was tested and compared with multiple methods to demonstrate improvement by employing such a model/theory-based adaptation approach. The proposed method, used in conjunction with a common convolutional neural network, such as the U-Net or V-Net, with or without the domain adaptation, achieves high accuracy in a multiple-organ segmentation task. Approximately 30% of data was used for training, 70% was used for testing, and an average dice of 0.88 was achieved in 8 organs.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.