Papers
Topics
Authors
Recent
Search
2000 character limit reached

AGFA-Net: 3D Coronary Segmentation

Updated 12 June 2026
  • AGFA-Net is a 3D deep neural network designed for coronary artery segmentation in CCTA volumes, using an encoder-decoder structure with attention mechanisms.
  • It incorporates Feature Refinement, Scale-Adaptive Feature Augmentation, and Hierarchical Feature Integration modules to enhance multi-scale context extraction and feature fusion.
  • The network outperforms traditional models with an average Dice coefficient of 86.74% and a Hausdorff distance of 0.23 mm on a dataset of 1,000 CCTA scans.

AGFA-Net is a 3D deep neural network architecture designed for coronary artery segmentation in computed tomography angiography (CCTA) volumes, particularly addressing the challenges of low image contrast, complex vessel anatomy, and varying vessel sizes. The network is characterized by an encoder-decoder topology augmented with attention and feature aggregation modules to enhance the extraction and fusion of contextually salient features. AGFA-Net achieved an average Dice coefficient of 86.74% and a Hausdorff distance of 0.23 mm on a dataset of 1,000 CCTA scans using 5-fold cross-validation, surpassing conventional benchmarks such as U-Net3D and V-Net (Liu et al., 2024).

1. Architectural Pipeline

AGFA-Net follows a U-shaped 3D encoder-decoder paradigm with three principal modules: Feature Refinement Module (FRM), Scale-Adaptive Feature Augmentation (SAFA), and Hierarchical Feature Integration Module (HFIM). Each module is strategically placed to optimize context-aware feature extraction and multi-scale information fusion.

  • Input: 3D CCTA subvolume of size 128×160×160 voxels.
  • Encoder: Four convolutional encoding blocks (E1–E4), each followed by a FRM and downsampling.
  • Bottleneck: Fifth encoding block (E5) with appended SAFA for multi-resolution attention processing.
  • Decoder: Four upsampling decoding blocks (D4–D1) that utilize skip connections, integrate FRM, and fuse features using HFIM.
  • Output: Final 1×1×11\times1\times1 convolution and sigmoid produce a per-voxel probability for the “coronary artery” class.

High-level pseudocode illustrates the stepwise progression through the network: Ac(Y)=σ(MLP(Yavg)+MLP(Ymax))[0,1]CA_c(Y) = \sigma(\text{MLP}(Y_\text{avg}) + \text{MLP}(Y_\text{max})) \in [0,1]^C8

2. Attention and Feature Enhancement Modules

Feature Refinement Module (FRM)

FRM operates after each encoder and decoder block. It combines channel and spatial attention:

  • Channel attention: On input YRC×D×H×WY\in\mathbb{R}^{C\times D\times H\times W}, global average and max pooling are applied, followed by a shared MLP projection to modulate each channel:

Ac(Y)=σ(MLP(Yavg)+MLP(Ymax))[0,1]CA_c(Y) = \sigma(\text{MLP}(Y_\text{avg}) + \text{MLP}(Y_\text{max})) \in [0,1]^C

  • Spatial attention: Channel pooling yields two 1×D×H×W1\times D\times H\times W maps concatenated and passed through a 737^3 convolution:

As(Y)=σ(Conv73([Yavgs;Ymaxs]))A_s(Y) = \sigma(\text{Conv}_{7^3}([Y_\text{avg}^s; Y_\text{max}^s]))

  • Refinement: Outputs are sequentially modulated:

Y=Ac(Y)Y,Y=As(Y)YY' = A_c(Y)\odot Y,\quad Y'' = A_s(Y')\odot Y'

Scale-Adaptive Feature Augmentation (SAFA)

SAFA at the bottleneck splits feature channels into four groups, each processed by a dilated 333^3 convolution with different rates (dn=1,2,3,4d_n=1,2,3,4) and channel gating. The outputs are concatenated:

Y~=Concat(Y~(1),Y~(2),Y~(3),Y~(4))\widetilde{Y} = \text{Concat}(\widetilde{Y}^{(1)},\widetilde{Y}^{(2)},\widetilde{Y}^{(3)},\widetilde{Y}^{(4)})

A Transformer-style self-attention mechanism constructs YRC×D×H×WY\in\mathbb{R}^{C\times D\times H\times W}0 using YRC×D×H×WY\in\mathbb{R}^{C\times D\times H\times W}1 (shape YRC×D×H×WY\in\mathbb{R}^{C\times D\times H\times W}2, etc.), computes attention maps after reshaping, and fuses via:

YRC×D×H×WY\in\mathbb{R}^{C\times D\times H\times W}3

The final bottleneck feature is

YRC×D×H×WY\in\mathbb{R}^{C\times D\times H\times W}4

3. Hierarchical Feature Integration and Decoder Fusion

The Hierarchical Feature Integration Module (HFIM) fuses adjacent scales in the decoder, operating on the concatenation of current scale features YRC×D×H×WY\in\mathbb{R}^{C\times D\times H\times W}5 and the upsampled deeper decoder features YRC×D×H×WY\in\mathbb{R}^{C\times D\times H\times W}6:

YRC×D×H×WY\in\mathbb{R}^{C\times D\times H\times W}7

This iterative fusion enhances multi-scale context propagation toward the output.

4. Loss Function Formulation

The composite segmentation loss is a convex combination of weighted cross-entropy (WCE) and soft Dice loss, with YRC×D×H×WY\in\mathbb{R}^{C\times D\times H\times W}8:

YRC×D×H×WY\in\mathbb{R}^{C\times D\times H\times W}9

  • Weighted cross-entropy:

Ac(Y)=σ(MLP(Yavg)+MLP(Ymax))[0,1]CA_c(Y) = \sigma(\text{MLP}(Y_\text{avg}) + \text{MLP}(Y_\text{max})) \in [0,1]^C0

  • Soft Dice:

Ac(Y)=σ(MLP(Yavg)+MLP(Ymax))[0,1]CA_c(Y) = \sigma(\text{MLP}(Y_\text{avg}) + \text{MLP}(Y_\text{max})) \in [0,1]^C1

5. Data Preparation and Training Protocol

  • Data: 1,000 CCTA volumes; pixel spacing 0.28–0.41 mm, slice thickness 0.5–1.0 mm, slices per volume 199–275, patient ages 46–78.
  • Preprocessing: Intensity normalization, random subvolume crops (128×160×160), rotation (Ac(Y)=σ(MLP(Yavg)+MLP(Ymax))[0,1]CA_c(Y) = \sigma(\text{MLP}(Y_\text{avg}) + \text{MLP}(Y_\text{max})) \in [0,1]^C2), horizontal flips.
  • Cross-validation: 5-fold protocol with 800/200 splits per fold; within-training held-out 15% validation subset.
  • Optimization: Adam optimizer (lrAc(Y)=σ(MLP(Yavg)+MLP(Ymax))[0,1]CA_c(Y) = \sigma(\text{MLP}(Y_\text{avg}) + \text{MLP}(Y_\text{max})) \in [0,1]^C3, weight decay Ac(Y)=σ(MLP(Yavg)+MLP(Ymax))[0,1]CA_c(Y) = \sigma(\text{MLP}(Y_\text{avg}) + \text{MLP}(Y_\text{max})) \in [0,1]^C4); CosineAnnealingWarmRestarts, batch size 16 across four Tesla V100 GPUs, 500 epochs per fold.

6. Quantitative Performance and Comparative Results

Evaluation utilized Dice coefficient, recall, precision, and Hausdorff distance:

Ac(Y)=σ(MLP(Yavg)+MLP(Ymax))[0,1]CA_c(Y) = \sigma(\text{MLP}(Y_\text{avg}) + \text{MLP}(Y_\text{max})) \in [0,1]^C5

Ac(Y)=σ(MLP(Yavg)+MLP(Ymax))[0,1]CA_c(Y) = \sigma(\text{MLP}(Y_\text{avg}) + \text{MLP}(Y_\text{max})) \in [0,1]^C6

Ac(Y)=σ(MLP(Yavg)+MLP(Ymax))[0,1]CA_c(Y) = \sigma(\text{MLP}(Y_\text{avg}) + \text{MLP}(Y_\text{max})) \in [0,1]^C7

Network Dice Recall Precision Hausdorff (mm)
U-Net3D 81.06% 96.67% 83.48%
V-Net 83.43% 97.14% 85.27%
AGFA-Net 86.74% 98.79% 90.53% 0.23

AGFA-Net demonstrated improved Dice (by 3.31–5.68 points), recall, precision, and boundary accuracy over established 3D segmentation approaches.

7. Ablation Study and Module Contributions

Module contribution was quantified by testing nine architectural variants:

Model FRM SAFA HFIM Dice Recall Precision
Baseline 79.91% 96.58% 83.13%
Net1 83.31% 96.85% 85.22%
Net4 84.27% 97.48% 87.79%
Net6 84.14% 97.68% 86.44%
Net7 (FRM+SAFA) 85.23% 98.54% 89.27%
Net8 (FRM+HFIM) 85.09% 98.28% 88.89%
Net9 (SAFA+HFIM) 85.41% 98.45% 89.36%
AGFA-Net 86.74% 98.79% 90.53%
  • FRM alone: +3.40% Dice
  • SAFA alone: +4.36% Dice
  • HFIM alone: +4.23% Dice
  • Any two modules combined: +5–5.5% Dice
  • All three modules (AGFA-Net): +6.83% Dice over baseline

The coordinated deployment of FRM, SAFA, and HFIM provided the most consistent and substantial improvements across sensitivity, precision, and boundary metrics (Liu et al., 2024).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to AGFA-Net.