Methods › Computer Vision › Image Models › DPT

Dense Prediction Transformer

DPT

25 papers tagged archive 2025-07-28

Introduced by René Ranftl et al. in Vision Transformers for Dense Prediction

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Dense Prediction Transformers (DPT) are a type of vision transformer for dense prediction tasks.

The input image is transformed into tokens (orange) either by extracting non-overlapping patches followed by a linear projection of their flattened representation (DPT-Base and DPT-Large) or by applying a ResNet-50 feature extractor (DPT-Hybrid). The image embedding is augmented with a positional embedding and a patch-independent readout token (red) is added. The tokens are passed through multiple transformer stages. The tokens are reassembled from different stages into an image-like representation at multiple resolutions (green). Fusion modules (purple) progressively fuse and upsample the representations to generate a fine-grained prediction.

PaperSourceSee Code · intel-isl/DPT

In Syntology about another paper, arXiv:2205.11166: repository known, no verified implementation (declared_code; repositories: 2 listed of 2 in the graph, strongest link: official). About another paper: this answer is about arXiv:2205.11166, while the archive credits arXiv:2103.13413.

From the lookup's note on this name: The same name also belongs to the paper “DPT: Deformable Patch-based Transformer for Visual Recognition” (arXiv:2107.14467, 138 citations), which the lookup finds cited far more than the paper this answer is about (39 citations), so this answer may be about a different sense of the name. For arXiv:2107.14467: its page on this site · ask the lookup about it.

Origin paper of this answer, arXiv:2205.11166 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 7 ran (of which 4 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified (of 12 harvested samples). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 25 · with a code link: 10 · where Syntology ran a sample: 5 (4 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (5 of 25 tagged: 4 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 25 of 25, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 53 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Depth Estimation4
In-Context Reinforcement Learning4
Language Modelling4
Monocular Depth Estimation4
Reinforcement Learning3
Semantic Segmentation3
reinforcement-learning3
Classification2
Decision Making2
Image Classification2
In-Context Learning2
Language Modeling2
Object Detection2
Question Answering2
Reinforcement Learning (RL)2
Self-Supervised Learning2
image-classification2
object-detection2
3D Scene Reconstruction1
Autonomous Driving1

Usage over time archive 2025-07-28

Papers per year tagged with DPT: 2021 to 2025, peak 8 8 0 2021: 2 papers 2021 2022: 8 papers 2022 2023: 8 papers 2023 2024: 4 papers 2024 2025: 3 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (25 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Image ModelsVision Transformers

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