1. Introduction
Brain tumor segmentation from magnetic resonance imaging (MRI) is a fundamental component of clinical workflows, supporting diagnosis, surgical planning, radiotherapy targeting, and longitudinal disease monitoring [
1,
2,
3]. Accurate delineation of tumor boundaries enables quantitative assessment of tumor volume, growth rate, and treatment response [
4]. However, manual segmentation remains time-consuming, labor-intensive, and subject to inter-observer variability [
5,
6]. These limitations motivate the development of automated and reliable segmentation frameworks.
Despite significant advances in deep learning, automated brain tumor segmentation remains challenging [
7]. Tumors exhibit substantial heterogeneity in size, shape, texture, and intensity distribution across patients [
3,
8]. Infiltrative tumor margins often appear diffuse and poorly defined, particularly in glioma cases [
9]. Moreover, MRI scans frequently contain noise artifacts, partial volume effects, and acquisition variability across scanners and imaging protocols [
10]. From a modeling perspective, these factors require segmentation architectures capable of simultaneously capturing large-scale contextual dependencies and preserving fine-grained spatial details. Achieving this balance between global semantic abstraction and local boundary precision remains a non-trivial problem.
Encoder–decoder convolutional neural networks have become the dominant paradigm for biomedical segmentation [
11,
12]. The introduction of U-Net [
13] established a powerful symmetric architecture that integrates deep semantic features with high-resolution spatial information via skip connections. Numerous extensions have been proposed, including residual U-Net, attention-based U-Net, and densely connected variants [
14,
15,
16,
17,
18]. While these approaches improve gradient flow and feature refinement, conventional U-Net architectures are inherently constrained by their receptive field size. As a result, modeling long-range spatial dependencies and large tumor structures may remain suboptimal.
To enhance global context modeling, multi-scale representation strategies have been introduced. Atrous (dilated) convolution expands the receptive field without reducing spatial resolution or increasing parameter count. DeepLab-based models incorporate Atrous Spatial Pyramid Pooling (ASPP) to aggregate multi-scale contextual features at different dilation rates [
15,
16,
19,
20]. Although such architectures demonstrate strong semantic representation capability, their simplified decoder structures may lead to insufficient boundary refinement, particularly in medical imaging tasks where precise delineation is critical.
Another line of research integrates pretrained classification backbones into segmentation frameworks. Networks such as VGG and ResNet have been embedded into U-Net architectures to leverage hierarchical feature representations learned from large-scale natural image datasets [
7,
21]. Pretrained encoders often improve convergence stability and generalization in limited medical datasets [
22,
23]. However, existing VGG-based U-Net implementations typically rely on standard symmetric decoders and do not explicitly incorporate advanced multi-scale context modeling modules [
24]. Conversely, DeepLab-style models emphasize context aggregation, but do not fully exploit intermediate hierarchical representations for boundary-sensitive refinement [
16].
Recent advancements in Transformer-based and state-space models have shown promising results in capturing long-range dependencies through self-attention and sequence modeling mechanisms [
25]. Architectures such as TransUNet [
26,
27], Swin-UNet [
28,
29], and emerging Mamba-based models [
30,
31] enable improved global context representation; however, their increased computational complexity and reliance on large-scale training data remain challenging for practical medical imaging applications, particularly in scenarios requiring precise boundary delineation and efficiency.
Therefore, a methodological gap persists: achieving an effective architectural integration that simultaneously (i) enlarges the receptive field to model heterogeneous tumor context, (ii) preserves intermediate spatial representations for boundary accuracy, and (iii) maintains computational efficiency suitable for practical deployment. Existing models tend to prioritize either contextual abstraction or spatial detail, but rarely optimize both in a unified and explicitly structured manner.
To address this gap, we propose a Multi-Scale Atrous Feature Fusion framework grounded in a VGG19-UNet encoder architecture. The proposed method first constructs a VGG19-UNet to expose hierarchical encoder feature maps across multiple representation depths. Deep semantic representations extracted from the encoder bottleneck are enhanced using an Atrous Spatial Pyramid Pooling (ASPP) module to capture multi-scale contextual dependencies without additional downsampling. In parallel, intermediate encoder features are projected through a lightweight low-level feature (LLF) refinement branch to preserve boundary-sensitive spatial information. Unlike conventional symmetric decoder designs, the proposed architecture restructures the segmentation head by explicitly fusing ASPP-enhanced global features with refined intermediate representations, followed by compact convolutional refinement and full-resolution reconstruction. This decoupled design enables the network to balance receptive field expansion and spatial precision within a computationally efficient framework. By leveraging hierarchical encoder representations rather than relying solely on standard decoder pathways, the proposed approach differentiates itself from both classical U-Net variants and DeepLab-based segmentation models.
The main contributions of this work are summarized as follows:
We construct a VGG19-UNet encoder framework that exposes hierarchical multi-level feature representations tailored for brain tumor segmentation.
We integrate an Atrous Spatial Pyramid Pooling module at the encoder bottleneck to enhance multi-scale contextual modeling without excessive parameter growth.
We introduce a low-level feature refinement branch that preserves intermediate spatial information and improves tumor boundary delineation.
We propose a structured feature fusion mechanism that explicitly balances global semantic abstraction and spatial detail preservation within a compact reconstruction head.
We conduct a comprehensive experimental evaluation, including ablation studies, cross-dataset validation, and statistical analysis, to demonstrate the effectiveness and robustness of the proposed architecture.
The remainder of this paper is organized as follows.
Section 2 reviews related work in convolutional neural network-based brain tumor segmentation, pretrained encoder integration, and multi-scale context modeling.
Section 3 describes the datasets, the preprocessing procedures and the detailed architecture of the proposed method.
Section 4 presents the experimental setup and quantitative results, including ablation and statistical analyses.
Section 5 discusses the findings, computational efficiency considerations, limitations, and clinical implications. Finally,
Section 6 concludes the paper and outlines directions for future research.
2. Related Work
This section reviews existing approaches to brain tumor segmentation, with emphasis on encoder–decoder architectures, pretrained backbone integration, and multi-scale context modeling. We analyze methodological limitations to highlight the research gap addressed by the proposed framework.
2.1. Encoder–Decoder CNN Architectures
Encoder–decoder convolutional neural networks represent the dominant paradigm in medical image segmentation. U-Net [
13] introduced symmetric skip connections that merge low-level spatial features with deep semantic representations, enabling precise localization. Subsequent extensions, including residual U-Net, dense U-Net, and attention U-Net [
14,
15,
16,
17,
18], have focused on improving gradient flow, feature reuse, and adaptive weighting of salient regions.
Despite these improvements, conventional U-Net architectures exhibit two structural limitations. First, progressive downsampling reduces spatial resolution and limits the effective receptive field, potentially hindering accurate modeling of large or heterogeneous tumor structures [
32]. Second, contextual modeling is implicitly achieved through stacked convolutions rather than explicitly designed multi-scale mechanisms [
33,
34]. As a result, the balance between global semantic abstraction and boundary precision remains suboptimal.
2.2. Pretrained Encoder-Based U-Net Variants
To improve feature robustness and generalization, pretrained classification backbones such as VGG, ResNet, and EfficientNet have been incorporated into U-Net frameworks [
35,
36,
37]. Pretraining on large-scale natural image datasets improves convergence stability and strengthens hierarchical representation learning.
However, most pretrained U-Net variants retain the conventional symmetric decoder without structural modification [
34]. While the encoder becomes more powerful, the architecture does not fundamentally expand its receptive field beyond the inherent convolutional depth [
38,
39]. Consequently, pretrained VGG-based U-Net models improve representation robustness but do not explicitly address multi-scale contextual dependency modeling [
40]. Furthermore, decoder pathways remain heavy and symmetric, potentially increasing computational overhead without proportional gains in context awareness [
41].
2.3. Multi-Scale Context Modeling and DeepLab-Based Approaches
Multi-scale representation strategies have been widely explored to overcome limited receptive field constraints. Atrous convolution enlarges the receptive field while maintaining spatial resolution. DeepLab-based architectures incorporate Atrous Spatial Pyramid Pooling (ASPP) to aggregate contextual information at multiple dilation rates [
20,
42]. Feature Pyramid Networks (FPN) and pyramid pooling modules similarly aim to integrate hierarchical multi-scale cues [
16,
43,
44].
Although DeepLab-style models demonstrate strong performance in natural image segmentation [
42,
45], their direct application to medical imaging presents challenges. First, simplified decoder structures may inadequately recover fine tumor boundaries, which are critical in clinical practice. Second, aggressive multi-scale aggregation may oversmooth small tumor subregions. Third, some multi-scale frameworks significantly increase computational complexity, limiting their practicality in resource-constrained environments [
1,
46,
47].
2.4. Hybrid Multi-Scale and Boundary-Aware Segmentation Models
Recent studies attempt to combine context modeling with boundary refinement mechanisms. Attention-based multi-scale networks and dual-branch architectures have been proposed to capture complementary features [
17,
48]. However, many of these designs introduce additional parameters or complex attention modules, increasing the size of the model and the training instability [
48,
49]. Moreover, the integration of multi-scale modules with pretrained encoder hierarchies is often performed without explicitly leveraging intermediate feature representations for structured fusion.
2.5. Transformer and State-Space-Based Segmentation Models
Recent advances in medical image segmentation have increasingly explored Transformer-based architectures to address the limitations of convolutional neural networks in modeling long-range dependencies. Transformer-based models such as TransUNet [
26,
27], UNETR [
50,
51], and Swin-UNet [
28,
29] integrate self-attention mechanisms to capture global contextual relationships across the entire image. These approaches have demonstrated improved performance in complex segmentation tasks by enhancing the representation of spatially distant but semantically related regions.
Despite their strong contextual modeling capability, Transformer-based architectures introduce several challenges [
52]. First, self-attention mechanisms significantly increase computational complexity, particularly for high-resolution medical images. Second, Transformers often require large-scale training data to achieve stable convergence, which is not always available in medical imaging domains. Third, the absence of strong inductive biases inherent in convolutional operations may reduce their effectiveness in capturing fine-grained boundary details, which are critical for precise tumor delineation.
More recently, state-space and Mamba-based models have emerged as an alternative paradigm for sequence and spatial modeling [
25,
30]. These approaches aim to combine the long-range dependency modeling of Transformers with improved computational efficiency. In medical image segmentation, early studies on Mamba-based architectures have demonstrated promising results by enabling linear complexity scaling and efficient global feature aggregation. However, these methods remain relatively new and are still being actively explored, with limited validation across diverse medical datasets.
In contrast to Transformer and Mamba-based approaches, the proposed framework adopts a convolutional architecture enhanced with explicit multi-scale contextual modeling and structured feature fusion. By integrating Atrous Spatial Pyramid Pooling with a VGG19-UNet encoder and a low-level feature refinement branch, the proposed method achieves effective global context aggregation while preserving boundary-sensitive spatial information. This design maintains computational efficiency and stability, making it particularly suitable for medical image segmentation tasks with limited data and strict precision requirements.
2.6. Identified Research Gap
From the above analysis, three primary limitations emerge:
- 1.
Conventional U-Net and pretrained VGG-based U-Net models enhance representation strength but lack explicit multi-scale receptive field expansion.
- 2.
DeepLab-style architectures improve contextual modeling but may compromise boundary precision due to simplified decoder pathways.
- 3.
Existing hybrid models often increase architectural complexity without systematically balancing semantic context and spatial refinement.
Therefore, a methodological gap remains in designing a segmentation framework that simultaneously:
Expands the receptive field for heterogeneous tumor context modeling,
Preserves intermediate spatial representations for boundary-sensitive refinement,
Maintains computational efficiency suitable for clinical deployment.
The proposed framework addresses this gap by restructuring the segmentation head of a VGG19-UNet encoder. Deep bottleneck representations are enhanced via Atrous Spatial Pyramid Pooling for multi-scale context aggregation, while intermediate encoder features are explicitly projected through a low-level refinement branch. The structured fusion of ASPP-enhanced semantic features with boundary-sensitive intermediate representations enables balanced contextual abstraction and spatial precision within a compact reconstruction design. This architectural strategy differentiates the proposed method from conventional U-Net variants and standard DeepLab-based models.
3. Materials and Methods
This section describes the datasets, preprocessing procedures, proposed architecture, and optimization strategy in a mathematically formal manner.
3.1. Datasets
To comprehensively evaluate the robustness and generalization capability of the proposed framework, experiments are conducted on three benchmark datasets: the Figshare Brain Tumor Segmentation (FBTS) dataset, BraTS 2021, and BraTS 2018. All experiments are performed using 2D axial slices extracted from MRI volumes to maintain architectural consistency across datasets.
Figure 1 presents representative samples from:
BraTS 2018 including High-Grade Glioma (HGG) and Low-Grade Glioma (LGG) cases [
55,
56,
57].
3.1.1. Figshare Brain Tumor Segmentation (FBTS)
The FBTS dataset contains 3064 contrast-enhanced T1-weighted 2D MRI slices categorized into three tumor types: Meningioma, Glioma, and Pituitary. Each slice is paired with a manually annotated binary tumor mask.
The dataset is defined as in Equation (
1).
where:
denotes a grayscale MRI slice,
denotes the corresponding tumor mask.
To accommodate pretrained VGG-based encoders requiring three-channel input, grayscale images are replicated across channels (Equation (
2)).
such that
.
As illustrated in
Figure 1a, the three tumor categories exhibit substantial morphological variability, making FBTS suitable for primary model training and architectural optimization.
3.1.2. BraTS 2021
The BraTS 2021 dataset consists of 1251 multi-modal MRI cases, each containing T1, T2, T1-contrast-enhanced (T1CE), and FLAIR sequences along with pixel-wise tumor annotations.
Let the dataset be denoted as Equation (
3):
where
represents a 3D multi-modal MRI volume.
In this study, segmentation focuses exclusively on the Whole Tumor (WT) region, defined as in Equation (
4).
where:
For 2D processing, each 3D volume is decomposed into axial slices (Equation (
5)).
where
denotes the number of slices in volume
j.
Figure 1b illustrates representative multi-modal slices and the derived Whole Tumor masks. The large number of cases (1251) enables the evaluation of the cross-dataset robustness and scalability.
3.1.3. BraTS 2018: HGG and LGG
The BraTS 2018 dataset consists of 285 cases, including:
Formally, we use Equation (
6):
HGG tumors are characterized by aggressive growth and pronounced contrast enhancement, whereas LGG tumors often present diffuse and less intense patterns.
Consistent with the BraTS 2021 formulation, the Whole Tumor (WT) region is defined as the union of edema (ED), enhancing tumor (ET), and necrotic/non-enhancing tumor core (NCR/NET), i.e., .
Figure 1c illustrates representative HGG and LGG samples. The inclusion of both tumor grades enables the evaluation of model adaptability across heterogeneous levels of pathological severity.
3.1.4. Visual Illustration of Dataset Diversity
To illustrate structural and intensity variability across datasets, representative samples from FBTS, BraTS 2021, and BraTS 2018 are presented in
Figure 1. The figure highlights differences in tumor morphology, imaging modality characteristics, and pathological grade severity.
As observed in
Figure 1a, the tumor boundaries in FBTS vary significantly across tumor types, ranging from well-defined meningiomas to highly irregular gliomas.
Figure 1b demonstrates modality-dependent contrast variations in BraTS 2021, while
Figure 1c highlights morphological differences between the HGG and LGG cases. These variations justify the necessity for multi-scale contextual modeling combined with boundary-sensitive feature preservation.
3.2. VGG19-UNet Encoder Construction
The proposed framework employs a VGG19-UNet encoder as the foundational feature extraction backbone. Unlike conventional U-Net architectures constructed from randomly initialized convolutional layers, the encoder in this study leverages pretrained VGG19 convolutional blocks to obtain hierarchically structured semantic representations.
3.2.1. Motivation for VGG19-Based Encoding
VGG19 is characterized by its deep yet structurally uniform architecture, composed of sequential
convolutional layers with increasing channel dimensionality [
58,
59]. The repeated application of small-kernel convolutions enables progressive receptive field expansion while preserving spatial detail. For brain tumor segmentation, this hierarchical structure is advantageous because:
Early layers capture low-level intensity and edge information, essential for boundary delineation.
Intermediate layers encode texture and structural patterns, useful for differentiating tumor subregions.
Deeper layers provide high-level semantic abstraction, necessary for modeling global tumor context.
The encoder is initialized with ImageNet-pretrained weights to improve convergence stability and generalization.
3.2.2. Hierarchical Feature Extraction
Let the input tensor be defined as in Equation (
7):
The encoder is composed of five convolutional blocks (Equation (
8)).
where
and each
represents a sequence of convolution–ReLU operations followed by max pooling.
The extracted feature maps are Equations (
9)–(
13).
Here, represents the bottleneck feature map encoding deep semantic tumor information with the largest receptive field.
3.2.3. Receptive Field Expansion
Each convolution operation expands the effective receptive field. For a convolutional layer with kernel size
k and stride
s, the receptive field
in layer
l is recursively defined as in Equation (
14).
where
.
Through successive pooling and convolution operations, the bottleneck representation achieves a substantially enlarged receptive field, enabling modeling of large tumor regions.
3.2.4. Skip Connection Role
Unlike standalone VGG19 classification networks, the proposed encoder exposes intermediate feature maps – for structured feature fusion. These hierarchical representations enable later integration of spatially precise information with deep semantic features.
3.2.5. Architectural Illustration
The hierarchical structure of the VGG19-UNet encoder is illustrated in
Figure 2.
As shown in
Figure 2, spatial resolution decreases progressively as the channel depth increases. This hierarchical compression enables semantic abstraction while retaining multi-level feature maps for structured fusion.
3.2.6. Findings and Architectural Implications
The hierarchical feature extraction behavior of VGG19 provides two critical advantages:
Progressive abstraction enables discrimination between tumor and healthy tissue under varying intensity conditions.
Multi-level feature availability facilitates structured integration with atrous multi-scale context modeling in subsequent modules.
However, the encoder alone does not explicitly model multi-scale contextual dependencies beyond implicit receptive field growth. Therefore, additional context aggregation mechanisms are required, motivating the integration of Atrous Spatial Pyramid Pooling described in the following subsection.
3.3. Atrous Spatial Pyramid Pooling
Although the VGG19-UNet encoder progressively enlarges the receptive field through stacked convolutions and pooling, the contextual modeling remains implicitly constrained by hierarchical downsampling [
60,
61]. To explicitly capture multi-scale spatial dependencies without additional resolution loss, Atrous Spatial Pyramid Pooling (ASPP) is applied to the bottleneck feature map
.
Given by Equation (
15):
atrous convolution with dilation rate
r is defined as in Equation (
16):
where:
represents convolutional weights,
r denotes the dilation rate,
k indexes kernel elements.
i denotes the spatial index in the feature map.
Unlike standard convolution (), atrous convolution introduces spacing between kernel elements, effectively enlarging the receptive field without increasing the parameter count.
3.3.1. Multi-Scale Context Modeling
Parallel atrous convolutions are applied with dilation rates (Equation (
17)).
These dilation values are selected to capture the tumor context at progressively increasing spatial scales:
captures fine-grained local structure,
captures medium-range contextual cues,
captures larger structural dependencies,
captures global spatial relationships.
This design is particularly important for glioma segmentation, where tumor regions often exhibit heterogeneous texture spanning multiple spatial extents.
Each atrous branch produces Equation (
18):
where
denotes the number of output channels produced by the atrous convolution branch corresponding to dilation rate
r. In this study, all atrous branches are configured to produce an equal number of channels, ensuring balanced multi-scale feature representation.
3.3.2. Global Context Aggregation
To incorporate contextual information at the image-level, a global average pooling (GAP) branch is introduced in Equation (
19).
where:
reduces to a global descriptor,
projects the descriptor,
denotes non-linear activation,
restores spatial resolution.
The pooled branch ensures global semantic consistency across the entire tumor region.
3.3.3. ASPP Fusion
The multi-scale features are concatenated (Equation (
20)).
followed by channel compression using Equation (
21).
where the
convolution performs channel-wise feature compression and integration.
Which yields Equation (
22)
Figure 3 illustrates the multi-branch ASPP structure applied to the bottleneck feature map.
3.3.4. Architectural Implication
The ASPP module explicitly decouples receptive field expansion from spatial resolution reduction. This is particularly beneficial for brain tumor segmentation, where tumors may simultaneously exhibit small focal lesions and large infiltrative regions. By aggregating features across multiple spatial scales, ASPP enhances contextual awareness without compromising spatial granularity.
3.4. Low-Level Feature Refinement
While ASPP enhances deep semantic abstraction, precise tumor boundary delineation requires high-resolution spatial information [
62,
63]. Therefore, intermediate encoder feature maps are incorporated via a Low-Level Feature (LLF) refinement branch.
Let Equation (
23) denote the intermediate encoder representation extracted from block3.
To reduce computational overhead and align channel dimensions, a
convolution is applied, as defined in Equation (
24).
producing Equation (
25).
This projection preserves spatial resolution while reducing channel redundancy.
Boundary Preservation Rationale
Low-level features retain intensity gradients, edge information, and fine anatomical structure. Incorporating enables:
Enhanced boundary localization,
Reduction of oversmoothing caused by deep semantic abstraction,
Improved segmentation of small or low-contrast tumor regions.
The structured fusion of and in the subsequent stage enables simultaneous contextual modeling and spatial refinement.
3.5. Feature Fusion and Reconstruction
The final stage of the proposed architecture integrates multi-scale contextual representations obtained from the ASPP module with boundary-sensitive intermediate features derived from the encoder. This structured fusion aims to simultaneously preserve global semantic abstraction and high-resolution spatial detail.
3.5.1. Spatial Alignment
The ASPP output is defined as Equation (
26):
whereas the low-level feature representation is given by Equation (
27):
To enable concatenation, the ASPP feature map is upsampled by a factor of 4 (Equation (
28)).
which yields Equation (
29).
Bilinear interpolation is employed for upsampling to avoid checkerboard artifacts commonly observed in transposed convolutions.
3.5.2. Feature Concatenation
The aligned representations are concatenated along the channel dimension (Equation (
30)).
where Concat(·) denotes channel-wise concatenation, producing Equation (
31):
This operation merges deep semantic context with spatially precise features.
3.5.3. Refinement Block
To integrate and regularize the fused representation, two successive convolutional refinement blocks are applied as in Equation (
32):
is defined in Equation (
33).
These refinement operations:
Reduce channel redundancy,
Enhance nonlinear feature interaction,
Improve boundary consistency.
The refined feature map is given by Equation (
34).
3.5.4. Final Reconstruction
Full-resolution reconstruction is achieved via bilinear upsampling as defined by Equation (
35).
yielding Equation (
36):
A final convolutional layer produces the segmentation probability map as defined in Equation (
37):
where
denotes the sigmoid activation function. The output satisfies Equation (
38).
3.5.5. Architectural Interpretation
Figure 4 illustrates the structured fusion and reconstruction pipeline.
The fusion mechanism enables:
Integration of global contextual cues from ASPP,
Preservation of spatial precision via intermediate encoder features,
Computational efficiency through compact refinement blocks.
This structured integration differentiates the proposed architecture from conventional symmetric U-Net decoders by explicitly separating contextual aggregation from spatial refinement.
3.6. Loss Function and Optimization
To address class imbalance and boundary sensitivity in tumor segmentation the model is optimized using a hybrid loss combining Binary Cross-Entropy (BCE) and Dice regularization [
64,
65].
3.6.1. Binary Cross-Entropy
The binary cross-entropy (BCE) loss is defined by Equation (
39).
where:
denotes the ground-truth label,
denotes predicted probability,
N is the number of pixels.
3.6.2. Dice Similarity Coefficient
The Dice Similarity Coefficient (DSC) is defined by Equation (
40).
where
is a smoothing constant to prevent division by zero.
The Dice loss is defined by Equation (
41).
3.6.3. Hybrid Objective
The overall optimization objective is defined by Equation (
42).
where
balances region-level and pixel-level supervision.
This hybrid formulation ensures:
Stable gradient propagation (BCE),
Improved overlap optimization (Dice),
Reduced bias toward background pixels.
3.6.4. Optimization Strategy
Optimization is performed using Adam as defined in Equation (
43):
where
denotes the model parameters in iteration
t,
is the learning rate,
and
are the bias-corrected first and second moment estimates, and
is a small constant for numerical stability.
The learning rate is set to . Mini-batch training is employed with a batch size of .
3.7. Experimental Protocol
This subsection describes the data partitioning strategy, training configuration, evaluation methodology, and reproducibility settings used to validate the proposed framework.
3.7.1. Data Partitioning Strategy
All datasets were divided using an 80:10:10 ratio for training, validation, and testing.
For the Figshare Brain Tumor Segmentation (FBTS) dataset containing 3064 2D slices, we employ a patient-level partitioning strategy to prevent data leakage. All slices corresponding to a given patient are assigned exclusively to a single subset (training, validation, or testing), ensuring that no anatomical overlap exists between subsets and enabling an unbiased evaluation of generalization performance. The dataset is partitioned into 80% training, 10% validation, and 10% testing at the patient level. The resulting subsets consist of:
2451 images for training,
306 images for validation,
307 images for testing.
For BraTS 2021 (1251 subjects) and BraTS 2018 (210 HGG, 75 LGG), data partitioning is also performed at the patient level to ensure consistency and prevent data leakage. All slices belonging to a single subject are assigned exclusively to one subset, ensuring unbiased evaluation and avoiding artificial performance inflation.
3.7.2. Whole Tumor Labeling
For the BraTS dataset, the segmentation target was defined as the Whole Tumor (WT), as specified in Equation (
44).
where ED, ET, and NCR/NET denote edema, enhancing tumor, and non-enhancing or necrotic tumor core, respectively. All labels were binarized prior to training.
3.7.3. Training Configuration
All images were resized to and normalized to . Mini-batch stochastic optimization was employed.
Training was performed for 50 epochs using the Adam optimizer with learning rate . The selection of the model was based on the validation Dice score. The final reported results correspond to the best-performing model evaluated on the independent test set.
A summary of all hyperparameters and implementation settings is provided in
Table 1. A fixed random seed (42) was used across all experiments to ensure reproducibility of model initialization and consistent training conditions for fair comparison between model variants. All baseline models were trained using the same loss function, optimizer, learning rate, and data splits to ensure a fair comparison.
3.7.4. Implementation Details
The experiments were implemented in TensorFlow/Keras and executed on GPU-based hardware. Random seed initialization was applied to NumPy and TensorFlow to ensure deterministic splitting and training reproducibility.
3.7.5. Evaluation Metrics
The performance of the model was evaluated on the test set using:
All metrics were computed at the pixel level. No test samples were used during training or validation.
3.8. Computational Setup
All experiments were conducted on a high-performance computing server equipped with eight NVIDIA A100-SXM4-40GB GPUs (compute capability 8.0), each providing approximately 38.7 GB of VRAM. The system also included an Intel Xeon processor and 128 GB RAM. The models were implemented using Python 3.9.5 with TensorFlow (2.19.0) (Keras 3.9.0 and CUDA 12.5.1 with cuDNN 9.0 for GPU acceleration.
Training was performed using a batch size of 8 and 50 epochs. The average training time per batch was approximately 46 ms, corresponding to approximately 13 s per epoch. The total training time per experiment was approximately 650 s (10.8 min).
During inference, the average processing time per MRI slice was approximately 5.8 ms, indicating efficient forward-pass computation. This suggests that the proposed model can be deployed in a computationally efficient manner under the evaluated hardware configuration (
Table 2) without an excessive computational burden.
The experiments were conducted on a server equipped with eight NVIDIA A100 GPUs; however, all experiments were carried out using a single GPU. Given the architecture of the model and the input resolution (), GPU memory utilization remained well within the 40 GB capacity, indicating scalability for larger batch sizes or higher-resolution inputs.
5. Discussion
This study presented a DeepLabV3+-based segmentation framework integrating a VGG19-UNet encoder, Atrous Spatial Pyramid Pooling (ASPP), and low-level feature refinement for automated brain tumor segmentation. The proposed architecture was evaluated across the FBTS, BraTS 2021, and BraTS 2018 datasets, demonstrating consistently strong volumetric accuracy and boundary-level precision under both hold-out testing and five-fold cross-validation protocols.
5.1. Architectural Effectiveness
The observed segmentation performance can be attributed to the complementary interaction between hierarchical feature encoding and multi-scale contextual aggregation. The VGG19-UNet encoder provides structured hierarchical representations, enabling progressive abstraction of tumor-relevant patterns while preserving spatial continuity through skip connections. This hierarchical encoding contributes to stable Dice coefficients exceeding 0.95 in several modalities and tumor categories.
The ASPP module enlarges the receptive field without additional spatial downsampling, allowing the network to simultaneously capture compact tumor cores and diffuse peripheral edema regions. Since ASPP operates at bottleneck resolution (), receptive field expansion is achieved with limited computational overhead. This design proves particularly beneficial in Whole Tumor (WT) segmentation tasks, where heterogeneous intensity distributions and variable spatial extents require contextual awareness at multiple scales.
The low-level feature refinement branch further enhances boundary reconstruction by reintroducing intermediate spatial features into the decoding pathway. Qualitative results (
Figure 7,
Figure 8,
Figure 9 and
Figure 10) confirm smooth contour alignment and reduced boundary fragmentation, which is reflected in consistently low ASSD values and controlled Hausdorff distances across datasets.
5.2. Cross-Dataset Robustness
A key finding of this study is the stability of performance across heterogeneous datasets. FBTS contains 2D tumor slices representing distinct tumor categories, while BraTS datasets involve multi-modal MRI acquisitions and Whole Tumor segmentation across both HGG and LGG cases. Despite these structural and modality differences, the proposed framework maintains high Dice and Jaccard scores across tumor types (Meningioma, Glioma, Pituitary), MRI modalities (FLAIR, T1, T2, T1CE), and tumor grades.
The low variance observed in cross-validation results indicates stable generalization behavior rather than dataset-specific overfitting. Performance degradation in certain HGG samples is associated with highly irregular tumor morphologies and heterogeneous intensity distributions, as illustrated in
Figure 9. However, even in these challenging cases, boundary metrics remain within controlled ranges, suggesting geometric stability of the predictions.
5.3. Boundary-Level Reliability
Although volumetric overlap metrics such as the Dice Similarity Coefficient (DSC) and the Jaccard Index (JI) measure region-level agreement, boundary-based metrics provide deeper insight into spatial conformity. Across datasets, ASSD values remain low in high-performing samples, confirming minimal average boundary displacement between prediction and ground truth. Hausdorff Distance (HD) values further demonstrate that extreme boundary outliers are rare.
The error heatmaps reveal that the segmentation discrepancies are predominantly localized in peripheral transition zones rather than tumor cores, indicating that the model accurately captures central pathological structures. Attention heatmaps show concentrated activation within tumor regions, supporting interpretability and reinforcing that the network relies on anatomically relevant features rather than spurious background signals.
5.4. Comparison with Existing Approaches
Compared to conventional U-Net and ResU-Net architectures, the integration of ASPP enhances multi-scale contextual representation without requiring additional encoder depth. Transformer-based models, while capable of modeling long-range dependencies, often require extensive training data and are sensitive to intensity normalization strategies. In contrast, the proposed convolutional framework leverages structured inductive bias while maintaining computational efficiency.
Metaheuristic-optimized models such as GA-UNet and PSO-UNet improve hyperparameter selection through optimization strategies; however, their improvements operate primarily at the training configuration level. The present work introduces an architectural-level enhancement, directly modifying feature aggregation and boundary refinement mechanisms. This structural refinement contributes to spatially coherent predictions while preserving the simplicity and scalability of the model.
5.5. Computational Complexity and Efficiency Analysis
The proposed architecture introduces additional modules beyond the baseline U-Net, namely ASPP and low-level feature refinement. The computational complexity of a convolutional layer can be approximated as , where H and W denote spatial dimensions, C the channel dimension, and k the kernel size. Since ASPP operates at bottleneck resolution (), the effective spatial area is reduced by approximately a factor of 256 compared to the input resolution. Consequently, multi-scale receptive field expansion is achieved with limited incremental computational cost.
The reported inference times include full pipeline overhead, encompassing both model execution and data handling operations, providing a realistic estimate of runtime performance under practical conditions. The results (
Table 12) indicate that the proposed method introduces only a moderate increase in inference time compared to lightweight architectures, while achieving superior segmentation performance, demonstrating an effective balance between accuracy and computational cost.
Empirical measurements indicate an average training time of approximately 46 ms per batch (batch size = 8), corresponding to approximately 13 s per epoch and approximately 10.8 min for 50 epochs. The average inference time is approximately 5.8 ms per slice. This measurement reflects the same overhead-aware evaluation described above.
5.6. Limitations
Despite the strong performance observed, several limitations remain. The framework operates on 2D slices, which may restrict explicit modeling of inter-slice volumetric continuity. Although 2D processing reduces computational demand and memory requirements, tumor morphology often exhibits three-dimensional coherence that could be better captured using volumetric or hybrid 2.5D representations. Additionally, explicit evaluation of the domain shift across scanners and acquisition protocols was not performed, and cross-institutional robustness warrants further investigation. Finally, extreme tumor irregularities may introduce localized boundary deviations in highly heterogeneous cases.
While the proposed model demonstrates strong performance across multiple datasets, cross-dataset training and testing protocols were not explicitly conducted. Therefore, further validation under domain shift conditions remains an important direction for future work to assess generalization robustness.
Furthermore, while attention heatmaps and error overlays provide useful insights into model behavior, they do not constitute clinically validated explanations. These visualizations should therefore be interpreted as supportive analytical tools rather than definitive evidence of clinically meaningful reasoning.
5.7. Future Research Directions
Future work may extend the current framework toward volumetric 3D or hybrid 2.5D modeling to enhance inter-slice contextual consistency. Incorporating slice-aware attention mechanisms or three-dimensional convolutional encoders may improve the representation of complex tumor morphology.
Another promising direction involves the integration of adaptive optimization strategies to refine architectural parameters. Bio-inspired optimization algorithms, such as Particle Swarm Optimization (PSO), Genetic Algorithms (GA), or Differential Evolution (DE), may be used to optimize dilation rates, channel widths or skip-connection weighting [
70,
71,
88]. Rather than relying solely on fixed architectural design, adaptive optimization could enable morphology-aware configuration of receptive field parameters.
Moreover, uncertainty-aware modeling using Bayesian inference or Monte Carlo dropout could provide pixel-wise confidence estimation, improving interpretability in clinical decision-making. Finally, domain adaptation and self-supervised pretraining strategies may further strengthen cross-institutional generalization under varying acquisition conditions.
Overall, integrating architectural refinement with adaptive optimization and uncertainty modeling represents a promising path to develop robust, interpretable, and clinically reliable brain tumor segmentation systems.
6. Conclusions
This study proposed a DeepLabV3+-based brain tumor segmentation framework integrating a VGG19-UNet encoder with Atrous Spatial Pyramid Pooling (ASPP) and low-level feature refinement. The architecture combines hierarchical feature abstraction with multi-scale contextual modeling while preserving boundary-sensitive spatial information. Extensive evaluation across FBTS, BraTS 2021, and BraTS 2018 datasets demonstrated strong and consistent performance under five-fold cross-validation. On FBTS, the proposed model achieved a mean Dice Similarity Coefficient (DSC) of 0.9717 and Jaccard Index (JI) of 0.9456, significantly outperforming the baseline U-Net. Stable segmentation accuracy was also observed across MRI modalities (FLAIR, T1, T2, T1CE) and tumor grades (HGG and LGG), with controlled Hausdorff Distance and low ASSD values confirming geometric boundary reliability.
The ablation study revealed that the VGG19-based encoder and low-level feature refinement contributed substantially to performance improvements, while ASPP provided complementary contextual enhancement. Statistical validation confirmed that performance gains over baseline configurations were consistent across folds. Qualitative analysis further demonstrated strong contour alignment and focused attention activation within pathological regions. Overall, the proposed framework provides a robust, interpretable, and computationally efficient solution for automated brain tumor segmentation. Future extensions may incorporate volumetric modeling and bio-inspired optimization strategies for adaptive architecture tuning, further enhancing generalization and clinical applicability. Beyond brain tumor segmentation, the proposed multi-scale atrous feature fusion framework also demonstrates strong potential for application in other medical image segmentation domains, such as dental panoramic X-ray image segmentation for multi-feature coordinate localization and feature-guided multilayer encoding–decoding networks for 3D intraoral scan data. The ability to simultaneously capture global contextual dependencies while preserving fine-grained boundary details makes the proposed architecture adaptable to a wide range of medical imaging tasks involving complex anatomical structures.