Papers › DRAEM -- A discriminatively trained reconstruction embedding for surface anomaly detection
DRAEM -- A discriminatively trained reconstruction embedding for surface anomaly detection
Vitjan Zavrtanik, Matej Kristan, Danijel Skočaj
Visual surface anomaly detection aims to detect local image regions that significantly deviate from normal appearance. Recent surface anomaly detection methods rely on generative models to accurately reconstruct the normal areas and to fail on anomalies. These methods are trained only on anomaly-free images, and often require hand-crafted post-processing steps to localize the anomalies, which prohibits optimizing the feature extraction for maximal detection capability. In addition to reconstructive approach, we cast surface anomaly detection primarily as a discriminative problem and propose a discriminatively trained reconstruction anomaly embedding model (DRAEM). The proposed method learns a joint representation of an anomalous image and its anomaly-free reconstruction, while simultaneously learning a decision boundary between normal and anomalous examples. The method enables direct anomaly localization without the need for additional complicated post-processing of the network output and can be trained using simple and general anomaly simulations. On the challenging MVTec anomaly detection dataset, DRAEM outperforms the current state-of-the-art unsupervised methods by a large margin and even delivers detection performance close to the fully-supervised methods on the widely used DAGM surface-defect detection dataset, while substantially outperforming them in localization accuracy.
In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, on Syntology's MCP service (how to connect):
get_harvested_code_for_paper(arxiv_id="2108.07610")get_code(code_sha256="…")with a sample'scode_sha256from the list belowget_citation_path(paper_1="2108.07610", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="2108.07610")
Code
Syntology 7 code samples harvested from 1 repository linked to this paper: 7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 3 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; failures of Syntology's instrument, not of the code.
By repository: official repository: 7 samples from 1 repository, 7 ran (6 with no instrument failure; 1 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
Levels written on 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 2 of the 7 samples that ran have no recorded date.
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
7 samples harvested: 7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 3 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.
Licence: 6 of the 7 samples are pointer only, meaning Syntology does not serve that copy's text. For 6 of them, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from vitjanz/draem. “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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.
Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.
A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.
443341084ce76798 · report
fixture: signature window_size:int/0/int, channel:int/0/int · returned Tensor · level recorded 2026-09-25 census: 8 implementations from 9 papers, 8 distinct outputs across 4 buckets, one shared input per bucket loss.py ran · honoured contract fingerprinted MIT (permissive) ·
c56b7ef16f309a45 · report
fixture: signature window_size:int/0/int, sigma:float/0/float · returned Tensor · level recorded, date not recorded 293a2b1189b747fd · report
fixture: signature shape:tuple/1/int, res:tuple/1/int, octaves:int/0/int, persistence:float/0/float · returned ndarray · level recorded 2026-09-25 ed9e127befc02046 · report
fixture: signature shape:tuple/1/int, res:tuple/1/int · returned ndarray · level recorded 2026-09-25 7337f1f5ff01dcd0 · report
fixture: signature optimizer:SGD/0/? · returned float · level recorded, date not recorded 4de91a4627a51ea2 · report
fixture: signature x:ndarray/2/float, y:ndarray/2/float, w:ndarray/2/float · returned ndarray · level recorded 2026-09-25 bff794bd9bd73f94 · report
fixture: signature img1:Tensor/4/float, img2:Tensor/4/float, window_size:int/0/int, window:Tensor/4/float, size_average:bool/0/bool, full:bool/0/bool, val_range:int/0/int · returned tuple · level recorded 2026-09-25 Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Anomaly Classification | GoodsAD | DRAEM | AUPR | 71 | #6 of 11 | Archive leaderboard | report |
| Anomaly Classification | GoodsAD | DRAEM | AUROC | 65.9 | #6 of 11 | Archive leaderboard | report |
| Anomaly Detection | MVTec AD | DRAEM | Detection AUROC | 98.0 | #68 of 148 | Archive leaderboard | report |
| Anomaly Detection | MVTec AD | DRAEM | Segmentation AP | 68.4 | #68 of 148 | Archive leaderboard | report |
| Anomaly Detection | MVTec AD | DRAEM | Segmentation AUROC | 97.3 | #68 of 148 | Archive leaderboard | report |
| Anomaly Detection | MVTec LOCO AD | DRAEM | Avg. Detection AUROC | 73.6 | #33 of 40 | Archive leaderboard | report |
| Anomaly Detection | MVTec LOCO AD | DRAEM | Detection AUROC (only logical) | 72.8 | #33 of 40 | Archive leaderboard | report |
| Anomaly Detection | MVTec LOCO AD | DRAEM | Detection AUROC (only structural) | 74.4 | #33 of 40 | Archive leaderboard | report |
| Anomaly Detection | MVTec LOCO AD | DRAEM | Segmentation AU-sPRO (until FPR 5%) | 42.6 | #33 of 40 | Archive leaderboard | report |
| Anomaly Detection | VisA | DRAEM | Segmentation AUPRO (until 30% FPR) | 73.1 | #44 of 50 | 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.
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