Paper · 2023-01-09 · cs.CV
Advances in Medical Image Analysis with Vision Transformers: A Comprehensive Review
A review, not a method: surveys Transformer and vision-Transformer models for medical imaging across classification, segmentation, reconstruction, synthesis, detection, registration and report generation. Gives per-task taxonomies, strengths and weaknesses, and benchmark tables. Headline: MERIT reaches 84.90 Dice on Synapse (author-compiled table).
Vision Transformer (ViT) backbonesAttention mechanismSemantic segmentationImage registrationsurveymedical-imagingvision-transformer
AI-compiled by claude-haiku-5-5 on 2026-11-01, not yet reviewed by a human. Every claim cites its source; check it when a detail matters.
In plain words
Transformers, the model type behind modern chatbots, were first built for text. Since then they have also been applied to images, where they look at relationships across the whole picture instead of only small neighbourhoods, as a convolutional network does. This paper is a large survey of how that idea has been used in medical imaging: reading X-rays and scans, outlining organs and tumours, reconstructing images from less data, translating one scan type into another, finding objects, lining up two images, and writing reports.
For each task the authors group the published models into families, list what each one does well and badly, and collect the benchmark numbers that papers reported. The paper does not propose a new model of its own. It is most useful as a map of the field and as a starting point for choosing an architecture.
TL;DR
- A survey of Vision Transformers in medical image analysis, covering seven tasks and more than 200 papers according to the introduction §1.
- Each task gets a taxonomy, and the review lists strengths and weaknesses per model fig. 1 §3 to §9.
- The only numeric comparisons are the benchmark tables for segmentation tab. 6 tab. 7, compiled by the authors and not re-run here.
- The open problems named are cost of attention and pre-training, explainability, video, registration, and software tooling §10.
Problem
The review says CNNs have a limited receptive field, so they struggle with long-distance dependencies, and their convolution kernels use fixed weights at inference §1. Attention adds input-dependent weighting and global context, but its cost grows quadratically with the number of positions, which is a burden on dense, high-resolution medical images §1. The review also argues that clinical reading varies between readers and is slow and expensive, which motivates automated analysis §2.3.
Method
This is a literature review. The authors searched DBLP, Google Scholar and Arxiv Sanity Preserver with keyword combinations built from "transformer", "medical", "image" and each task name §1, Search Strategy. They say they kept the papers they judged most novel, significant and first of their kind, and that the review may have left out other important work §1. The search date range is not stated.
The review organises the field in two ways.
- By task, in these sections: classification §3, segmentation §4, reconstruction §5, synthesis §6, detection §7, registration §8, report generation §9. Each section proposes its own taxonomy; the segmentation discussion summarises the reviewed models and their tables §4 discussion.
- By where the Transformer sits in the network §2.2:
- Pure Transformer: an encoder-decoder built only from Transformer blocks, such as Swin-Unet and TransDeepLab §2.2.
- Hybrid: a CNN with a Transformer in the encoder (to add global context), in the decoder, or in the skip connections (to fuse low- and high-level features). TransUNet and HiFormer are the review's examples §2.2.
- Other: the remaining placements, such as a Transformer in the bottleneck §2.2.
The background explains the ViT pipeline §2.1 fig. 2: an image is cut into fixed-size patches that are flattened and linearly projected into patch embeddings. Positional embeddings are added, and a learnable class token is appended. A stack of encoder blocks follows, each with multi-head self-attention and an MLP, both pre-normalised with LayerNorm and wrapped in residual connections. A final MLP head produces the prediction §2.1.
Self-attention projects each token into a query, key and value, then forms weights from scaled query-key dot products and applies them to the values §2.1 eq. 1 eq. 2. Multi-head attention runs several such heads in parallel, concatenates them and applies an output projection eq. 3. The review states that the original paper used h = 8 heads §2.1.
# Scaled dot-product self-attention [§2.1] [eq. 1] [eq. 2]
# Input: tokens (N, D); learned w_q, w_k, w_v with shape (D, key_dim)
# Output: attended tokens (N, key_dim)
def self_attention(tokens, w_q, w_k, w_v):
# Project every token to a query, key and value [eq. 1]
queries = tokens @ w_q # (N, key_dim)
keys = tokens @ w_k # (N, key_dim)
values = tokens @ w_v # (N, key_dim)
# Score all pairs, scale by sqrt(key_dim), normalise each row [eq. 2]
scores = queries @ keys.T / sqrt(key_dim) # (N, N)
weights = softmax(scores, axis=-1)
# Weighted sum of values gives the output
return weights @ valuesMulti-head attention eq. 3 is the same operation run h times on separate projections, then concatenated and mapped by an output matrix W^O. The review does not give the value of key_dim for any reviewed model.
Discussion of efficiency in §10 lists several ways to reduce the attention cost: windowed attention (Swin-style), attention across channels instead of tokens (XCiT-style), reordering the query-key-value products, linear attention on a region of interest, and spatial reduction of the keys (ESA). The review gives complexity expressions for some of them, for example O(dn²) → O(d²n) for an efficient attention variant and O(n²/R) for ESA with reduction ratio R §10. These are quoted from the cited works, not re-derived.
Hyperparameters
The review trains no models, so it sets no training hyperparameters. The values it does state:
| Name | Value | Where | Notes |
|---|---|---|---|
| attention heads h | 8 | §2.1 | value of the original Transformer, as stated by the review |
| key dimension, scaling | not stated | eq. 2 | |
| ViT pre-training cost (ViT-L/16, ImageNet) | about 30 days on a standard cloud TPUv3 with 8 cores | §10 | the review's citation of the ViT paper's figure, not a setting of this work |
| search date range | not stated | §1 |
Results
Author-compiled comparisons, not re-run. The review does not say which runs the numbers come from, and it gives no training protocol. Setup: each row is a published model, and each table lists parameters and FLOPs where the source paper reported them. A dash means not reported.
Synapse multi-organ segmentation, ordered by Dice tab. 6:
| Methods | Params (M) | FLOPs (G) | Dice ↑ | HD95 ↓ | Aorta | Gallbladder | Kidney(L) | Kidney(R) | Liver | Pancreas | Spleen | Stomach |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| TransUNet | 96.07 | 88.91 | 77.49 | 31.69 | 87.23 | 63.16 | 81.87 | 77.02 | 94.08 | 55.86 | 85.08 | 75.62 |
| Swin-Unet | 27.17 | 6.16 | 79.13 | 21.55 | 85.47 | 66.53 | 83.28 | 79.61 | 94.29 | 56.58 | 90.66 | 76.60 |
| TransDeepLab | 21.14 | 16.31 | 80.16 | 21.25 | 86.04 | 69.16 | 84.08 | 79.88 | 93.53 | 61.19 | 89.00 | 78.40 |
| HiFormer | 25.51 | 8.05 | 80.39 | 14.70 | 86.21 | 65.23 | 85.23 | 79.77 | 94.61 | 59.52 | 90.99 | 81.08 |
| PVT-CASCADE | 35.28 | 6.40 | 81.06 | 20.23 | 83.01 | 70.59 | 82.23 | 80.37 | 94.08 | 64.43 | 90.10 | 83.69 |
| MISSFormer | 42.46 | 9.89 | 81.96 | 18.20 | 86.99 | 68.65 | 85.21 | 82.00 | 94.41 | 65.67 | 91.92 | 80.81 |
| DAEFormer | 48.07 | 27.89 | 82.63 | 16.39 | 87.84 | 71.65 | 87.66 | 82.39 | 95.08 | 63.93 | 91.82 | 80.77 |
| TransCASCADE | 123.49 | - | 82.68 | 17.34 | 86.63 | 68.48 | 87.66 | 84.56 | 94.43 | 65.33 | 90.79 | 83.52 |
| ScaleFormer | 111.60 | 48.93 | 82.86 | 16.81 | 88.73 | 74.97 | 86.36 | 83.31 | 95.12 | 64.85 | 89.40 | 80.14 |
| D-LKA Net | 101.64 | 19.92 | 84.27 | 20.04 | 88.34 | 73.79 | 88.38 | 84.92 | 94.88 | 67.71 | 91.22 | 84.94 |
| MERIT | 147.86 | 33.31 | 84.90 | 13.22 | 87.71 | 74.40 | 87.79 | 84.85 | 95.26 | 71.81 | 92.01 | 85.38 |
Skin lesion segmentation on ISIC 2017, ISIC 2018 and PH² tab. 7:
| Methods | Params (M) | FLOPs (G) | ISIC17 DSC | ISIC17 SE | ISIC17 SP | ISIC17 ACC | ISIC18 DSC | ISIC18 SE | ISIC18 SP | ISIC18 ACC | PH² DSC | PH² SE | PH² SP | PH² ACC |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| TransUNet | 96.07 | 88.91 | 0.8123 | 0.8263 | 0.9577 | 0.9207 | 0.8499 | 0.8578 | 0.9653 | 0.9452 | 0.8840 | 0.9063 | 0.9427 | 0.9200 |
| TransNorm | 117.98 | 33.41 | 0.8933 | 0.8532 | 0.9859 | 0.9582 | 0.8951 | 0.8750 | 0.9790 | 0.9580 | 0.9437 | 0.9438 | 0.9810 | 0.9723 |
| Swin-Unet | 27.17 | 6.16 | 0.9183 | 0.9142 | 0.9798 | 0.9701 | 0.8946 | 0.9056 | 0.9798 | 0.9645 | 0.9449 | 0.9410 | 0.9564 | 0.9678 |
| D-LKA Net | 101.64 | 19.92 | 0.9254 | 0.9327 | 0.9793 | 0.9705 | 0.9177 | 0.9164 | 0.9773 | 0.9647 | 0.9490 | 0.9430 | 0.9775 | 0.9659 |
| HiFormer | 25.51 | 8.05 | 0.9253 | 0.9155 | 0.9840 | 0.9702 | 0.9102 | 0.9119 | 0.9755 | 0.9621 | 0.9460 | 0.9420 | 0.9772 | 0.9661 |
Other tasks: the review gives per-task comparison tables for classification, reconstruction, synthesis, detection, registration and report generation, but this card has not transcribed them. Read the source for those numbers.
Headline numbers, as the review reports them:
- Synapse: MERIT has the best Dice (84.90) and the best HD95 (13.22) in tab. 6.
- ISIC 2017 and 2018: D-LKA Net has the best DSC (0.9254 and 0.9177) in tab. 7.
- Discussion of inference cost in §4 gives per-model times and GPU memory (for example DAE-Former 46.01 ms and 6.42 GB, MERIT 93.13 ms and 7.78 GB). These are in the text only, not in a table.
Paper vs code
No official code. The abstract and the introduction link https://github.com/mindflow-institue/Awesome-Transformer. That repository is an index of the papers the review covers, with links to their implementations, not code for the review's own method. The review presents no method, so there is nothing to reproduce. Searched: the links in the abstract and introduction only. No GitHub search was run.
Pitfalls
- Dice mismatch. The segmentation discussion gives TransUNet a Dice of 77.48 §4 discussion, while tab. 6 lists 77.49.
- Unclear provenance. The Synapse and ISIC tables do not state whether each row was copied from the source paper or re-run. The reader cannot tell whether the protocols match, for example the split, input size or pre-training. Treat the rows as not directly comparable.
- Few rows, many models. The segmentation discussion counts about 17 reviewed segmentation models §4 discussion, but tab. 6 lists 10 Synapse rows. Some models are only in the taxonomy tables.
- Missing values. TransCASCADE has no FLOPs in tab. 6 (a dash).
- Interpretability is claimed and doubted. §2.3 says Transformers offer better interpretability through attention maps. §10 says attention maps can be vague about which tokens matter, and that propagation methods such as LRP can be numerically unstable on Transformers. Do not treat attention maps as explanations without checking.
- Robustness and pre-training are secondary claims. The review states that ViTs are more robust to adversarial attacks than CNNs §2.3 and that most reviewed methods use ImageNet pre-training §10. Both rest on the cited papers, not on this review's own tests.
- Efficiency numbers are not uniform. Complexity expressions in §10 come from different papers with different definitions of the terms. Compare them only in their original context.
- Search bias. Papers were selected by the authors' judgement of novelty and significance §1. The date range and the completeness of coverage are not stated.
Lineage
- Builds on: the Transformer for sequence modelling §2.1, and the Vision Transformer, cited as arXiv:2010.11929 in the review's bibliography §2.1, §10.
- Compared against: CNN baselines such as U-Net, which the review names as the reference for segmentation designs §2.2, and the CNN-attention hybrids the introduction describes §1.
- Superseded by: not stated.
Source and license
Adapted from “Advances in Medical Image Analysis with Vision Transformers: A Comprehensive Review” by Reza Azad, Amirhossein Kazerouni, Moein Heidari, Ehsan Khodapanah Aghdam, Amirali Molaei, Yiwei Jia, Abin Jose, Rijo Roy, Dorit Merhof (arXiv:2301.03505), used under CC BY 4.0. Changes: condensed and restructured for implementation, with tables, equations and algorithms taken from the paper and its code, each cited to its source. Not affiliated with or endorsed by the authors.