Cited by 2,373Advanced Neural Network ApplicationsDomain Adaptation and Few-Shot LearningAdvanced Vision and Imaging

The DOI matches its Crossref record; 71 of the 88 references it cites were found in a registry or an index; 8 of the 27 sources its claims cite were checked for support.

Vision Transformers for Dense Prediction

Open access
Ranftl, Rene, Bochkovskiy, Alexey, Koltun, Vladlen·2021·2021 IEEE/CVF International Conference on Computer Vision (ICCV)

Abstract

We introduce dense prediction transformers, an architecture that leverages vision transformers in place of convolutional networks as a backbone for dense prediction tasks. We assemble tokens from various stages of the vision transformer into image-like representations at various resolutions and progressively combine them into full-resolution predictions using a convolutional decoder. The transformer backbone processes representations at a constant and relatively high resolution and has a global receptive field at every stage. These properties allow the dense prediction transformer to provide finer-grained and more globally coherent predictions when compared to fully-convolutional networks. Our experiments show that this architecture yields substantial improvements on dense prediction tasks, especially when a large amount of training data is available. For monocular depth estimation, we observe an improvement of up to 28% in relative performance when compared to a state-of-the-art fully-convolutional network. When applied to semantic segmentation, dense prediction transformers set a new state of the art on ADE20K with 49.02% mIoU. We further show that the architecture can be fine-tuned on smaller datasets such as NYUv2, KITTI, and Pascal Context where it also sets the new state of the art. Our models are available at https://github.com/intel-isl/DPT.

Overview

Integrity signals

Registry

Crossref · 10.1109/iccv48922.2021.01196

Cites

71 of 71 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

32 Own result · 23 Own interpretation · 11 No basis given · 10 No full text of the sources · 3 Supported · 2 Partly supported · 1 Supported so far · 1 Own method · accuracy not yet measured

Show all 59 claims

  • Probably not a substantial claim. 11
  • It may state two separate claims as one. 13
  • The quote only partly states this claim. 1
24 of 24
  • The paper relies on this without support.

    The choice of backbone architecture has a large influence on the capabilities of the overall model, because information lost in the encoder cannot be recovered in the decoder.

    “However, it is widely recognized that the choice of backbone architecture has a large influence on the capabilities of the overall model, as any information that is lost in the encoder is impossible to recover in the decoder.”
  • The paper relies on this without support.

    Feature resolution and granularity are critical for dense prediction, where the architecture should ideally resolve features at or close to the input resolution.

    “While feature resolution and granularity may not matter for some tasks, such as image classification, they are critical for dense prediction, where the architecture should ideally be able to resolve features at or close to the resolution of the input image.”
  • The paper relies on this without support.

    Convolutions are linear operators with a limited receptive field.

    “Convolutions, by definition, are linear operators that have a limited receptive field.”
  • The paper relies on this without support.

    Downsampling intermediate representations is necessary to keep memory consumption at levels feasible with existing computer architectures.

    “Downsampling the intermediate representations is necessary to keep memory consumption at levels that are feasible with existing computer architectures.”
  • The paper relies on this without support.

    The transformer backbone maintains a constant feature resolution.

    “Since the transformer backbone maintains a constant feature resolution, it is not clear at which points in the backbone features should be tapped.”
  • The paper relies on this without support.

    Performance of fully-convolutional architectures suffers heavily when performing inference at an input resolution significantly different from the training resolution.

    “Performance thus suffers heavily when performing inference at an input resolution that is significantly different from the training resolution.”
  • The paper relies on this without support.

    Transformer encoders have a global receptive field in every layer.

    “Transformer encoders, on the other hand, have a global receptive field in every layer.”
  • The paper relies on this without support.

    The reduced meta-dataset datasets provide high-quality ground truth.

    “We choose these datasets since they provide high-quality ground truth.”
  • The paper relies on this without support.

    Convolutional architectures offer natural points of interest for passing features from the encoder to the decoder, namely before or after downsampling of the representation.

    “Convolutional architectures offer natural points of interest for passing features from the encoder to the decoder, namely before or after downsampling of the representation.”
9 of 9

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

1 of 1

Citations

Cites

Show all 88 references

Research works printed but not linked: 3

  1. yuan, 2020, Objectcontextual representations for semantic segmentation, ECCV
  2. godard, 2017, Unsupervised monocular depth estimation with leftright consistency, CVPR
  3. casser, 2019, Unsupervised learning of depth and ego-motion: A structured approach, AAAI

Cited by

Sorted by citations

Metadata

Authors
Ranftl, R., Bochkovskiy, A., & Koltun, V.
Affiliations
  • Intel Labs
  • Intel (United States) (US)
Venue
2021 IEEE/CVF International Conference on Computer Vision (ICCV)
Publisher
IEEE
Published
2021-10
Pages
12159-12168
OpenAlex
W3136635488
Cited by
2,373
References
88
Citations by year
2026: 480 · 2025: 607 · 2024: 586 · 2023: 431 · 2022: 225 · 2021: 44
FWCI
104.94
Type
conference paper
Language
en
Open access
Locations
  • IEEE/CVF International Conference on Computer Vision (ICCV) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
  • TIB Data Manager
  • IEEE/CVF International Conference on Computer Vision (ICCV)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Vision and Imaging
Keywords
vision transformer, dense prediction, monocular depth estimation, semantic segmentation, convolutional decoder, global receptive field, Pascal Context, NYUv2, KITTI, ADE20K

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

A language model drew the claims from the paper on 2026-10-11, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-11 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Cited sources are checked with a language model’s help (gpt-6-sol).

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review