Papers › DenseHybrid: Hybrid Anomaly Detection for Dense Open-set Recognition

DenseHybrid: Hybrid Anomaly Detection for Dense Open-set Recognition

6 Jul 2022arXiv:2207.02606archive 2025-07-28

Matej Grcić, Petra Bevandić, Siniša Šegvić

Anomaly detection can be conceived either through generative modelling of regular training data or by discriminating with respect to negative training data. These two approaches exhibit different failure modes. Consequently, hybrid algorithms present an attractive research goal. Unfortunately, dense anomaly detection requires translational equivariance and very large input resolutions. These requirements disqualify all previous hybrid approaches to the best of our knowledge. We therefore design a novel hybrid algorithm based on reinterpreting discriminative logits as a logarithm of the unnormalized joint distribution p̂(𝐱, 𝐲). Our model builds on a shared convolutional representation from which we recover three dense predictions: i) the closed-set class posterior P(𝐲|𝐱), ii) the dataset posterior P(dᵢₙ|𝐱), iii) unnormalized data likelihood p̂(𝐱). The latter two predictions are trained both on the standard training data and on a generic negative dataset. We blend these two predictions into a hybrid anomaly score which allows dense open-set recognition on large natural images. We carefully design a custom loss for the data likelihood in order to avoid backpropagation through the untractable normalizing constant Z(θ). Experiments evaluate our contributions on standard dense anomaly detection benchmarks as well as in terms of open-mIoU - a novel metric for dense open-set performance. Our submissions achieve state-of-the-art performance despite neglectable computational overhead over the standard semantic segmentation baseline.

PaperPDFCodeCode Syntology ran

In Syntology 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="2207.02606")

Code

Syntology Ran 12 of 13 code samples harvested from 1 repository linked to this paper; 1 has no recorded run. Of those that ran: 3 ran · our draft was wrong; 9 ran with no contract checked.

By repository: official repository: 13 samples from 1 repository, 12 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

matejgrcic/DenseHybrid officialmentioned on GitHubpytorch report

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

13 samples harvested; 12 ran; 0 honoured the contract we drafted; 1 has no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

3ran · our draft was wrong
9ran
1unverified

Licence: 13 of the 13 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 matejgrcic/DenseHybrid. “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.

DenseNet matejgrcic/DenseHybrid/models/ladder_densenet.py official repository ran · metamorphic tier: deterministic fingerprinted GPL-2.0 (copyleft) · pointer only · 82fa155ecf7dd6ea · report
SPPWrapper matejgrcic/DenseHybrid/models/ladder_densenet.py official repository ran · metamorphic tier: deterministic GPL-2.0 (copyleft) · pointer only · ff8e4e3cca125ab7 · report
SpatialPyramidPooling matejgrcic/DenseHybrid/models/ladder_densenet.py official repository ran GPL-2.0 (copyleft) · pointer only · 670a3be43c04c03c · report
UpsampleWrapper matejgrcic/DenseHybrid/models/ladder_densenet.py official repository ran · metamorphic tier: deterministic GPL-2.0 (copyleft) · pointer only · 829101d62a45513f · report
_BNReluConv matejgrcic/DenseHybrid/models/ladder_densenet.py official repository ran · metamorphic tier: deterministic GPL-2.0 (copyleft) · pointer only · 4eb447fe1facaf64 · report
_DenseBlock matejgrcic/DenseHybrid/models/ladder_densenet.py official repository ran · metamorphic tier: deterministic fingerprinted GPL-2.0 (copyleft) · pointer only · 78a6b14acf189d64 · report
_DenseLayer matejgrcic/DenseHybrid/models/ladder_densenet.py official repository ran · metamorphic tier: deterministic GPL-2.0 (copyleft) · pointer only · 7590cc05fbd0178e · report
_Transition matejgrcic/DenseHybrid/models/ladder_densenet.py official repository ran · metamorphic tier: deterministic GPL-2.0 (copyleft) · pointer only · 1c790b909fc8f0d1 · report
_Upsample matejgrcic/DenseHybrid/models/ladder_densenet.py official repository ran GPL-2.0 (copyleft) · pointer only · 378890a5c1832284 · report
_checkpoint_bnreluconv matejgrcic/DenseHybrid/models/ladder_densenet.py official repository ran · our draft was wrong GPL-2.0 (copyleft) · pointer only · 39fa24f2290ebbd3 · report
_checkpoint_transition matejgrcic/DenseHybrid/models/ladder_densenet.py official repository ran · our draft was wrong GPL-2.0 (copyleft) · pointer only · a6df25fb24ddf178 · report
_checkpoint_unit matejgrcic/DenseHybrid/models/ladder_densenet.py official repository ran · our draft was wrong GPL-2.0 (copyleft) · pointer only · 9e15f680fc14dc9e · report
LadderDenseNet matejgrcic/DenseHybrid/models/ladder_densenet.py official repository unverified GPL-2.0 (copyleft) · pointer only · 77e4e57e31f33c48 · report

Tasks

Anomaly DetectionOpen Set LearningScene SegmentationSemantic Segmentation

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Anomaly Detection Fishyscapes DenseHybrid AP 72.3 #5 of 8 Archive leaderboard report
Anomaly Detection Fishyscapes DenseHybrid FPR95 5.5 #5 of 8 Archive leaderboard report
Anomaly Detection Fishyscapes L&F DenseHybrid AP 43.9 #8 of 18 Archive leaderboard report
Anomaly Detection Fishyscapes L&F DenseHybrid FPR95 6.2 #8 of 18 Archive leaderboard report
Scene Segmentation StreetHazards LDN121-DenseHybrid Open-mIoU 45.8 #3 of 3 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