Dual-Branch AI Network Sharpens Abdominal CT Segmentation While Slashing Compute

Abdominal CT scans are among the most demanding images in medical imaging. They pack multiple organs, tumors, blood vessels, and background tissues into a single slice, often with low contrast and blurred boundaries that even experienced radiologists must scrutinize carefully. For artificial intelligence, the challenge is steeper still: a model must simultaneously trace the fine edge of a liver, isolate a small tumor that may occupy only a handful of pixels, and understand how anatomical structures relate to one another across the entire image. A new deep learning architecture described in Frontiers in Signal Processing tackles this problem with an unusual combination of sparse attention and polynomial mathematics, and the results suggest that accuracy and efficiency need not be a trade-off.

The system, called PDSA-DBUNet, was developed by Jiatong Shang of Shangluo University, Guolin He of Heping Hospital Affiliated to Changzhi Medical College, and Xuyang Li of Shaanxi University of Science and Technology. It is a dual-branch U-Net that runs a convolutional neural network and a Transformer in parallel, letting each branch do what it does best. The convolutional branch preserves local textures, edges, and boundary details, while the Transformer branch models global semantic dependencies across the whole image. The innovation lies in how the Transformer branch is made dramatically cheaper: instead of computing attention over every pixel token, it compresses the image into a small set of informative sparse tokens and then mixes them with a polynomial operation rather than conventional multi-head self-attention.

To understand why this matters, consider the computational anatomy of standard Transformers. Self-attention computes pairwise relationships among all tokens, so its cost grows quadratically with the number of tokens. On a high-resolution CT slice, most tokens represent background tissue that carries little diagnostic value, yet dense attention still spends enormous computation correlating them with one another. The researchers’ dynamic sparse visual token generation module addresses this by using learnable spatial importance weights, produced through a global projection and a Softmax operation, to adaptively aggregate dense tokens into a compact set of discriminative sparse tokens. An element-wise modulation step, normalized by a Sigmoid function, further refines each sparse token so that the aggregation responds to the actual content of the image. Organ regions, tumor areas, and blurred boundaries are emphasized, while irrelevant background responses are suppressed.

Crucially, the mapping between sparse tokens and their original dense spatial positions is retained. After the Transformer branch processes the compact token set, the features are projected back to their original spatial locations and reshaped into feature maps that can be fused with the convolutional branch at matching resolutions. This restoration step is what makes the sparse design compatible with pixel-level segmentation, a requirement that many general-purpose efficient Transformer methods, such as Perceiver or DynamicViT, were never designed to satisfy for dense medical prediction.

The second efficiency leap comes from replacing self-attention entirely with a Polynomial Mixer, based on the PoM mechanism. Rather than building an explicit attention matrix, the mixer aggregates all sparse tokens into a shared global state using learnable polynomial coefficients and element-wise power operations, then applies a Sigmoid-based gating mechanism so each token can selectively retrieve relevant contextual information from that shared state. The computational complexity of this operation scales linearly with the number of tokens rather than quadratically. According to the authors’ complexity analysis, the overall cost of the PDSA module is dominated by sparse token generation and polynomial mixing, both of which are far cheaper than dense attention when the sparse token count is much smaller than the original token count, and no dense attention matrix ever needs to be stored in memory.

Bridging the two branches is the third key component: a Dual-Scale Parallel Attention Fusion module, or DSPAF. The researchers argue that simply adding or concatenating convolutional and Transformer features is inadequate because the two feature spaces respond inconsistently to the same anatomy. DSPAF instead operates at two complementary scales in parallel. A global channel attention path uses global average pooling and fully connected layers to model semantic relationships between the branches, providing global contextual guidance to the CNN features and local structural constraints to the Transformer features. A local spatial interaction path concatenates the aligned features and applies convolutional processing to highlight locations jointly activated by both branches, refining boundaries, textures, and small target regions. A residual connection preserves original local details and stabilizes training.

The experimental evidence is striking. On the LiTS liver tumor segmentation benchmark, using 131 contrast-enhanced abdominal CT cases split into 100 training and 31 testing cases, PDSA-DBUNet achieved a Dice score of 96.79 percent for liver segmentation, exceeding Swin UNETR by 1.66 percentage points and nnU-Net by 2.77 percentage points. For liver tumors, which are small, irregular, and low in contrast, it reached 86.13 percent Dice, outperforming Swin UNETR and nnU-Net by 1.22 and 1.26 percentage points respectively, and beating the conventional U-Net baseline by nearly four points. On the tumor task it also achieved the best results on all four error-based metrics, including a volumetric error of just 0.76 percent and boundary distances substantially lower than every competing method.

The KiTS19 kidney dataset told a similar story. Across 210 abdominal CT volumes divided into 168 training, 21 validation, and 21 testing cases, the model scored 94.03 percent Dice for kidney segmentation and 89.06 percent for kidney tumors, leading on all three reported metrics for the tumor task, including an average symmetric surface distance of 1.91 millimeters and a maximum surface distance of 17.09 millimeters. Qualitative comparisons showed the network producing more complete organ masks and more compact tumor contours with fewer false positives and false negatives than U-Net, TransUNet, Swin-Unet, nnU-Net, Swin UNETR, and other baselines, particularly near low-contrast tissue interfaces where rival methods leaked or under-segmented.

Perhaps the most persuasive numbers come from the ablation study. A plain U-Net baseline reached 93.99 percent Dice with 65.47 GFLOPs and 34.53 million parameters. Simply bolting on Transformer blocks, whether stacked or parallel, raised accuracy by only fractions of a point while inflating the model to as much as 496.45 million parameters and 673.56 megabytes of storage. Introducing the PDSA module into the parallel structure lifted Dice to 96.14 percent while cutting FLOPs to 70.04 G and parameters to 40.42 million. Adding DSPAF brought the final score to 96.79 percent, with the complete model requiring 72.87 GFLOPs, 41.62 million parameters, and a checkpoint of just 129.93 megabytes. Compared with the parallel CNN-Transformer variant without sparse attention, the final architecture improved Dice by 2.68 percentage points while reducing computation by 50.19 percent, parameters by 91.62 percent, and model size by 80.71 percent.

The authors are candid about limitations. The current experiments operate on 2D CT slices, which do not exploit inter-slice continuity in volumetric scans, and validation so far rests on two public datasets rather than multi-center clinical data. Future work, they write, will extend the architecture to three-dimensional or 2.5-dimensional inputs and compare directly with 3D variants of nnU-Net, nnFormer, and Swin UNETR under identical settings. Even so, the core message is likely to resonate across medical AI: the quadratic cost of dense attention is not a price that must be paid for global context. By deciding dynamically which image regions deserve to be tokens at all, and by mixing those tokens with polynomial algebra instead of pairwise attention, PDSA-DBUNet demonstrates that a network can see the whole abdomen clearly while thinking about far less of it at a time.

Subject of Research: A dual-branch CNN-Transformer neural network with polynomial dynamic sparse attention for abdominal CT organ and tumor segmentation

Article Title: PDSA-DBUNet: dual-branch U-Net for abdominal medical image segmentation driven by polynomial dynamic sparse attention

Article References: Shang, J., He, G., & Li, X. (2026). PDSA-DBUNet: dual-branch U-Net for abdominal medical image segmentation driven by polynomial dynamic sparse attention. Frontiers in Signal Processing, 6, Article 1904505. https://doi.org/10.3389/frsip.2026.1904505

Image Credits: AI Generated

DOI: 10.3389/frsip.2026.1904505

Keywords: medical image segmentation, abdominal CT, deep learning, U-Net, Transformer, sparse attention, polynomial mixer, CNN-Transformer hybrid, liver tumor segmentation, kidney segmentation, LiTS dataset, KiTS19