Papers › Medical Image Segmentation Using Squeeze-and-Expansion Transformers
Medical Image Segmentation Using Squeeze-and-Expansion Transformers
Shaohua Li, Xiuchao Sui, Xiangde Luo, Xinxing Xu, Yong liu, Rick Goh
Medical image segmentation is important for computer-aided diagnosis. Good segmentation demands the model to see the big picture and fine details simultaneously, i.e., to learn image features that incorporate large context while keep high spatial resolutions. To approach this goal, the most widely used methods -- U-Net and variants, extract and fuse multi-scale features. However, the fused features still have small "effective receptive fields" with a focus on local image cues, limiting their performance. In this work, we propose Segtran, an alternative segmentation framework based on transformers, which have unlimited "effective receptive fields" even at high feature resolutions. The core of Segtran is a novel Squeeze-and-Expansion transformer: a squeezed attention block regularizes the self attention of transformers, and an expansion block learns diversified representations. Additionally, we propose a new positional encoding scheme for transformers, imposing a continuity inductive bias for images. Experiments were performed on 2D and 3D medical image segmentation tasks: optic disc/cup segmentation in fundus images (REFUGE'20 challenge), polyp segmentation in colonoscopy images, and brain tumor segmentation in MRI scans (BraTS'19 challenge). Compared with representative existing methods, Segtran consistently achieved the highest segmentation accuracy, and exhibited good cross-domain generalization capabilities. The source code of Segtran is released at https://github.com/askerlee/segtran.
In Syntology View this paper on Syntology: its repositories, every harvested function with whether it ran, its licence and the call to fetch it.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2105.09511")
Code
Syntology Ran 13 of 20 code samples harvested from 1 repository linked to this paper; 7 have no recorded run. Of those that ran: 1 ran · honoured contract; 2 ran · our draft was wrong; 10 ran with no contract checked.
By repository: official repository: 20 samples from 1 repository, 13 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
20 samples harvested; 13 ran; 1 honoured the contract we drafted; 7 have no recorded run. Read from Syntology's graph 2026-09-25; that is when this build read the record, not when the samples ran.
Licence: 20 of the 20 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from askerlee/segtran. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.
Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
8631456f20d9c1b9 · report
ce585f7154f9dc0c · report
060455705ae47d70 · report
4af27a1b2e04f6f6 · report
6f29f1ac1dd4e5ae · report
86e01c2857885263 · report
4ad6430b01c09cb6 · report
f0592e287a093c48 · report
9519a9bc56a4dc51 · report
3287ec7b8fd0c808 · report
3fa83a75e1d882d9 · report
46cc07a5b47f925b · report
8835d90bb9dd73b8 · report
af5fb5367ebfbfb3 · report
5c226db1ced864bd · report
06117d01318bffe8 · report
acabdd901645b3e6 · report
a5f46c66fa54514b · report
efcfd592a205f3eb · report
556f05e13b45cdee · report
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Brain Tumor Segmentation | BRATS 2019 | Segtran (i3d) | Avg. | 0.817 | #1 of 5 | Archive leaderboard | report |
| Brain Tumor Segmentation | BRATS 2019 | Segtran (i3d) | TC | 0.817 | #1 of 5 | Archive leaderboard | report |
| Brain Tumor Segmentation | BRATS 2019 | Extension of nnU-Net | Avg. | 0.812 | #2 of 5 | Archive leaderboard | report |
| Brain Tumor Segmentation | BRATS 2019 | Extension of nnU-Net | ET | 0.740 | #2 of 5 | Archive leaderboard | report |
| Brain Tumor Segmentation | BRATS 2019 | Extension of nnU-Net | TC | 0.807 | #2 of 5 | Archive leaderboard | report |
| Brain Tumor Segmentation | BRATS 2019 | Extension of nnU-Net | WT | 0.894 | #2 of 5 | Archive leaderboard | report |
| Brain Tumor Segmentation | BRATS 2019 | Bag of tricks | ET | 0.729 | #3 of 5 | Archive leaderboard | report |
| Brain Tumor Segmentation | BRATS 2019 | Bag of tricks | TC | 0.802 | #3 of 5 | Archive leaderboard | report |
| Brain Tumor Segmentation | BRATS 2019 | Bag of tricks | WT | 0.895 | #3 of 5 | Archive leaderboard | report |
| Optic Cup Segmentation | REFUGE Challenge | Segtran (EfficientNet-B4) | Dice | 0.872 | #2 of 2 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections