Algorithm and Structure of Parallelization of 3D Spline-Based Segmentation Processes of Glioblastoma MRI Images

Oybek  Mallayev; Fozila  Sulaymonova; Musayev  Fayzullaxon

Oybek Mallayev Professor of the Department of Digital Technologies, Alfraganus University, Uzbekistan.
Fozila Sulaymonova PhD student at the Department of Artificial Intelligence, TUIT, Uzbekistan.
Musayev Fayzullaxon 4th year student of the Faculty of Digital Technologies, Alfraganus University, Uzbekistan

Keywords: glioblastoma, MRI, 3D spline, segmentation, PyRadiomics, RandomForest, parallel computing, Otsu threshold, feature extraction, medical image processing

Abstract

Glioblastoma multiforme (GBM) is one of the most aggressive and common malignant brain tumors of the central nervous system. It is characterized by rapid infiltrative growth, heterogeneous structure, and unclear boundaries, which make accurate segmentation difficult. MRI (Magnetic Resonance Imaging) images are the main diagnostic tool in the diagnosis of glioblastoma, and the data obtained in 3D form allow for an accurate assessment of the size, shape, and structure of tumors. In this paper, glioblastoma segmentation based on 3D spline interpolation is performed, and the process is completed by feature extraction based on PyRadiomics and classification into types using the RandomForest classifier. As a major innovation, a parallelization algorithm accelerates the calculation of 3D spline points and the segmentation process.

During the research, pre-processing (normalization, noise reduction) of MRI volumetric data, automatic ROI (Region of Interest) segmentation using Otsu's method, and 3D contour drawing based on spline were performed. The parallel computing engine was created using Python's concurrent.futures module, and the feature extraction for each patient's MRI volume was performed in separate processes. The results showed that the computation time was approximately 4.3 times faster on 8 processor cores.

The proposed approach not only improved the segmentation accuracy (F1-score = 0.929), but also significantly improved the computational efficiency. This algorithm is suitable for application in medical diagnostic systems, especially in clinical applications requiring real-time operation.

Downloads

Download data is not yet available.

References

D. N. Louis et al., "The 2021 WHO Classification of Tumors of the Central Nervous System," Acta Neuropathol., 2021.

Q. T. Ostrom et al., "CBTRUS Statistical Report: Primary Brain Tumors in the US," Neuro Oncol., 2020.

F. Isensee et al., "nnU-Net: Self-Adapting Framework for Biomedical Image Segmentation," Nature Methods, 2021.

O. U. Mallayev and A. Urokov, "AD Model for detecting brain tumors using machine learning algorithms," Modern Science and Research, vol. 4, no. 7, pp. 449-456, 2025.

Buades et al., "A Non-Local Algorithm for Image Denoising," CVPR, 2005.

N. A. Otsu, "Threshold Selection Method from Gray-Level Histograms," IEEE TSMC, 1979.

M. Unser, "Splines: A Perfect Fit for Signal and Image Processing," IEEE Signal Processing Magazine, 1999.

Bartesaghi and G. Sapiro, "An Unconstrained Framework for 3D Shape Reconstruction," IJCV, 2006.

J. J. M. Van Griethuysen et al., "Computational Radiomics System to Decode Tumor Phenotype," Cancer Research, 2017.

L. Breiman, "Random Forests," Machine Learning, 2001.

Chaddad et al., "Radiomics in Glioblastoma: Current Status and Challenges," Front Oncol., 2019.

J. Dean and S. Ghemawat, "MapReduce: Simplified Data Processing on Large Clusters," OSDI, 2004.

G. M. Amdahl, "Validity of the Single Processor Approach to Achieving Large-Scale Computing Capabilities," AFIPS, 1967.

O. U. Mallayev, "Parallel algorithm for digital processing of medical images based on the parallelism paradigm," Innovation in Technology and Science Education Conference, vol. 2, no. 11, ISSN 2181-371X, 2024.

O. U. Mallayev, "Algorithm and Structure of Parallelization of 3D Spline-Based Segmentation Processes of Glioblastoma MRI Images," Innovation in Technology and Science Education Conference, vol. 2, no. 11, pp. 2181-371X, 2025.