- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies the effect of replacing reusable nearest-neighbor patch matching with one-to-one assignment in normal-only image anomaly detection. The authors define assignment excess as the additional cost introduced by the one-to-one constraint and show that it accounts for changes in anomaly ranking. On MVTec LOCO, one-to-one matching consistently improves logical anomaly AUROC while reducing structural anomaly AUROC, with the gain mainly arising from count and composition anomalies rather than pure rearrangements. The paper further investigates reference construction and shows that pooling multiple normal references substantially weakens the effect, whereas scoring complete references independently largely preserves it. Additional experiments on CAD-SD, DigitAnatomy, VID-AD, VisA, and Real-IAD, together with integrations into PatchCore and EfficientAD-M, are used to examine the generality and practical utility of the proposed matching signal.
Critical strengths
-
The paper provides a clean controlled study of the correspondence constraint itself. The nearest-neighbor and one-to-one variants share the same feature representation, normal reference, patch costs, and aggregation, so the observed performance difference can be attributed much more directly to whether reference patches may be reused. The assignment-excess formulation further gives a simple explanation of how this constraint changes normal-anomaly rankings, rather than treating the improvement as a purely empirical effect.
-
The analysis reveals a useful interaction between correspondence and reference construction. The logical gain is consistently observed with complete single references, but becomes much smaller when multiple references are pooled and can be recovered when complete references are scored separately. Together with the consistent logical-structural tradeoff across DINOv2 and DINOv3, this provides a useful characterization of when one-to-one matching is likely to help and when it may fail.
Critical weaknesses
-
The methodological novelty appears limited relative to recent logical anomaly detection work. One-to-one, Hungarian, and transport-based correspondence have already been used in related methods, while the main technical contribution here is to isolate this matching constraint and analyze its effect under controlled conditions. The assignment-excess identity is useful for interpretation, but it is essentially the residual between the assignment and nearest-neighbor objectives.
-
The claimed applicability to logical anomaly detection is substantially narrower than the terminology suggests. The proposed score depends only on the multiset of patch features and is therefore insensitive to rearrangements that preserve this multiset; correspondingly, the paper reports essentially no gain for pure rearrangement anomalies. In addition, the method relies on a complete normal reference from the correct category, while the experiments show that pooling references can largely remove the logical advantage. These properties raise concerns about whether the method addresses logical anomalies broadly, or mainly a restricted subset involving count and composition changes under favorable reference construction.
Questions for authors
-
Since related logical anomaly detection methods already employ Hungarian or transport-based matching, can the authors clarify more concretely what capability is introduced by the proposed method beyond providing a controlled analysis of an existing correspondence mechanism? A comparison under the same backbone, reference construction, and scoring protocol with a recent matching-based logical anomaly detector would help establish the incremental methodological contribution.
-
How does the method perform when reference retrieval is not restricted by the ground-truth category? The current LOCO setup retrieves a normal reference within the correct category, but this information may not be available in a more general anomaly detection setting. A category-agnostic retrieval experiment or a controlled routing-error experiment would help quantify this dependency.
-
The method is invariant to rearrangements that preserve the patch multiset, and the reported placement-only results show almost no improvement. How should the method be expected to handle logical anomalies defined primarily by spatial relationships or ordering rather than count or composition? Would the authors consider narrowing the scope of the main claim accordingly?
-
The paper consistently observes a gain on logical anomalies together with a loss on structural anomalies at the matching-score level. Is there a principled way to combine the reusable and one-to-one scores so that the logical gain can be retained without sacrificing structural performance, rather than requiring the user to choose between the two behaviors?
4 comments
I thank the authors for their response and additional experiments. My main concern about methodological novelty remains. The new experiments help explain when one-to-one matching is effective, but the main contribution is still the analysis of an existing matching mechanism. The fusion results on PatchCore also show that the trade-off between logical and structural anomaly detection remains an issue. I maintain my score of 2.
Thank you for the follow-up, and for calling this a "clean controlled study".
Systems such as LogSAD use one-to-one matching inside larger pipelines, so their papers do not show what the matching itself does. The paper takes it out and tests it alone. Forbidding reuse lets a patch detector notice a missing or extra part when each normal image is kept whole and not pooled into one bank.
The tradeoff is expected, because the two scores catch different defects. Added to a trained EfficientAD-M, the one-to-one signal catches more logical anomalies, and structural detection stays essentially the same.
Follow-up (18 Nov): the finding applied to an existing detector
Thank you for your comment. This follows up our 17 Nov reply with a new result. By design, the paper takes the one-to-one constraint out of larger systems and tests it alone. Its practical finding is to keep each reference whole, and the table adds our calibrated one-to-one signal, computed against complete references, to our AnomalyDINO reimplementation (exploratory, from cached features).
| AnomalyDINO reimplementation plus our signal | Logical change, points | Structural change, points |
|---|---|---|
| DINOv2 | +5.30 [3.96, 6.67] | -0.22 [-0.94, 0.45] |
| DINOv3 | +4.38 [2.89, 5.94] | -1.79 [-2.70, -0.91] |
Under DINOv3 the structural cost exceeds our one-point margin. For DINOv2 the structural-change interval spans zero, and on the released EfficientAD-M checkpoint structural AUROC moves from 95.19 to 95.05. We would welcome your assessment of these results.
Hungarian matching inside the related methods you mention (LogSAD, ObjectCore) is known; what we add is that, on the same features and costs, the one-to-one constraint helps when each reference stays complete and gives almost nothing on a pooled bank: +5.69 [+4.20, +7.22] logical AUROC on separate references against +0.24 [-0.04, +0.55] pooled, on DINOv2 (Table 10a).
Q1. In Table 10a, the bank decides whether one-to-one matching helps. The pooled difference is too close to call. We change only the assignment and the bank, so this isolates what one-to-one matching adds, the interaction you call "a useful interaction between correspondence and reference construction". Inside the first of these, as the official four-shot system with its CLIP features, supports, calibration and fusion kept, our assignment beats reuse on the same dense costs by +5.27 [1.73, 8.81] branch logical AUROC, positive in all five categories. Replacing its Segment Anything region branch with this mask-free dense assignment gives 85.80 against 87.01 fused logical AUROC (-5.22 to +2.82), too close to call. After fusion the branch difference is 2.23 [-2.75, 7.21], which includes zero (Appendix H, "Assignment inside LogSAD"). That test is four-shot, on development data, and a pre-specified arm. In practice this gives a rule for patch-level one-to-one scoring, which is to keep the normal references complete and score them separately. Among the systems in Table 19, ours is also the only one that forbids patch reuse with no segmenter or detector, and the controlled result in Table 10a needs no trained component. For detection in practice we add it to a trained host detector, here EfficientAD-M (Q4).
On the support images of the four-shot system, a recent matching-based detector (four normal reference images per category), DINOv2 patch assignment with one retrieved reference gains +5.16 over nearest neighbor for one support draw (Appendix H). It matches Segment Anything regions described with CLIP. On the 606 of 1,568 queries with a single region, its Hungarian step and reuse score identically. With calibration fixed, Hungarian minus reuse in the four-shot system is +0.01 logical AUROC over five categories, too close to call (Appendix H, "Matching within LogSAD").
Inside the system's region-level step, with the same support images, the interaction between pooled versus separate references and Hungarian matching versus reuse is -0.45 logical AUROC over five categories, too close to call. The four-shot system's own patch branch allows reuse on a pooled bank (Table 19), so our rule would apply there only if one-to-one matching were added. Our bank rule is about patch-level one-to-one matching, which our main contrasts (Tables 1 and 10a) control; region-level matching and full systems lie outside it.
Q2. Category-agnostic retrieval picks the same reference as correct-category retrieval for all 1,568 test images. Here we use DINOv2 retrieval without category labels (Appendix H, "Category routing"). When we force 10% wrong-category errors, assignment-score logical AUROC drops from 78.30 to 73.07, and structural AUROC also falls.
Q3. Yes: our claim now covers count and composition changes. Our contributions in Section 1 now say so. Count and composition are where reuse-based scoring is weakest. With equal patch counts and discrete patch types shared with the reference, Proposition 1 shows that reuse misses a count change, while the assignment cost is bounded below in proportion to the difference in type counts. A rearrangement that preserves the patch-feature multiset leaves the assignment cost unchanged, and our exploratory LOCO split in Appendix H agrees. Of the 561 logical anomalies, 502 are outside the group that only rearranges parts, and assignment gains +5.29 over nearest neighbor on them. On the 59 placement-only anomalies, in three categories, the difference is -0.38, and its interval spans zero.
Q4. Yes: added to a trained host's score, the conditional excess raises logical AUROC. On EfficientAD-M we keep the host's score, calibration and fusion weight fixed and add one statistic at unit weight. That statistic is the excess minus the median excess of the nearest fitting normals, scaled without anomaly labels, keeping only its positive part (Appendix H, "Score fusion"). Across three 70,000-update seeds, this raises logical AUROC from 82.51 for the host alone to 88.08, while structural AUROC moves from 89.81 to 90.10, against 90.23 with Chamfer fusion. The gain over Chamfer is +2.55 (95% range over seeds 1.38 to 3.72; Appendix H, "Longer host"). On PatchCore the signal also lifts logical AUROC, at a structural cost of 1.4 points, beyond our harm margin, so EfficientAD-M is the host that keeps both.
A pooled bank is the default in the patch detectors of Table 19, including the four-shot system's patch branch, so a null for one-to-one matching on such a bank is not evidence against the constraint on complete references.