GAN‐LSTM‐3D: An efficient method for lung tumour 3D reconstruction enhanced by attention‐based LSTM
Three‐dimensional (3D) image reconstruction of tumours can visualise their structures with precision and high resolution. In this article, GAN‐LSTM‐3D method is proposed for 3D reconstruction of lung cancer tumours from 2D CT images. Our method consists of three phases: lung segmentation, tumour seg...
Gespeichert in:
Veröffentlicht in: | CAAI Transactions on Intelligence Technology 2023-05 |
---|---|
Hauptverfasser: | , , , , , , , , , , , , |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Three‐dimensional (3D) image reconstruction of tumours can visualise their structures with precision and high resolution. In this article, GAN‐LSTM‐3D method is proposed for 3D reconstruction of lung cancer tumours from 2D CT images. Our method consists of three phases: lung segmentation, tumour segmentation, and tumour 3D reconstruction. Lung segmentation is done using snake optimisation followed by tumour segmentation using Gustafson‐Kessel (GK) clustering method. The outputs of GK (2D lung cancer images) are fed to a pre‐trained Visual Geometry Group (VGG) for feature extraction. The VGG outputs are used as input for an attention‐based LSTM which performs feature unpacking. The output of LSTM units is given to generator network of a Generative Adversarial Networks (GAN) model to carry out 3D reconstruction of (normal/cancerous) images with high quality. During training, the discriminator network of the GAN is used to judge the generator outputs. The authors to the best of their knowledge were the first to use GAN for 3D reconstruction of lung cancer tumours which is the primary contribution of this article. Moreover, existing studies are mostly focused on brain tumours and are not suitable for lung tumour reconstruction. Focusing on lung tumours is the second contribution of this article. Evaluation on LUNA data collection against existing methods like MC, MC + fairing etc. reveals the superiority of our method in terms of Hamming and Euclidean distance metrics. Additionally, the computational complexity of the proposed method is lower compared to evaluated methods. |
---|---|
ISSN: | 2468-2322 2468-2322 |
DOI: | 10.1049/cit2.12223 |